skip to main content
research-article
Free Access

Triple-Parity RAID and Beyond: As hard-drive capacities continue to outpace their throughput, the time has come for a new level of RAID.

Published:01 December 2009Publication History
Skip Abstract Section

Abstract

How much longer will current RAID techniques persevere? The RAID levels were codified in the late 1980s; double-parity RAID, known as RAID-6, is the current standard for high-availability, space-efficient storage. The incredible growth of hard-drive capacities, however, could impose serious limitations on the reliability even of RAID-6 systems. Recent trends in hard drives show that triple-parity RAID must soon become pervasive. In 2005, Scientific American reported on Kryder’s law, which predicts that hard-drive density will double annually. While the rate of doubling has not quite maintained that pace, it has been close.

References

  1. Berriman, E., Feresten, P., Kung, S. 2006. NetApp RAID-DP: Dual-parity RAID-6 protection without compromise; http://media.netapp.com/documents/netapp-raid-dp.pdf.Google ScholarGoogle Scholar
  2. Blaum, M., Brady, J., Bruck, J., Menon, J. 1994. EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures. Proceedings of the International Symposium on Computer Architecture: 245-254; http://doi.acm.org/10.1145/191995.192033. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Chen, P., Lee, E., Patterson, D., Gibson, G., Katz, R. 1993. RAID: High-performance, reliable secondary storage. Technical Report CSD 93-778; http://portal.acm.org/citation.cfm?id=893811. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Corbett, P., English, B., Goel, A., Grcanac, T., Kleiman, S., Leong, J., Sankar, S. 2004. Row-diagonal parity for double disk failure correction. Proceedings of the 3rd Usenix Conference on File and Storage Technologies: 1-14; http://portal.acm.org/citation.cfm?id=1096673.1096677. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Elerath, J. 2007. Hard-disk drives: the good, the bad, and the ugly. Queue 5(6): 28-37; http://doi.acm.org/10.1145/1317394.1317403. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Gray, J. Fitzgerald, B. 2007. Flash Disk Opportunity for Server-Applications. Microsoft Research; http://research.microsoft.com/en-us/um/people/gray/papers/FlashDiskPublic.doc.Google ScholarGoogle Scholar
  7. Hitz, D. 2006. Why "Double Protecting RAID" (RAID-DP) doesn't waste extra disk space; http://blogs.netapp.com/dave/2006/05/why_double_prot.html.Google ScholarGoogle Scholar
  8. Leventhal, A. 2008. Flash storage today. Queue 6(4): 24-30; http://doi.acm.org/10.1145/1413254.1413262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Patterson, D., Gibson, G., Katz, R. 1988. A case for redundant arrays of inexpensive disks (RAID). Proceedings of ACM SIGMOD International Conference on Management of Data: 109-116; http://doi.acm.org/10.1145/50202.50214. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Plank, J. 1996. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Technical Report UT-CS-96-332; http://portal.acm.org/citation.cfm?id=898928. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Walter, C. 2005. Kryder's law. Scientific American (August); http://www.scientificamerican.com/article.cfm?id=kryders-law.Google ScholarGoogle Scholar

Index Terms

  1. Triple-Parity RAID and Beyond: As hard-drive capacities continue to outpace their throughput, the time has come for a new level of RAID.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Queue
          Queue  Volume 7, Issue 11
          Development
          December 2009
          24 pages
          ISSN:1542-7730
          EISSN:1542-7749
          DOI:10.1145/1661785
          Issue’s Table of Contents

          Copyright © 2009 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 December 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Popular
          • Editor picked

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format