A generalized bound on LPT sequencing

Authors:
E. G. Coffman, Jr.;Ravi Sethi
Affiliations:
-;-
Venue:
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Year:
1976

Citing 0
Cited 4

Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms

ACM Computing Surveys (CSUR)
Scheduling with bully selfish jobs

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Load balancing on an interactive multiplayer game server

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we shall generalize Graham's result so as to include a parameter characterizing the number of tasks assigned to processors by the LPT rule. The new result will show that the worst-case performance bound for LPT sequencing approaches unity approximately as 1+1/k, where k is the least number of tasks on any processor, or where k is the number of tasks on a processor whose last task terminates the schedule. Thus, we shall have a result very similar to the parameterized bounds for bin-packing heuristics [JDUGG]. We shall also obtain out of the analysis an alternate proof of Graham's result.