Performance of recovery time improvement algorithms for software RAIDs
Conference
·
OSTI ID:535542
- IBM Alamaden Research Center, San Jose, CA (United States)
A software RAID is a RAID implemented purely in software running on a host computer. One problem with software RAIDs is that they do not have access to special hardware such as NVRAM. Thus, software RAIDs may need to check every parity group of an array for consistency following a host crash or power failure. This process of checking parity groups is called recovery, and results in long delays when the software RAID is restarted. In this paper, we review two algorithms to reduce this recovery time for software RAIDs: the PGS Bitmap algorithm we proposed in and the List Algorithm proposed in. We compare the performance of these two algorithms using trace-driven simulations. Our results show that the PGS Bitmap Algorithm can reduce recovery time by a factor of 12 with a response time penalty of less than 1%, or by a factor of 50 with a response time penalty of less than 2%, and a memory requirement of around 9 Kbytes. The List Algorithm can reduce recovery time by a factor of 50 but cannot achieve a response time penalty of less than 16%.
- OSTI ID:
- 535542
- Report Number(s):
- CONF-961209--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Failing in place for low-serviceability storage infrastructure using high-parity GPU-based RAID.
Synchronous I/O Scheduling of Independent Write Caches for an Array of SSDs
ZFS on RBODs - Leveraging RAID Controllers for Metrics and Enclosure Management
Conference
·
Sat May 01 00:00:00 EDT 2010
·
OSTI ID:1020441
Synchronous I/O Scheduling of Independent Write Caches for an Array of SSDs
Journal Article
·
Thu Jan 08 19:00:00 EST 2015
· IEEE Computer Architecture Letters
·
OSTI ID:1565378
ZFS on RBODs - Leveraging RAID Controllers for Metrics and Enclosure Management
Technical Report
·
Mon Mar 30 00:00:00 EDT 2015
·
OSTI ID:1184101