Ladder orderings of pairs and RAID performance.
type: Item
instance of: scholarly article
title: Ladder orderings of pairs and RAID performance.
zbMATH Open document ID: 1047.94017
DOI: 10.1016/S0166-218X(03)00268-3
author: Myra B. Cohen
author: Charles J. Colbourn
published in: Discrete Applied Mathematics
publication date: 2004-03-29T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 2062811
zbMATH Keywords: edge ordering in graphs
zbMATH Keywords: RAID disk array
zbMATH Keywords: edge access cost
MaRDI profile type: Publication
cites work: Asymptotically optimal erasure-resilient codes for large disk arrays.
cites work: Optimal and pessimal orderings of Steiner triple systems in disk arrays.
cites work: Q4551381
cites work: Coding techniques for handling failures in large disk arrays
cites work: A geometric approach to root finding in GT(q/sup m/)
cites work: Q4332941
Recommended article: A performance evaluation of RAID architectures
Recommended article: Optimal striping in RAID architecture
Recommended article: Analytic modeling of clustered RAID with mapping based on nearly random permutation
Recommended article: Reliability and performance of hierarchical RAID with multiple controllers
Recommended article: Q3128929
description: scientific article; zbMATH DE number 2062811