Cluttered orderings for the complete graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 420-431

  Cohen, Myra B ^a   Colbourn, Charles J ^b   Froncek, Dalibor ^c  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b University of Vermont ^*  (United States)

^c VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

FORWARD ERROR CORRECTION;

CLUTTERED ORDERINGS; COMPLETE GRAPHS; DISK ARRAY; ERASURE CODES; GRAPH MODEL; INFORMATION SYMBOL; PERFORMANCE REQUIREMENTS; REDUNDANT ARRAY OF INDEPENDENT DISKS;

GRAPH THEORY;

EID: 23044530394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_48     Document Type: Conference Paper

References (17)

1. Juraj Bosák. Decompositions of Graphs. Kluwer Academic Publishers, Dordrecht, 1990.
2. Yeow MengChee, Charles J. Colbourn and Alan C. H. Ling. Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Applied Mathematics 102 (2000), 3–36.
3. Peter M. Chen, Edward K. Lee, Garth A. Gibson, Randy H. Katz and David A. Patterson. RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26 (1994) 145–185.
4. Myra B. Cohen. Performance analysis of triple erasure codes in large disk arrays. Master’s thesis, University of Vermont, 1999.
5. M.B. Cohen and C.J. Colbourn. Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theoretical Computer Science, to appear.
6. M.B. Cohen and 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), 2000, pp. 288-294.
7. M.B. Cohen and C.J. Colbourn. Ladder orderings of pairs and RAID performance. submitted for publication, 2000.
8. M.B. Cohen and C.J. Colbourn. Orderingedg es for double erasure codes. Proceedings of the Symposium on Parallel Algorithms and Architectures, Crete, July 2001, to appear.
9. Garth A. Gibson. Redundant Disk Arrays, Reliable Parallel Secondary Storage. MIT Press, 1992.
10. Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz and David A. Patterson. Codingtec hniques for handlingfailures in large disk arrays. Algorithmica 12 (1994) 182–208.
11. Mark C. Holland. On-Line Data Reconstruction In Redundant Disk Arrays. PhD thesis, Carnegie Mellon University, 1994.
12. Edward K. Lee. Software and performance issues in the implementation of a RAID prototype. Technical Report CSD-90-573, University of California at Berkeley, 1990.
13. Edward K. Lee. Performance Modeling and Analysis of Disk Arrays. PhD thesis, University of California at Berkeley, 1993.
14. Paul Massiglia. The RAID Book, A Storage System Technology Handbook, 6th Edition. The RAID Advisory Board, 1997.
15. Alexander Rosa. On certain valuations of the vertices of a graph. Theory of Graphs (Internat. Sympos., Rome, 1966), Gordon and Breach, New York, 1967, pp. 349–355.
16. K. Salem and H. Garcia-Molina. Disk striping. In Proceedings of the 2nd International Conference on Data Engineering, pages 336–342, Washington, D. C., 1986. IEEE.
17. Daniel Stodolsky, Garth Gibson, and Mark Holland. Parity logging: Overcoming the small write problem in redundant disk arrays. Computer Architecture News 21 (1993), 64-75.