TY - JOUR
T1 - Optimal and pessimal orderings of Steiner triple systems in disk arrays
AU - Cohen, Myra B.
AU - Colbourn, Charles
N1 - Funding Information:
Research of the authors is supported by the Army Research OKce (USA) und er Grant no. DAAG55-98-1-0272 (Colbourn). Thanks to Sanjoy Baruah, Ron Gould, Alan Ling, and Alex Rosa for helpful comments.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
KW - Design configuration
KW - Disk array
KW - Erasure code
KW - Raid
KW - Steiner triple system
UR - http://www.scopus.com/inward/record.url?scp=0037282799&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037282799&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(02)00634-5
DO - 10.1016/S0304-3975(02)00634-5
M3 - Conference article
AN - SCOPUS:0037282799
SN - 0304-3975
VL - 297
SP - 103
EP - 117
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-3
T2 - Latin American Theoretical Informatics
Y2 - 10 April 2000 through 14 April 2000
ER -