The architecture of a fault-tolerant cached RAID controller
- 1 May 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 21 (2) , 76-87
- https://doi.org/10.1145/173682.165144
Abstract
RAID-5 arrays need 4 disk accesses to update a data block—2 to read old data and parity, and 2 to write new data and parity. Schemes previously proposed to improve the update performance of such arrays are the Log-Structured File System [10] and the Floating Parity Approach [6]. Here, we consider a third approach, called Fast Write, which eliminates disk time from the host response time to a write, by using a Non-Volatile Cache in the disk array controller. We examine three alternatives for handling Fast Writes and describe a hierarchy of destage algorithms with increasing robustness to failures. These destage algorithms are compared against those that would be used by a disk controller employing mirroring. We show that array controllers require considerably more (2 to 3 times more) bus bandwidth and memory bandwidth than do disk controllers that employ mirroring. So, array controllers that use parity are likely to be more expensive than controllers that do mirroring, though mirroring is more expensive when both controllers and disks are considered.Keywords
This publication has 4 references indexed in Scilit:
- The architecture of a fault-tolerant cached RAID controllerPublished by Association for Computing Machinery (ACM) ,1993
- Floating Parity and Data Disk ArraysJournal of Parallel and Distributed Computing, 1993
- The IBM 3990 disk cachePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988