Summary
The instruction set of many computers permits referencing certain areas of main storage more efficiently than others. For example, “base-offset” addressing favors small offsets. This report discusses the problem of how to optimally assign data to storage on such a machine, subject to the restriction that the locations chosen are not to change with time. The emphasis is on truly optimal solutions, although many simplifying assumptions are made. Some of the results apply to the problem of optimally placing “read-only” files on auxiliary storage. Areas for further work are suggested.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellman, R., Dreyfus, S.E.: Applied dynamic programming. Princeton (NJ.): Princeton University Press 1962
Garfinkel, R.S., Nemhauser, G.L.: Integer programming. New York: Wiley 1972
Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Operations Res. 14, 1045–1074 (1966)
Greenberg, H.: Integer programming. New York: Academic Press 1971
Horowitz, E., Sartaj, S.: Computing partitions with applications to the knapsack problem. J. Assoc. Comput. Mach. 21, 2 277–292 (1974)
Hu, T.C.: Integer programming and network flows. Reading (Mass.): Addison-Wesley 1969
Liu, C.L.: Introduction to combinatorial mathematics. New York: McGraw-Hill 1968
Salkin, H.M., de Kluyver, C.A.: The knapsack problem: a survey. Naval Res. Logist. Quart. 22, 127–144 (1975)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Warren, H.S. Static main storage packing problems. Acta Informatica 9, 355–376 (1978). https://doi.org/10.1007/BF00289048
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289048