Analytic modeling of clustered RAID with mapping based on nearly random permutation

DOI10.1109/12.485575MaRDI QIDQ4420935zbMATH OpenOpenAlexFDO

Authors Arif Merchant, Philip S. Yu

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.485575

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Recommendations

• Design and performance analysis of a disk array system
• Reliability and performance of hierarchical RAID with multiple controllers
• A performance evaluation of RAID architectures
• String layouts for a redundant array of inexpensive disks
• Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs

Cited in

(9)

• Ladder orderings of pairs and RAID performance.
• Reliability and performance of hierarchical RAID with multiple controllers
• String layouts for a redundant array of inexpensive disks
• Reliability analysis model of cluster storage system by object grouping
• Analytic modeling and comparisons of striping strategies for replicated disk arrays
• Design and performance analysis of a disk array system
• Parity information placement in the disk array model
• A stochastic analysis of hard disk drives
• Reconstruct versus read-modify writes in RAID

This page was built for publication: Analytic modeling of clustered RAID with mapping based on nearly random permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420935)