Steiner triple systems as multiple erasure correcting codes in large disk arrays

Myra B. Cohen; Charles J. Colbourn

Steiner triple systems as multiple erasure correcting codes in large disk arrays

Research output: Contribution to journal › Conference article › peer-review

Abstract

Desirable RAID architectures provide fast performance with minimal overhead costs and short reconstruction times. Increasing the size of a disk array decreases its reliability. Developing new architectures that guarantee no information is lost in the presence of multiple disk failures, therefore, becomes important as disk arrays grow large. One class of 3-erasure correcting codes which have minimal check disk overhead and update penalty arise from a class of well studied combinatorial designs, the Steiner triple systems. They provide data recovery for a large number of 4-erasures as well. A preliminary performance analysis using Steiner triple systems of order 15 as mappings for RAID is performed. The ordering of triples within a system appears to have the greatest impact on system performance.

Original language	English (US)
Pages (from-to)	288-294
Number of pages	7
Journal	IEEE International Performance, Computing and Communications Conference, Proceedings
State	Published - Jan 1 2000
Externally published	Yes
Event	IEEE International Performance, Computing, and Communications Conference (IPCCC 2000) - Phoenix, AZ, USA Duration: Feb 20 2000 → Feb 22 2000

ASJC Scopus subject areas

Media Technology

Fingerprint Dive into the research topics of 'Steiner triple systems as multiple erasure correcting codes in large disk arrays'. Together they form a unique fingerprint.

Cite this

@article{2d888d2eae8749228645eb9f083cfb07,

title = "Steiner triple systems as multiple erasure correcting codes in large disk arrays",

abstract = "Desirable RAID architectures provide fast performance with minimal overhead costs and short reconstruction times. Increasing the size of a disk array decreases its reliability. Developing new architectures that guarantee no information is lost in the presence of multiple disk failures, therefore, becomes important as disk arrays grow large. One class of 3-erasure correcting codes which have minimal check disk overhead and update penalty arise from a class of well studied combinatorial designs, the Steiner triple systems. They provide data recovery for a large number of 4-erasures as well. A preliminary performance analysis using Steiner triple systems of order 15 as mappings for RAID is performed. The ordering of triples within a system appears to have the greatest impact on system performance.",

author = "Cohen, {Myra B.} and Colbourn, {Charles J.}",

year = "2000",

month = jan,

day = "1",

language = "English (US)",

pages = "288--294",

journal = "IEEE International Performance, Computing and Communications Conference, Proceedings",

issn = "1097-2641",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE International Performance, Computing, and Communications Conference (IPCCC 2000) ; Conference date: 20-02-2000 Through 22-02-2000",

}

TY - JOUR

T1 - Steiner triple systems as multiple erasure correcting codes in large disk arrays

AU - Cohen, Myra B.

AU - Colbourn, Charles J.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Desirable RAID architectures provide fast performance with minimal overhead costs and short reconstruction times. Increasing the size of a disk array decreases its reliability. Developing new architectures that guarantee no information is lost in the presence of multiple disk failures, therefore, becomes important as disk arrays grow large. One class of 3-erasure correcting codes which have minimal check disk overhead and update penalty arise from a class of well studied combinatorial designs, the Steiner triple systems. They provide data recovery for a large number of 4-erasures as well. A preliminary performance analysis using Steiner triple systems of order 15 as mappings for RAID is performed. The ordering of triples within a system appears to have the greatest impact on system performance.

AB - Desirable RAID architectures provide fast performance with minimal overhead costs and short reconstruction times. Increasing the size of a disk array decreases its reliability. Developing new architectures that guarantee no information is lost in the presence of multiple disk failures, therefore, becomes important as disk arrays grow large. One class of 3-erasure correcting codes which have minimal check disk overhead and update penalty arise from a class of well studied combinatorial designs, the Steiner triple systems. They provide data recovery for a large number of 4-erasures as well. A preliminary performance analysis using Steiner triple systems of order 15 as mappings for RAID is performed. The ordering of triples within a system appears to have the greatest impact on system performance.

UR - http://www.scopus.com/inward/record.url?scp=0033741522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033741522&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0033741522

SP - 288

EP - 294

JO - IEEE International Performance, Computing and Communications Conference, Proceedings

JF - IEEE International Performance, Computing and Communications Conference, Proceedings

SN - 1097-2641

T2 - IEEE International Performance, Computing, and Communications Conference (IPCCC 2000)

Y2 - 20 February 2000 through 22 February 2000

ER -

Steiner triple systems as multiple erasure correcting codes in large disk arrays

Abstract

ASJC Scopus subject areas

Other files and links

Cite this