Ladder orderings of pairs and RAID performance.

DOI10.1016/S0166-218X(03)00268-3zbMath1047.94017MaRDI QIDQ1428550

Myra B. Cohen, Charles J. Colbourn

Publication date: 29 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge access costedge ordering in graphsRAID disk array

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Related Items

Cyclic sequences of \(k\)-subsets with distinct consecutive unions ⋮ Egalitarian edge orderings of complete graphs ⋮ Cluttered orderings for the complete bipartite graph

Cites Work

• Coding techniques for handling failures in large disk arrays
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Asymptotically optimal erasure-resilient codes for large disk arrays.
• A geometric approach to root finding in GT(q/sup m/)
• Unnamed Item
• Unnamed Item