The performance of parity placements in disk arrays

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 m...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1993-06, Vol.42 (6), p.651-664
Main Authors: Lee, E.K., Katz, R.H.
Format: Article
Language:English
Subjects:
Applied sciences
Availability
Central Processing Unit
Computer science
Costs
Electronics
Encoding
Energy consumption
Exact sciences and technology
Magnetic and optical mass memories
Storage and reproduction of information
Sun
System performance
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.277289