Cluttered orderings for the complete graph

Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek

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

3 Scopus citations


In a systematic erasure code for the correction of two simultaneous erasures, each information symbol must have two associated parity symbols. When implemented in a redundant array of independent disks (RAID), performance requirements on the update penalty necessitate that each information symbol be associated with no more parity symbols than the two required. This leads to a simple graph model of the erasure codes, with parity symbols as vertices and information symbols as edges. Ordering the edges so that no more than f check disks (vertices) appear amongan y set of d consecutive edges is found to optimize access performance of the disk array when d is maximized. These cluttered orderings are examined for the complete graph Kn. The maximum number d of edges is determined precisely when f ≤ 5 and when f = n - 1, and bounds are derived in the remaining cases.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings
EditorsJie Wang
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540424949
StatePublished - 2001
Event7th Annual International Conference on Computing and Combinatorics, COCOON 2001 - Guilin, China
Duration: Aug 20 2001Aug 23 2001

Publication series

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


Other7th Annual International Conference on Computing and Combinatorics, COCOON 2001

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.


Dive into the research topics of 'Cluttered orderings for the complete graph'. Together they form a unique fingerprint.

Cite this