Maximizing performance in a striped disk array

118Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Chen, P. M., & Patterson, D. A. (1990). Maximizing performance in a striped disk array. In Conference Proceedings - Annual Symposium on Computer Architecture (pp. 322–331). Publ by IEEE. https://doi.org/10.1145/325164.325158

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free