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.
Unable to display preview. Download preview PDF.
- 1.Bellman, R., Dreyfus, S.E.: Applied dynamic programming. Princeton (NJ.): Princeton University Press 1962Google Scholar
- 2.Garfinkel, R.S., Nemhauser, G.L.: Integer programming. New York: Wiley 1972Google Scholar
- 3.Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Operations Res. 14, 1045–1074 (1966)Google Scholar
- 4.Greenberg, H.: Integer programming. New York: Academic Press 1971Google Scholar
- 5.Horowitz, E., Sartaj, S.: Computing partitions with applications to the knapsack problem. J. Assoc. Comput. Mach. 21, 2 277–292 (1974)Google Scholar
- 6.Hu, T.C.: Integer programming and network flows. Reading (Mass.): Addison-Wesley 1969Google Scholar
- 7.Liu, C.L.: Introduction to combinatorial mathematics. New York: McGraw-Hill 1968Google Scholar
- 8.Salkin, H.M., de Kluyver, C.A.: The knapsack problem: a survey. Naval Res. Logist. Quart. 22, 127–144 (1975)Google Scholar