Maximizing performance in a striped disk array

Peter M. Chen, David A. Patterson
1990 Proceedings of the 17th annual international symposium on Computer Architecture - ISCA '90  
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. 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
more » ... f 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.
doi:10.1145/325164.325158 dblp:conf/isca/ChenP90 fatcat:kh3c3zwpm5cfdgyhjtksqsl7sm