Optimal Computer Disk Access
Rhonda Righter · Probability in the Engineering and Informational Sciences · 1998
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.