Architecture of a fault-tolerant cached RAID controller

58Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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 and the Floating Parity Approach. 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 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.

Cite

CITATION STYLE

APA

Menon, J., & Cortney, J. (1993). Architecture of a fault-tolerant cached RAID controller. In Conference Proceedings - Annual Symposium on Computer Architecture (pp. 76–86). Publ by IEEE. https://doi.org/10.1145/173682.165144

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free