Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems

Given a set of records with known access probabilities, the problems of record placement, page allocation, and dynamic record placement to mimmlze read/write head movement for sequential as well as batched processing are discussed. The distance traveled by the head in the systems under consideration is modeled by the rectilinear (Ll), Euclidean (L2), and maximum (L=) metrics. Some open problems are mentioned at the end of the paper. © 1980, ACM. All rights reserved.