Cluttered orderings for the complete graph

Show simple item record
dc.contributor.authorCohen, Myra B.
dc.contributor.authorColbourn, Charles J.
dc.contributor.authorFronček, Dalibor
dc.date.accessioned2006-11-07T12:58:40Z
dc.date.available2006-11-07T12:58:40Z
dc.date.issued2001
dc.description.abstract-enIn 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 among any 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 and when f = n-1, and bounds are derived in the remaining cases.en
dc.identifier.citationComputing and Combinatorics : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001. Proceedings. 2001, p. 420-431.en
dc.identifier.doi10.1007/3-540-44679-6_48
dc.identifier.issn0302-9743
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.urihttp://hdl.handle.net/10084/57872
dc.identifier.wos000179960000048
dc.language.isoenen
dc.publisherSpringeren
dc.relation.ispartofseriesComputing and Combinatorics : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001. Proceedingsen
dc.relation.urihttp://dx.doi.org/10.1007/3-540-44679-6_48en
dc.titleCluttered orderings for the complete graphen
dc.typearticleen

Files

Collections

Publikační činnost VŠB-TUO ve Web of Science / Publications of VŠB-TUO in Web of Science