Ordering disks for double erasure codes

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 229-236

  Cohen, M B ^a   Colbourn, C J ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; MATRIX ALGEBRA; MICROPROCESSOR CHIPS;

DISK ARRAYS;

MAGNETIC DISK STORAGE;

EID: 0034832162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378650     Document Type: Conference Paper

References (23)

1. Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering
2. Validity of the single processor approach to achieving large scale computing capabilities
3. EVENODD: An efficient scheme for tolerating double disk failures in raid architectures
4. Asymptotically optimal erasure-resilient codes for large disk arrays
5. RAID: High-performance, reliable secondary storage
6. Optimal and pessimal orderings of Steiner triple systems in disk arrays
7. Steiner triple systems as multiple erasure codes in large disk arrays
8. Coding techniques for handling failures in large disk arrays
9. File-access characteristics of parallel scientific workloads
10. Disk striping
11. Flexible use of redundancy in disk arrays
12. Parity logging: Overcoming the small write problem in redundant disk arrays
13. Low density MDS codes and factors of complete graphs