About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ACM Computing Surveys (CSUR)
Paper
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
Abstract
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.