Hostname: page-component-89b8bd64d-9prln Total loading time: 0 Render date: 2026-05-06T11:41:45.978Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Computer Disk Access

Published online by Cambridge University Press:  27 July 2009

Rhonda Righter
Rhonda Righter
Affiliation:
Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, California 95053
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider several models of computer disk access and show that in many cases greedy policies, such as the nearest server policy, minimize the process of distances traveled by heads on circular, spherical, or linear data media. This minimization is in the joint stochastic or lower orthant sense.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 12 , Issue 2 , April 1998 , pp. 211 - 220
Copyright
Copyright © Cambridge University Press 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1984). Optimal head separation in a disk system with two read/write heads. Journal of the Association for Computing Machinery 31: 826–838.CrossRefGoogle Scholar
2.Calderbank, A.R., Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1985). Sequencing problems in two-server systems. Mathematics of Operations Research 10: 585–598.Google Scholar
3.Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1985). Sequencing two servers on a sphere. Stochastic Models 1: 17–28.CrossRefGoogle Scholar
4.Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1988). Optimal directory placement on disk storage devices. Journal of the Association for Computing Machinery 35: 433–446.Google Scholar
5.Hofri, M. (1983). Should the two-headed disk be greedy?—Yes it should. Information Processing Letters 16: 83–85.Google Scholar
6.Pandelis, D.G. & Teneketzis, D. (1996). Optimal sequencing in multiserver systems. Probability in the Engineering and Informational Sciences 10: 377–396.Google Scholar