DocumentCode
2202415
Title
Fast allocation algorithms
Author
Johnson, David S.
fYear
1972
fDate
25-27 Oct. 1972
Firstpage
144
Lastpage
154
Abstract
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior. Linear time algorithms are then introduced which, though "faster" than FIRST FIT and BEST FIT, have the same, or better, worst case behavior. Finally, an improved polynomial-time algorithm is found for a problem of scheduling on multiprocessing systems, by treating this as a bin packing problem.
Keywords
Multiprocessing systems; Polynomials; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1972., IEEE Conference Record of 13th Annual Symposium on
Conference_Location
USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1972.4
Filename
4569707
Link To Document