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. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Cohen, M. B., & Colbourn, C. J. (2000). Optimal and pessimal orderings of steiner triple systems in disk arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 95–104). https://doi.org/10.1007/10719839_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
