Title :
Combinatorial analysis of an efficient algorithm for processor and storage allocation
Author :
Coffman, E.G., Jr. ; Leung, Joseph Y T
fDate :
Oct. 31 1977-Nov. 2 1977
Abstract :
A combinatorial problem related to storage allocation is analyzed. The problem falls into a class of NP-complete, one-dimensional bin-packing problems. We propose an iterative approximation algorithm and show that it is superior to an earlier heuristic presented for this problem. The bulk of the paper is devoted to the proof of a worst-case performance bound.
Keywords :
Algorithm design and analysis; Approximation algorithms; Bismuth; Computer science; Iterative algorithms; Performance analysis; Polynomials; Processor scheduling; Scheduling algorithm; Terminology;
Conference_Titel :
Foundations of Computer Science, 1977., 18th Annual Symposium on
Conference_Location :
Providence, RI, USA
DOI :
10.1109/SFCS.1977.8
