Optimizing large data transfers in parity-declustered data layouts

DOI10.1016/J.JCSS.2014.11.013zbMath1320.68071OpenAlexW2085555056MaRDI QIDQ2256719

Eric J. Schwabe

Publication date: 20 February 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.11.013

zbMATH Keywords

fault tolerancearray codesdata layoutsdisk arraysraid

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Uses Software

• EVENODD

Cites Work

• Balanced incomplete block designs and related designs
• Evaluating approximately balanced parity-declustered data layouts for disk arrays
• Flexible usage of redundancy in disk arrays
• Efficient data mappings for parity-declustered data layouts
• EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
• STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
• On lowest density MDS codes
• MDS array codes with independent parity symbols

This page was built for publication: Optimizing large data transfers in parity-declustered data layouts