Issue No. 09 - September (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.954509
<p><b>Abstract</b>—The performance of today's database systems is usually limited by the speed of their I/O devices. Fast I/O systems can be built from an array of low cost disks working in parallel. This kind of disk architecture is called RAID (Redundant Arrays of Inexpensive Disks). RAID promises improvement over SLED (Single Large Expensive Disks) in performance, reliability, power consumption, and scalability. However, a general fact about RAID is that the “write” operation is difficult to speedup. In this paper, we propose a new RAID architecture, called <b>Dynamic Multiple Parity (DMP) Disk Array</b>, for serial transaction processing database systems. Serial transaction processing database systems include engineering database systems, fully replicated database systems using a completely centralized algorithm and distributed systems using the conservative timestamp ordering algorithm. DMP Disk Array can significantly increase the I/O throughput by incorporating multiple parity disks. Due to the inherent distributed sparing property, DMP Disk Array can provide normal service to the users under single disk failure condition. Delay and maximum throughput analysis on DMP Disk Array is performed. Results show that, for a typical “write” job proportion of 20 percent, DMP Disk Array can provide nearly 20 percent improvement on I/O throughput over that of RAID level 5 when one extra parity disk is used.</p>
RAID, disk arrays, I/O systems, database systems, transaction processing.
K.H. Yeung, T.S. Yum, "Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing", IEEE Transactions on Computers, vol. 50, no. , pp. 949-959, September 2001, doi:10.1109/12.954509