Cluttered orderings for the complete graph

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

doi:10.1007/3-540-44679-6_48

Cluttered orderings for the complete graph

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

Mathematics & Statistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

Abstract

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 K_n. 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 language	English (US)
Title of host publication	Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings
Editors	Jie Wang
Publisher	Springer Verlag
Pages	420-431
Number of pages	12
ISBN (Print)	9783540424949
DOIs	https://doi.org/10.1007/3-540-44679-6_48
State	Published - 2001
Event	7th Annual International Conference on Computing and Combinatorics, COCOON 2001 - Guilin, China Duration: Aug 20 2001 → Aug 23 2001

Publication series

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

Other

Other	7th Annual International Conference on Computing and Combinatorics, COCOON 2001
Country/Territory	China
City	Guilin
Period	8/20/01 → 8/23/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Publisher link

10.1007/3-540-44679-6_48

Find It

Find It at U of M Libraries

Cite this

Cohen, M. B., Colbourn, C. J., & Froncek, D. (2001). Cluttered orderings for the complete graph. In J. Wang (Ed.), Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings (pp. 420-431). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2108). Springer Verlag. https://doi.org/10.1007/3-540-44679-6_48

Cluttered orderings for the complete graph. / Cohen, Myra B.; Colbourn, Charles J.; Froncek, Dalibor.
Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings. ed. / Jie Wang. Springer Verlag, 2001. p. 420-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2108).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Cohen, MB, Colbourn, CJ & Froncek, D 2001, Cluttered orderings for the complete graph. in J Wang (ed.), Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2108, Springer Verlag, pp. 420-431, 7th Annual International Conference on Computing and Combinatorics, COCOON 2001, Guilin, China, 8/20/01. https://doi.org/10.1007/3-540-44679-6_48

Cohen MB, Colbourn CJ, Froncek D. Cluttered orderings for the complete graph. In Wang J, editor, Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings. Springer Verlag. 2001. p. 420-431. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44679-6_48

Cohen, Myra B. ; Colbourn, Charles J. ; Froncek, Dalibor. / Cluttered orderings for the complete graph. Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings. editor / Jie Wang. Springer Verlag, 2001. pp. 420-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d004c87b17044638bc5b9701308608b5,

title = "Cluttered orderings for the complete graph",

abstract = "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.",

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

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 7th Annual International Conference on Computing and Combinatorics, COCOON 2001 ; Conference date: 20-08-2001 Through 23-08-2001",

year = "2001",

doi = "10.1007/3-540-44679-6_48",

language = "English (US)",

isbn = "9783540424949",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "420--431",

editor = "Jie Wang",

booktitle = "Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings",

}

TY - GEN

T1 - Cluttered orderings for the complete graph

AU - Cohen, Myra B.

AU - Colbourn, Charles J.

AU - Froncek, Dalibor

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/3-540-44679-6_48

DO - 10.1007/3-540-44679-6_48

M3 - Conference contribution

AN - SCOPUS:23044530394

SN - 9783540424949

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 420

EP - 431

BT - Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings

A2 - Wang, Jie

PB - Springer Verlag

T2 - 7th Annual International Conference on Computing and Combinatorics, COCOON 2001

Y2 - 20 August 2001 through 23 August 2001

ER -

Cluttered orderings for the complete graph

Abstract

Publication series

Other

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this