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
Journal of the ACM
Paper
On the Optimality of the Probability Ranking Scheme in Storage Applications
Abstract
It is shown that a natural partitioning scheme based on the ranking of access probabilities is optimal in three specific storage applications. These applications include organization of an archival store, disk space allocation, and pagination. The use of Schur functions as an optimization technique is introduced. © 1973, ACM. All rights reserved.