Optimal and pessimal orderings of steiner triple systems in disk arrays

Myra B. Cohen, Charles J. Colbourn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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)
Title of host publicationLATIN 2000
Subtitle of host publicationTheoretical Informatics - 4th Latin American Symposium, Proceedings
Pages95-104
Number of pages10
DOIs
StatePublished - 2000
Externally publishedYes
Event4th Latin American Symposium on Theoretical Informatics, LATIN 2000 - Punta del Este, Uruguay
Duration: Apr 10 2000Apr 14 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1776 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Latin American Symposium on Theoretical Informatics, LATIN 2000
Country/TerritoryUruguay
CityPunta del Este
Period4/10/004/14/00

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Optimal and pessimal orderings of steiner triple systems in disk arrays'. Together they form a unique fingerprint.

Cite this