A Fast Parity Resynchronization Scheme for Small and Mid-sized RAIDs


KIPS Transactions on Computer and Communication Systems, Vol. 2, No. 10, pp. 413-420, Oct. 2013
10.3745/KTCCS.2013.2.10.413,   PDF Download:

Abstract

Redundant arrays of independent disks (RAID) without a power-fail-safe component in small and mid-sized business suffers from intolerably long resynchronization time after a unclean power-failure. Data blocks and a parity block in a stripe must be updated in a consistent manner, however a data block may be updated but the corresponding parity block may not be updated when a power goes off. Such a partially modified stripe must be updated with a correct parity block. However, it is difficult to find which stripe is partially updated (inconsistent). The widely-used traditional parity resynchronization manner is a intolerably long process that scans the entire volume to find and fix inconsistent stripes. This paper presents a fast resynchronization scheme with a negligible overhead for small and mid-sized RAIDs. The proposed scheme is integrated into a software RAID driver in a Linux system. According to the performance evaluation, the proposed scheme shortens the resynchronization process from 200 minutes to 5 seconds with 2% overhead for normal I/Os.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Ba다 and K. W. Park, "A Fast Parity Resynchronization Scheme for Small and Mid-sized RAIDs," KIPS Transactions on Computer and Communication Systems, vol. 2, no. 10, pp. 413-420, 2013. DOI: 10.3745/KTCCS.2013.2.10.413.

[ACM Style]
Sung Hoon Ba다 and Ki Wong Park. 2013. A Fast Parity Resynchronization Scheme for Small and Mid-sized RAIDs. KIPS Transactions on Computer and Communication Systems, 2, 10, (2013), 413-420. DOI: 10.3745/KTCCS.2013.2.10.413.