Skip to main content
Springer Nature Link
Log in

String layouts for a redundant array of inexpensive disks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

This article introduces the concept of abad square in aredundant array of inexpensive disks (RAID). Bad squares are used to prove upper limits on the reliability of the2d-parity arrangement when there is the possibility that astring of disks may fail simultaneously. Bad-square analysis motivates several optimal string layouts which achieve these limits. Bad squares also provide a means to calculate the mean time to data loss for a RAID layout, without the use of Monte Carlo simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Blackston and C. Olson. Personal communication.

  2. G. A. Gibson. Redundant disk arrays: Reliable, parallel secondary storage. Technical Report UCB/CSD 91/613, University of California, Berkeley, CA 94720, May 1991. Ph.D. thesis.

    Google Scholar 

  3. L. Hellerstein, G. A. Gibson, R. M. Karp, R. H. Katz, and D. A. Patterson. Coding techniques for handling failures in large disk arrays.Algorithmica, this issue, pp. 182–208.

  4. R. H. Katz, G. A. Gibson, and D. A. Patterson. Disk system architectures for high performance computing.Proceedings of the IEEE, 77(12): 1842–1858, December 1989.

    Article  Google Scholar 

  5. E. K. Lee and R. H. Katz. Performance consequences of parity placement in disk arrays.IEEE Transactions on Computers, 42(6): 651–664, June 1993.

    Article  Google Scholar 

  6. J. Menon and J. Kasson. Methods for improved update performance of disk arrays, Technical Report RJ6928 (66034), IBM, November 1990.

  7. D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (RAID).Proceedings of the 1988 ACM Conference on Management of Data (SIGMOD), Chicago, IL, June 1–3, 1988, pp. 109–116.

  8. A. L. N. Reddy and P. Banerjee. Graceful degradation of disk arrays.Proceedings of the Twenty-First International Symposium on Fault-Tolerant Computing, Montreal, June 25–27, 1991. IEEE Computer Society Press, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, 94720, Berkeley, CA, USA

    L. Newberg & D. Wolfe

Authors
  1. L. Newberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Wolfe
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Jeffrey Scott Vitter.

The first author was supported by a National Science Foundation Graduate Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Newberg, L., Wolfe, D. String layouts for a redundant array of inexpensive disks. Algorithmica 12, 209–224 (1994). https://doi.org/10.1007/BF01185211

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01185211

Key words

Search

Navigation