No CrossRef data available.
Article contents
Optimal Computer Disk Access
Published online by Cambridge University Press: 27 July 2009
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.
- 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