Abstract
Steiner triple systems are well studied combinatorial designs that have been shown to possess properties desirable for the construction of multiple erasure codes in RAID architectures. The ordering of the columns in the parity check matrices of these codes affects system performance. Combinatorial problems involved in the generation of good and bad column orderings are defined, and examined for small numbers of accesses to consecutive data blocks in the disk array.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chee, Y.M., Colbourn, C.J., Ling, A.C.H.: Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Applied Mathematics (to appear)
Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26, 145–185 (1994)
Cohen, M.B., Colbourn, C.J.: Steiner triple systems as multiple erasure codes in large disk arrays (submitted)
Cohen, M.B.: Performance analysis of triple erasure codes in large disk arrays. Master’s thesis, University of Vermont (1999)
Colbourn, C.J., Rosa, A.: Triple Systems. Oxford University Press, Oxford (1999)
Gibson, G.A.: Redundant Disk Arrays, Reliable Parallel Secondary Storage. MIT Press, Cambridge (1992)
Grannell, M.J., Griggs, T.S., Whitehead, C.A.: The resolution of the anti-Pasch conjecture. Journal of Combinatorial Designs (to appear)
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, 182–208 (1994)
Holland, M.C.: On-Line Data Reconstruction In Redundant Disk Arrays. PhD thesis, Carnegie Mellon University (1994)
Horák, P., Rosa, A.: Decomposing Steiner triple systems into small configurations. Ars Combinatoria 26, 91–105 (1988)
Komlós, J., Sárközy, G., Szemerédi, E.: On the Pósa-Seymour conjecture. Journal of Graph Theory 29, 167–176 (1998)
Lee, E.K.: Software and performance issues in the implementation of a RAID prototype. Technical Report CSD-90-573, University of California at Berkeley (1990)
Lee, E.K.: Performance Modeling and Analysis of Disk Arrays. PhD thesis, University of California at Berkeley (1993)
Ling, A.C.H., Colbourn, C.J., Grannell, M.J., Griggs, T.S.: Construction techniques for anti-Pasch Steiner triple systems. Journal of the London Mathematical Society (to appear)
Massiglia, P.: The RAID Book, A Storage System Technology Handbook, 6th edn. The RAID Advisory Board (1997)
Vanstone, S.A., van Oorschot, P.C.: An Introduction to Error Correcting Codes with Applications. Kluwer Academic Publishers, Dordrecht (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, M.B., Colbourn, C.J. (2000). Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_10
Download citation
DOI: https://doi.org/10.1007/10719839_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive