Abstract
This paper deals with the assignment of items to an array based on access probabilities so that the expected access time is minimized. The only necessary condition for optimality known to date is that of pairwise majorization. This condition, however, is far from being sufficient. Procedures are developed (1) to enumerate all configurations that satisfy this condition and (2) to obtain tight lower bounds for the optimal solution. An algorithm based on stepwise minimization is proposed and is demonstrated to give near-optimal performance. Numerical results are presented to show that the heuristics yield an actual cost within 0.8 % of the optimal regardless of the underlying distribution and the array size. Furthermore, this algorithm only depends on the ranking of access frequencies and not on the exact values.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. H. Hardy, J. E. Littlewood, and G. Pólya,Inequalities (University Press, Cambridge, 1952).
P. P. Bergmans, “Minimizing expected travel time on geometrical patterns by optimal probability rearrangements,”Inf. and Control 20:331–350 (1972).
D. D. Grossman and H. F. Silverman, “Placement of records on a secondary storage device to minimize access time,”J. ACM 20(3):429–438 (July 1973).
V. R. Pratt, “AnN logN algorithm to distributeN records optimally in a sequential access file,” inComplexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds. (Plenum Press, New York, 1972).
P. C. Yue and C. K. Wong, “On the optimality of the probability ranking scheme in storage applications,”J. ACM 20(4):624–633 (October 1973).
P. C. Gilmore, “Optimal and suboptimal algorithms for the quadratic assignment problem,”J. Soc. Ind. Appl. Math. 10:305–313 (1962).
M. Hanan and J. Kurtzberg, “A review of the placement and quadratic assignment problems,”SIAM Rev. 14(2):324–342 (April 1972).
A. S. Hoagland, “Mass storage: past, present and future,”Computer 1973 (September): 29–33.
M. C. Easton, “Model for interactive data base reference string,” to appear.
R. M. Karp, A. C. McKellar, and C. K. Wong, “Near-optimal solutions to a 2-dimensional placement problem,”SIAM J. Computing (September 1975) (to appear).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yue, P.C., Wong, C.K. Near-optimal heuristics for an assignment problem in mass storage. International Journal of Computer and Information Sciences 4, 281–294 (1975). https://doi.org/10.1007/BF00979370
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00979370