Download:
|
by Myra B. Cohen, Charles J. Colbourn
Proceedings of IPCCC 2000 (19th IEEE International Conference on Performance, Computing and Communications
http://www.emba.uvm.edu/~colbourn/src/stserasure.ps
Add To MetaCart
Abstract:
Abstract--- Desirable RAID architectures provide fast performance with minimal overhead costs and short reconstruction times. As the number of disks in an array increases, however, the probability that simultaneous failures occur also increases. This requires new architectures which can guarantee that no information is lost in the presence of multiple erasures. One class of 3-erasure correcting codes which have minimal check disk overhead and update penalty arise from Steiner triple systems. They provide data recovery for a large number of 4-erasures as well. These are well studied combinatorial designs. A preliminary performance analysis using Steiner triple systems of order 15 as mappings for RAID is performed. Computer simulation is used as the basis to explore different properties of Steiner triple systems which contribute to overall performance of these disk systems under normal and degraded mode. The different properties which contribute to performance in these arrays is examined. 1
Citations
|
264
|
RAID: high-performance, reliable secondary storage
– Chen
- 1994
|
|
126
|
Redundant Disk Arrays: Reliable, Parallel Secondary Storage
– Gibson
- 1992
|
|
76
|
Coding techniques for handling failures in large disk arrays
– Hellerstein, Gibson, et al.
- 1994
|
|
41
|
Tolerating Mul-tiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering
– Alvarez, Burkhard, et al.
- 1997
|
|
20
|
Software and performance issues in the implementation of a RAID prototype
– Lee
- 1990
|
|
18
|
Performance modeling and analysis of disk arrays
– Lee
- 1993
|
|
14
|
On-Line Data Reconstruction in Redundant Disk Arrays
– Holland
- 1994
|
|
7
|
Construction techniques for anti-Pasch Steiner triple systems
– Ling, Colbourn, et al.
- 1997
|
|
4
|
Performance analysis of triple erasure codes in large disk arrays
– Cohen
- 1999
|
|
4
|
The RAID Book, A Storage System Technology Handbook, 6th Edition. The RAID Advisory Board
– Massiglia
- 1997
|
|
1
|
Asymptotically optimal erasure-reslient codes for large disk arrays. Discrete Applied Mathematics
– Chee, Colbourn, et al.
|
|
1
|
On variable scope of parity protection in disk arrays
– Franaszek, Robinson
- 1997
|