Coding techniques for handling failures in large disk arrays

DOI10.1007/BF01185210MaRDI QIDQ297238zbMATH OpenOpenAlexFDO

Authors Lisa Hellerstein, Glenn A. Gibson, Richard Karp, Randy H. Katz, David A. Patterson

Publication date 24 June 2016

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01185210

zbMATH Keywords

reliabilityavailabilityerror-correcting codesinput/output architectureRAIDredundant disk arrays

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Asymptotically optimal erasure-resilient codes for large disk arrays.
• Failed disk recovery in double erasure RAID arrays
• Flexible usage of redundancy in disk arrays
• EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
• New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures

Cites work

• scientific article; zbMATH DE number 3841285 (Why is no real title available?)
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• Balanced incomplete block designs and related designs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• String layouts for a redundant array of inexpensive disks
• The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(14)

• Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs
• Rank inequalities and separation algorithms for packing designs and sparse triple systems.
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Erasure-resilient codes from affine spaces
• Ladder orderings of pairs and RAID performance.
• String layouts for a redundant array of inexpensive disks
• Cluttered orderings for the complete bipartite graph
• Single Disk Failure Recovery for X-Code-Based Parallel Storage Systems
• On small line sets with few odd-points
• Asymptotically optimal erasure-resilient codes for large disk arrays.
• Algorithms for parallel memory, I: Two-level memories
• Failed disk recovery in double erasure RAID arrays
• New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures
• scientific article; zbMATH DE number 2154518 (Why is no real title available?)

This page was built for publication: Coding techniques for handling failures in large disk arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297238)