Abstract
This Paper deals with the allocation of records on a linear storage device to minimize the average access time when the request probabilities to the recores are not independent. For sequential access, algorithms to obtain optimal and approximate solutions are presented. The approximation algorithm is also used with little modification for direct access. The performance of the approximation algorithm is estimated.
Zusammenfassung
Die Arbeit behandelt die Anordnung von Records auf einem linearen Speichermedium zur Minimisierung der mittleren Zugriffszeit, falls die Abfragewahrscheinlichkeit für die Records nicht unabhängig ist. Für sequentiellen Zugriff werden Algorithmen zur Berechnung der optimalen und näherungsweisen Lösungen angeführt. Der Näherungsalgorithmus wird, geringfügig modifiziert, auch für direkten Speicherzugriff verwendet. Die Komplexität des Näherungsalgorithmus wird abgeschätzt.
Similar content being viewed by others
References
Yue, P. C., Wong, C. K.: On the optimality of the probability ranking scheme in storage applications. Journal of the ACM20, 624–633 (1963).
Bergmans, P. P.: Minimizing expected travel time on geometrical patterns by optimal probability rearrangements. Inform. and Control20, 331–350 (1972).
Grossman, D. D., Silverman, H. F.: Placement of records on a secondary storage device to minimize access time. Journal of the ACM20, 429–438 (1973).
Karp, R. M., McKellar, A. C., Wong, C. K.: Near-optimal solutions to a 2-dimensional placement problem. SIAM Journal on Computing4, 271–283 (1975).
Yue, P. C., Wong, C. K.: Near-optimal heuristics for an assignment problem in mass storage. Intern. J. Comp. and Inform. Sciences4, 281–294 (1975).
McKellar, A. C., Wong, C. K.: Dynamic placement of records in linear storage. Journal of the ACM25, 421–435 (1978).
Feller, W.: An introduction to probability theory and its applications, Vol. 1, chap. XV. New York: Wiley 1957.
Garey, M. R., Johnson, D. S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science1, 237–267 (1976).
Even, S., Shiloah, Y.: NP-completeness of several arrangement problems. Report Nr. 43, Israel Institute of Technology, Department of Computer Science, 1975.
Kohler, W. H., Steiglitz, K.: Enumerative and iterative computational approaches, in: Computer and job/shop scheduling theory (Coffman, E. G., jr., ed.). New York: Wiley 1976.
Knuth, K.: The art of computing programming, Vol. 1, chap. 2, pp. 332–336. Reading, Mass.: Addison Wesley 1973.
Coffman, E. G., jr., Denning, P. J.: Operating systems theory, pp. 198–218. Englewood Cliffs, N. J.: Prentice-Hall 1973.
Wong, C. K.: Minimizing expected head movement in one-dimensional and two-dimensional mass storage systems. Computing Surveys12, 167–178 (1980).
Vaquero, A., Troya, J. M.: Placement of records on linear storage devices. 8th World Computer Congress, IFIP Congress 80, Melbourne (Australia), pp. 330–336.
Troya, J. M.: Ordenación lineal de grafos para el almacenamiento de registros en memorias secundarias. Tesis doctoral, Universidad Complutense, Madrid, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vaquero, A., Troya, J.M. Optimization and approximation algorithm for placement of records on linear storage devices. Computing 28, 305–316 (1982). https://doi.org/10.1007/BF02279814
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02279814