Failed disk recovery in double erasure RAID arrays

DOI10.1016/j.jda.2006.03.003zbMath1135.68348OpenAlexW2029205318MaRDI QIDQ924549

Charles J. Colbourn, Kaushik Srinivasan

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.003

zbMATH Keywords

generating functionerror-correcting codeparity check matrixdisk architectureerasure resilient code

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of error-correcting codes and error-detecting codes (94B99)

Uses Software

• EVENODD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coding techniques for handling failures in large disk arrays
• Counting bridgeless graphs
• Asymptotically optimal erasure-resilient codes for large disk arrays.
• On Some Polynomials Related to Weight Enumerators of Linear Codes
• Efficient dispersal of information for security, load balancing, and fault tolerance
• EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
• On the computational complexity of the Jones and Tutte polynomials
• Random Graphs