A PROBLEM IN STATIC STORAGE ALLOCATION.
Yoichiro Fukuda · 1966
Abstract : A primary objective of static allocation considered in this paper is to achieve efficiency in the internal operation of systems whose requirements are given and fixed, and whose function is to perform a number of different consecutive jobs. The SAGE system is a good example --the various programs and data in the system must be available in a predetermined sequence at specified times, and core storage space must be allotted to the programs and data in the most economical way. An algorithm is presented for deriving an optimal allocation scheme. This algorithm closely resembles, in spirit, a 'branch and bound' algorithm for the traveling salesman problem. (Author)