The load rebalancing problem☆
References (15)
- et al.
A PTAS for the multiple knapsack problem
- P. Efraimidis, P. Spirakis, Randomized approximation schemes for scheduling unrelated parallel machines, Electronic...
- et al.
Grouping techniques for scheduling problems: simpler and faster
- et al.
Tight analyses of two local load balancing algorithms
Bounds for certain multiprocessing anomalies
Bell System Tech. J.
(1966)- et al.
Exploiting process lifetime distributions for dynamic load balancing
ACM Trans. Comput. Systems
(1997) - et al.
Using dual approximation algorithms for scheduling problems theoretical and practical results
J. ACM
(1987)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
A preliminary version of this paper appeared in 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003.
- 1
Supported in part by a Stanford Graduate Fellowship, NSF Grants EIA-0137761 and ITR-0331640, and a grant from SNRC.
- 2
Supported in part by NSF Grant IIS-0118173 and ITR-0331640, an Okawa Foundation Research Grant, an SNRC grant, and grants from Microsoft and Veritas.
- 3
Supported by a GRPW fellowship from Bell Labs, Lucent Technologies.
Copyright © 2004 Elsevier Inc. All rights reserved.