• DocumentCode
    1609245
  • Title

    Maximizing performance in a striped disk array

  • Author

    Chen, Peter M. ; Patterson, David A.

  • Author_Institution
    Div. of Comput. Sci., California Univ., Berkeley, CA
  • fYear
    1990
  • Firstpage
    322
  • Lastpage
    331
  • Abstract
    Improvements in disk speeds have not kept up with improvements in processor and memory speeds. One way to correct the resulting speed mismatch is to stripe data across many disks. The authors address how to stripe data to get maximum performance from the disks. Specifically, they examine how to choose the striping unit, that is, the amount of logically contiguous data on each disk. Rules for determining the best striping unit for a given range of workloads are synthesized. It is shown how the choice of striping unit depends on only two parameters: (1) the number of outstanding requests in the disk system at any given time, and (2) the average positioning time×data transfer rate of the disks. The authors derive an equation for the optimal striping unit as a function of these two parameters; they also show how to choose the striping unit without prior knowledge about the workload
  • Keywords
    magnetic disc storage; storage management; disks; performance; striped disk array; striping unit; workload; Aging; Concurrent computing; Delay; Frequency; Strontium; Switches;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Architecture, 1990. Proceedings., 17th Annual International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    0-8186-2047-1
  • Type

    conf

  • DOI
    10.1109/ISCA.1990.134542
  • Filename
    134542