Asymptotically optimal erasure-resilient codes for large disk arrays

Discrete Applied Mathematics

Volumn 102, Issue 1-2, 2000, Pages 3-36

  Chee, Yeow Meng ^c   Colbourn, Charles J ^a   Ling, Alan C H ^b  

^a University of Vermont ^*  (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003095851     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00228-0     Document Type: Article

References (34)

1. Abel R.J.R. Some new BIBDs with. λ = 1 and 6 ≤ k ≤ 10 J. Combin. Des. 4:1996;27-50.
2. N. Alon, J. Edmonds, M. Luby, Linear time erasure codes with nearly optimal recovery, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1995, pp. 512-519.
3. G.M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities, in Proceedings of the AFIPS Spring Joint Computer Conference, Vol. 30, Washington, DC, 1967. AFIPS. pp. 483-485.
4. T. Beth, D. Jungnickel, H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1993.
5. A.E. Brouwer, Steiner triple systems without subconfigurations, Technical Report ZW 104/77 , Mathematisch Centrum Amsterdam, Amsterdam, 1977.
6. Chen P.M., Lee E.K., Gibson G.A., Katz R.H., Patterson D.A. RAID: high-performance, reliable secondary storage. ACM Comput. Surv. 26:1994;145-185.
7. C.J. Colbourn, J.H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996.
8. Colbourn C.J., Mendelsohn E., Rosa A., Širáň J. Anti-mitre Steiner triple systems. Graphs Combin. 10:1994;215-224.
9. Colbourn C.J., Rosa A. Leaves, excesses and neighbourhoods in triple systems. Austral. J. Combin. 4:1991;143-178.
10. Erdös P. Problems and results in combinatorial analysis. Creation Math. 9:1976;25.
11. Erdös P., Kleitman D.J. On coloring graphs to maximize the proportion of multicolored. k -edges J. Combin. Theory. 5:1968;149-164.
12. S. Furino, J. Yin, Y. Miao, Frames and Resolvable Designs, CRC Press, Boca Raton, FL, 1996.
13. G.A. Gibson, Redundant Disk Arrays: Reliable, Parallel Secondary Storage, MIT Press, Cambridge, MA, 1992.
14. Griggs T.S., Murphy J., Phelan J.S. Anti-Pasch Steiner triple systems. J. Combin. Inform. Systems Sci. 15:1990;79-84.
15. A. Hartman, K.T. Phelps, Steiner quadruple systems, in: J.H. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory: A Collection of Surveys, Wiley, New York, 1992, pp. 205-240 (Chapter 6).
16. 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.
17. A.C.H. Ling, C.J. Colbourn, M.J. Grannell, T.S. Griggs, Construction techniques for anti-Pasch Steiner triple systems, J. London Math. Soc., to appear.
18. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
19. Mathon R., Phelps K.T., Rosa A. A class of Steiner triple systems of order 21 and associated Kirkman systems. Math. Comput. 3:1981;209-222.
20. Mathon R., Phelps K.T., Rosa A. Small Steiner triple systems and their properties. Ars Combin. 15:1983;3-110.
21. McLeish M. On the existence of latin squares with no subsquares of order two. Utilitas Math. 8:1975;41-53.
22. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
23. Mozzochi J. On the difference between consecutive primes. J. Number Theory. 24:1986;181-187.
24. J. Novák, A note on disjoint cyclic Steiner triple systems, in: Proceedings of Symposium Prague, Academia, Praha, 1974, pp. 439-440.
25. D.A. Patterson, J.L. Hennessy, Computer Organization and Design: The Hardware / Software Interface, Morgan Kaufmann, San Mateo, CA, 1994.
26. Rabin M.O. Efficient dispersal of information for security, load balancing, and fault tolerance. J. Assoc. Comput. Mach. 36:1989;335-348.
27. Ray-Chaudhuri D.K., Wilson R.M. Solution of Kirkman's schoolgirl problem. Proc. Symp. Pure Math. Amer. Math. Soc. 19:1971;187-204.
28. Rees R. Two new direct product-type constructions for resolvable group-divisible designs. J. Combin. Des. 1:1993;15-26.
29. Rees R., Stinson D.R. Frames with block size four. Canad. J. Math. 44:1992;1030-1049.
30. Robinson R.M. The structure of certain triple systems. Math. Comput. 20:1975;233-241.
31. K. Salem, H. Garcia-Molina, Disk striping, in: Proceedings of the 2nd International Conference on Data Engineering, Washington, DC, IEEE, New York, 1986, pp: 336-342.
32. Schönheim J. On maximal systems of. k -tuples Stud. Sci. Math. Hungar. 1:1966;363-368.
33. Tonchev V.D., Vanstone S.A. On Kirkman triple systems of order 33. Discrete Math. 106/107:1992;493-496.
34. Zhu L., Du B., Zhang X. A few more RBIBDs with. k = 5 and λ =1 Discrete Math. 97:1991;409-417.