[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Striping in a RAID level 5 disk array

Published: 01 May 1995 Publication History

Abstract

Redundant disk arrays are an increasingly popular way to improve I/O system performance. Past research has studied how to stripe data in non-redundant (RAID Level 0) disk arrays, but none has yet been done on how to stripe data in redundant disk arrays such as RAID Level 5, or on how the choice of striping unit varies with the number of disks. Using synthetic workloads, we derive simple design rules for striping data in RAID Level 5 disk arrays given varying amounts of workload information. We then validate the synthetically derived design rules using real workload traces to show that the design rules apply well to real systems.We find no difference in the optimal striping units for RAID Level 0 and 5 for read-intensive workloads. For write-intensive workloads, in contrast, the overhead of maintaining parity causes full-stripe writes (writes that span the entire error-correction group) to be more efficient than read-modify writes or reconstruct writes. This additional factor causes the optimal striping unit for RAID Level 5 to be four times smaller for write-intensive workloads than for read-intensive workloads.We next investigate how the optimal striping unit varies with the number of disks in an array. We find that the optimal striping unit for reads in a RAID Level 5 varies inversely to the number of disks, but that the optimal striping unit for writes varies with the number of disks. Overall, we find that the optimal striping unit for workloads with an unspecified mix of reads and writes is independent of the number of disks.Together, these trends lead us to recommend (in the absence of specific workload information) that the striping unit over a wide range of RAID Level 5 disk array sizes be equal to 1/2 * average positioning time * disk transfer rate.

References

[1]
Peter M. Chen and David A. Patterson. Maximizing Performance in a Striped Disk Array. In Proceedings of the 1990 International Symposium on Computer Architecture, pages 322-331, May 1990.
[2]
Peter J. Denning and Jeffrey P. Buzen. The Operational Analysis of Queueing Network Models. ACM Computing Surveys, 10(3), September 1978.
[3]
Jim Gray, Bob Horst, and Mark Walker. Parily Striping of Disc Arrays: Low-Cost Reliablte Storage with Acceptable Throughput. In Proceedings of the 16th Very Large Database Conference, pages 148-160, 1990. VLDB XVI.
[4]
IBM 0661 Disk Drive Product Description- Model 371. Technical report, IBM, July 1989.
[5]
Edward K. Lee and Randy H. Katz. An Analytic Performance Model of Disk Arrays and i~ts Applications. Technical Report UCB/CSD 91/660, University of California at Berkeley, 1991.
[6]
Edward K. Lee and Randy H. Katz. An Analytic Performance Model of Disk Arrays. In Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 98-109, May 1993.
[7]
Edward K. Lee and Randy H. Katz. The Performance of Parity Placement in Disk Arrays. IEEE Transactions on Computers, 42(6), June 1993.
[8]
Ethan L. Miller and Randy H. Katz. Input/Output Behavior of Supercomputing Applications. In Proceedings of Supercomputing 1991, pages 567-576, November 1991.
[9]
DavidA. Patterson, Garth Gibson, and Randy H. Katz. A Case for Redundant Arrays of Inexpensive Disks (RAID). In International Conference on Management of Data (SIGMOD), pages 109-116, June 1988.
[10]
Chris Ruemmler and John Wilkes. An Introduction to Disk Drive Modeling. IEEE Computer, pages 17-28, March 1994.
[11]
Peter Scheuermann, Gerhard Weikum, and Peter Zabback. Automatic Tuning of Data Placement and Load Balancing in Disk Array:s. Database Systems for Next-Generation Applications: Principles and Practice, 1991. DBS-92-91.
[12]
Jean Thisquen. Seek Time Measurement:s. Technical report, Amdahl Peripheral ProduclLs Division, May 1988.
[13]
Gerhard Weikum and Peter Zabback. Tuning of Striping Units in Disk-Array-Based File Systems. In Proceedings of the 2nd International Workshop on Research Issues on Data Engineering: Transaction and Que~y Processing, pages 80-87, 1992.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 23, Issue 1
May 1995
323 pages
ISSN:0163-5999
DOI:10.1145/223586
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMETRICS '95/PERFORMANCE '95: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
    May 1995
    340 pages
    ISBN:0897916956
    DOI:10.1145/223587
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: 01 May 1995
Published in SIGMETRICS Volume 23, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)262
  • Downloads (Last 6 weeks)31
Reflects downloads up to 27 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2022)ESDUJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.05.003167:C(173-186)Online publication date: 1-Sep-2022
  • (2019)Metadata Log Management for Full Stripe Parity in Flash Storage SystemsThe Journal of Korean Institute of Information Technology10.14801/jkiit.2019.17.11.1717:11(17-26)Online publication date: 30-Nov-2019
  • (2017)PARIXProceedings of the 2017 USENIX Conference on Usenix Annual Technical Conference10.5555/3154690.3154745(581-587)Online publication date: 12-Jul-2017
  • (2015)dDRAID: A technique for capacity and performance enhancement of RAID storage systems2015 Annual IEEE India Conference (INDICON)10.1109/INDICON.2015.7443331(1-6)Online publication date: Dec-2015
  • (2014)CRAIDProceedings of the 12th USENIX conference on File and Storage Technologies10.5555/2591305.2591319(133-146)Online publication date: 17-Feb-2014
  • (2010)ALVIEEE Transactions on Computers10.1109/TC.2009.15059:3(345-357)Online publication date: 1-Mar-2010
  • (2009)Modelling Zoned RAID Systems Using Fork-Join Queueing SimulationProceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering10.1007/978-3-642-02924-0_2(16-29)Online publication date: 2-Jul-2009
  • (2008)SEAIEEE Transactions on Computers10.1109/TC.2008.2757:6(748-761)Online publication date: 1-Jun-2008
  • (2008)Optimizing the Embedded Caching and Prefetching Software on a Network-Attached Storage SystemProceedings of the 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing - Volume 0110.1109/EUC.2008.119(152-161)Online publication date: 17-Dec-2008
  • (2003)Taking advantage of heterogeneity in disk arraysJournal of Parallel and Distributed Computing10.1016/S0743-7315(03)00038-863:4(448-464)Online publication date: 1-Apr-2003
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media