Abstract
Two mathematical models dealing with optimal placement of directories on disk devices are analyzed. Storage addresses on the disk are approximated by points in the interval [0, 1]. Requests for information on the disk are represented by a sequence of file names. To process a request, a read-write head is first moved to a directory kept on the disk that specifies the address of the file, and then a head is moved to the specified address. The addresses are assumed to be independent and uniform on [0,1].
In the first model we consider a system of two heads separated by a fixed distance d and a directory situated at 0 ≤ x ≤ 1. In the second model we consider a system consisting of one head and n ≥ 2 directories at 0 ≤ x1 < x2 < … < xn ≤ 1. For both models we study the problem of finding those values of the parameters that minimize the expected head motion to process a request in statistical equilibrium.
- 1 CALDERBANK, A. R., COFFMAN, E. G., JR., AND FLATTO, L. Optimum head separation in a disk system with two read/write heads. Jr. ACM 31, 4 (Oct. 1984), 826-838. Google Scholar
- 2 CALDERBANK, A. R., COFFMAN, E. G., JR., AND FLATTO, L. Sequencing problems in two-server systems. Math. Oper. Res. 10 (1985), 585-598.Google Scholar
- 3 CALDERBANK, A. R., COFFMAN, E. G., JR., AND FLATTO, L. Sequencing two servers on a sphere. Stoch. Models. 1 (1985), 17-28.Google Scholar
- 4 FEJES-TOTH, L. Lagerungen in der Ebene auf der Kugel und der Raum. Springer-Verlag, Berlin, 1953.Google Scholar
- 5 HOFal, M. Disk scheduling: FCFS vs. SSTF revisited. Commun. ACM 23, 11 (Nov. 1980), 645-653; Corrigendum 24, 11 (Nov. 1981), 772. Google Scholar
- 6 HOFRI, M. Should the two-headed disk be greedy?mYes, it should. Inf. Process. Lett. 16 (1983), 83-85.Google Scholar
- 7 PAGE, I. P., AND WOOD, R. T. Empirical analysis of a moving head disc model with two heads separated by a fixed number of tracks. Comput. J. 24 (1981), 339-341.Google Scholar
Index Terms
- Optimal directory placement on disk storage devices
Recommendations
Optimal space allocation on disk storage devices
When the amount of space required for file storage exceeds the amount which can be kept online, decisions must be made as to which files are to be permanently resident and which mountable. These decisions will affect the number of mount requests issued ...
Optimal recovery of single disk failure in RDP code storage systems
Performance evaluation reviewModern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For example, conventional RAID-5 systems provide data availability for single ...
Optimal recovery of single disk failure in RDP code storage systems
SIGMETRICS '10: Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systemsModern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For example, conventional RAID-5 systems provide data availability for single ...
Comments