Ladder orderings of pairs and RAID performance

Discrete Applied Mathematics

Volumn 138, Issue 1-2, 2004, Pages 35-46

  Cohen, Myra B ^a   Colbourn, Charles J ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b Arizona State University   (United States)

Author keywords

Edge access cost; Edge ordering in graphs; RAID disk array

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; COSTS; INFORMATION ANALYSIS; LADDER NETWORKS; MATRIX ALGEBRA;

EDGE ACCESS COST; EDGE ORDERING IN GRAPHS; REDUNDANT ARRAY OF INDEPENDENT DISKS (RAID);

GRAPH THEORY;

EID: 1242264787     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00268-3     Document Type: Conference Paper

References (16)

1. Chee Y.M., Colbourn C.J., Ling A.C.H. Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Appl. Math. 102:2000;3-36.
2. Chen P.M., Lee E.K., Gibson G.A., Katz R.H., Patterson D.A. RAID. High-performance, reliable secondary storage ACM Comput. Surveys. 26:1994;145-185.
3. M.B. Cohen, Performance analysis of triple erasure codes in large disk arrays, Master's Thesis, University of Vermont, 1999.
4. M.B. Cohen, C.J. Colbourn, Steiner triple systems as multiple erasure codes in large disk arrays, Proceedings of IPCCC 2000, 19th IEEE International Conference on Performance, Computing and Communications, Phoenix AZ, 2000, pp. 288-294.
5. M.B. Cohen, C.J. Colbourn, Ordering disks for double erasure codes, Proceedings of Symposium on Parallel Algorithms and Architectures (SPAA01), Crete, July 2001, pp. 229-236.
6. M.B. Cohen, C.J. Colbourn, Optimal and pessimal orderings of Steiner triple systems in disk arrays, Theoret. Comput. Sci. 297 (2003) 103-117.
7. M.B. Cohen, C.J. Colbourn, D. Froncek, Cluttered orderings for the complete graph, COCOON 2001, Guilin, China, Lecture Notes in Computer Science, Vol. 2108, 2001, pp. 420-431.
8. Gibson G.A. Redundant Disk Arrays, Reliable Parallel Secondary Storage. 1992;MIT Press, Cambridge, MA.
9. Hellerstein L., Gibson G.A., Karp R.M., Katz R.H., Patterson D.A. Coding techniques for handling failures in large disk arrays. Algorithmica. 12:1994;182-208.
10. M.C. Holland, On-Line data reconstruction in redundant disk arrays, Ph.D. Thesis, Carnegie Mellon University, 1994.
11. E.K. Lee, Software and performance issues in the implementation of a RAID prototype, Technical Report CSD-90-573, University of California at Berkeley, 1990.
12. E.K. Lee, Performance modeling and analysis of disk arrays, Ph.D. Thesis, University of California at Berkeley, 1993.
13. P. Massiglia, The RAID Book, A Storage System Technology Handbook, 6th Edition, The RAID Advisory Board, 1997.
14. Stodolsky D., Gibson G., Holland M. Parity logging. overcoming the small write problem in redundant disk arrays Comput. Architect. News. 21:1993;64-75.
15. Vanstone S.A., van Oorschot P.C. An Introduction to Error Correcting Codes with Applications. 1989;Kluwer Academic Publishers, Dordrecht.
16. Wallis W.D. One-Factorizations. 1997;Kluwer Academic Publishers, Dordrecht.