Optimal and pessimal orderings of Steiner triple systems in disk arrays

Myra B. Cohen, Charles Colbourn

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)103-117
Number of pages15
JournalTheoretical Computer Science
Volume297
Issue number1-3
DOIs
StatePublished - 2003

Fingerprint

Disk Array
Steiner Triple System
Combinatorial Design
Combinatorial Problems
Parity
Consecutive
System Performance
Architecture

Keywords

  • Design configuration
  • Disk array
  • Erasure code
  • Raid
  • Steiner triple system

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Optimal and pessimal orderings of Steiner triple systems in disk arrays. / Cohen, Myra B.; Colbourn, Charles.

In: Theoretical Computer Science, Vol. 297, No. 1-3, 2003, p. 103-117.

Research output: Contribution to journalArticle

@article{c6be63d444d74c7e8fa71090d2f23eff,
title = "Optimal and pessimal orderings of Steiner triple systems in disk arrays",
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.",
keywords = "Design configuration, Disk array, Erasure code, Raid, Steiner triple system",
author = "Cohen, {Myra B.} and Charles Colbourn",
year = "2003",
doi = "10.1016/S0304-3975(02)00634-5",
language = "English (US)",
volume = "297",
pages = "103--117",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Optimal and pessimal orderings of Steiner triple systems in disk arrays

AU - Cohen, Myra B.

AU - Colbourn, Charles

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 - Article

AN - SCOPUS:0037282799

VL - 297

SP - 103

EP - 117

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -