Affiliation:
1. Computer Science Division, University of California, Berkeley
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. 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.
Publisher
Association for Computing Machinery (ACM)
Reference14 articles.
1. C.G. Bell The Mini and Micro Indusrries IEEE Computer Vol. 17. No. 10 (October 1984). pp. 14-30. 10.1109/MC.1984.1658955 C.G. Bell The Mini and Micro Indusrries IEEE Computer Vol. 17. No. 10 (October 1984). pp. 14-30. 10.1109/MC.1984.1658955
2. P. M. Chm. An Evaluation of Redundant Arrays of Disks Using an Amdahl5890 to appear in Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems May 1990. 10.1145/98457.98509 P. M. Chm. An Evaluation of Redundant Arrays of Disks Using an Amdahl5890 to appear in Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems May 1990. 10.1145/98457.98509
3. Imprimis Product Specijcatiorr-97209 Sabre Disk Drive IPI-Interface Document Number 64402302. revision F May 1989. Imprimis Product Specijcatiorr-97209 Sabre Disk Drive IPI-Interface Document Number 64402302. revision F May 1989.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献