Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Maximizing Performance in a Striped Disk Array

Peter M. Chen and David A. Patterson

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-90-559
February 1990

http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/CSD-90-559.pdf

Improvements in disk speeds have not kept up with improvements in processor and memory speeds. One way to correct the resulting speed mismatch is by striping data across many disks. In this paper, we address how to stripe data to get maximum performance from the disks. Specifically, we examine how to choose the striping unit, i.e. the amount of logically contiguous data on each disk. We synthesize rules for determining the best striping unit for a given range of workloads. We show 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. We derive an equation for the optimal striping unit as a function of these two parameters; we also show how to choose the striping unit without prior knowledge about the workload.


BibTeX citation:

@techreport{Chen:CSD-90-559,
    Author = {Chen, Peter M. and Patterson, David A.},
    Title = {Maximizing Performance in a Striped Disk Array},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1990},
    Month = {Feb},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/6180.html},
    Number = {UCB/CSD-90-559},
    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 by striping data across many disks. In this paper, we address how to stripe data to get maximum performance from the disks. Specifically, we examine how to choose the striping unit, i.e. the amount of logically contiguous data on each disk. We synthesize rules for determining the best striping unit for a given range of workloads.  We show 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. We derive an equation for the optimal striping unit as a function of these two parameters; we also show how to choose the striping unit without prior knowledge about the workload.}
}

EndNote citation:

%0 Report
%A Chen, Peter M.
%A Patterson, David A.
%T Maximizing Performance in a Striped Disk Array
%I EECS Department, University of California, Berkeley
%D 1990
%@ UCB/CSD-90-559
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/6180.html
%F Chen:CSD-90-559