A general packing algorithm for multidimensional resource requirements

Many problems in resource allocations, memory allocation, and distributed computer system design can be formulated as problems of packing variablesized items into fixed-sized containers in order to minimize the total number of containers used. In this paper, a generalized packing algorithm that encompasses many well-known heuristic packing algorithms is proposed. Simulation results on this generalized packing algorithm are described, and their implications are discussed. The objective of this paper is to investigate the performance of various heuristic packing algorithms within a general framework, to obtain numerical estimates on their efficiency, and to provide guidelines on the use of these algorithms. © 1977 Plenum Publishing Corporation.