ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Systems and Software
Volume 79, Issue 11, November 2006, Pages 1599-1605
Software Cybernetics
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (165 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.jss.2006.02.035    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier Inc. All rights reserved.

Shortcut method for reliability comparisons in RAID

Alexander ThomasianCorresponding Author Contact Information, a, E-mail The Corresponding Author

aComputer Science Department, New Jersey Institute of Technology, Newark, NJ 07102, USA

Received 19 August 2005; 
revised 15 February 2006; 
accepted 17 February 2006. 
Available online 2 May 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Given that the reliability of each disk in a disk array during its useful lifetime is given as r = 1 − epsilon (Porson) with epsilon (Porson) much less-than 1, we show that the reliability of a RAID disk array tolerating all possible n − 1 disk failures can be specified as R ≈ 1 − anepsilon (Porson)n, where an is the smallest nonzero coefficient in the corresponding asymptotic expansion, e.g., for n-way replication R = 1 − epsilon (Porson)n. We compare the reliability of several mirrored disk organizations, which provide tradeoffs between reliability and load balancedness (after disk failure) by comparing their a2 values, which can be obtained via a partial reliability analysis taking into account a few disk failures. We next use asymptotic expansions to compare the reliability of hierarchical RAID disk arrays, which combine replication and rotated parity disk arrays (RAID5 and RAID6). Finally, we argue that the mean time to data loss in systems with repair is related to the reliability without repair. As part of this discussion we show how to estimate the mean time to data loss in RAID5 and RAID6 disk arrays without resorting to transient analysis.

Keywords: Redundant Arrays of Independent Disks – RAID; Mirrored disks; Multilevel RAID arrays; Reliability modeling; Asymptotic expansions; Hierarchical RAID; RAID repair; Rebuild time

Abbreviations: BM, basic mirroring; CD, chained declustering; GRD, group rotated declustering; ID, interleaved declustering; JBOD, just a bunch of disks; kDFT, k disk failure tolerant; LSF, latent sector failure; MTTDL, mean time to data loss; MTTF, mean time to failure; MTTR, mean time to repair; RAIDi, RAID level i; RDP, rotated diagonal parity

Article Outline

1. Introduction
2. Asymptotic reliability expression
3. RAID1 organizations and their reliability
3.1. Basic mirroring with N disks
3.2. Group rotate declustering
3.3. Interleaved declustering
3.4. Chained declustering
3.5. RAID1 reliability comparison
4. RAID5, RAID6, and multilevel RAID
5. Reliability modeling
6. Conclusions
Acknowledgements
Appendix. Repair time in RAID5
References

Journal of Systems and Software
Volume 79, Issue 11, November 2006, Pages 1599-1605
Software Cybernetics
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.