Coding techniques for handling failures in large disk arrays

DOI10.1007/BF01185210zbMath1338.68031OpenAlexW1531975040MaRDI QIDQ297238

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

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

reliabilityerror-correcting codesavailabilityinput/output architectureRAIDredundant disk arrays

Mathematics Subject Classification ID

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

Related Items

Algorithms for parallel memory, I: Two-level memories, Erasure-resilient codes from affine spaces, String layouts for a redundant array of inexpensive disks, Optimal and pessimal orderings of Steiner triple systems in disk arrays., Rank inequalities and separation algorithms for packing designs and sparse triple systems., Failed disk recovery in double erasure RAID arrays, Ladder orderings of pairs and RAID performance., Asymptotically optimal erasure-resilient codes for large disk arrays., Cluttered orderings for the complete bipartite graph, On small line sets with few odd-points

Cites Work

• String layouts for a redundant array of inexpensive disks
• Balanced incomplete block designs and related designs
• The Existence and Construction of Balanced Incomplete Block Designs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item