The performance of parity placements in disk arrays
- 1 June 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (6) , 651-664
- https://doi.org/10.1109/12.277289
Abstract
Due to recent advances in central processing unit (CPU) and memory system performance, input/output (I/O) systems are increasingly limiting the performance of modern computer systems. Redundant arrays of inexpensive disks (RAID) have been proposed to meet the impending I/O crisis. RAIDs substitute many small inexpensive disks for a few large expensive disks to provide higher performance, smaller footprints, and lower power consumption at a lower cost than the large expensive disks they replace. RAIDs provide high availability by using parity encoding of data to survive disk failures. It is shown that the way parity is distributed in a RAID has significant consequences for performance. The performances of eight different parity placements are investigated using simulation.Keywords
This publication has 8 references indexed in Scilit:
- Introduction to redundant arrays of inexpensive disks (RAID)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- How reliable is a RAID?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Input/output behavior of supercomputing applicationsPublished by Association for Computing Machinery (ACM) ,1991
- An evaluation of redundant arrays of disks using an Amdahl 5890Published by Association for Computing Machinery (ACM) ,1990
- Disk system architectures for high performance computingProceedings of the IEEE, 1989
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988
- Multi-disk management algorithmsACM SIGMETRICS Performance Evaluation Review, 1987
- Synchronized Disk InterleavingIEEE Transactions on Computers, 1986