On-Line Load Balancing for Related Machines
Authors:
- Piotr BermanPBPiotr Berman
- Moses CharikarMCMoses Charikar
- Marek KarpinskiMKMarek Karpinski
- 1 April 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 35 (1) , 108-121
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An improved approximation ratio for the minimum latency problemMathematical Programming, 1998
- A lower bound for randomized on-line multiprocessor schedulingInformation Processing Letters, 1997
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- Improved scheduling algorithms for minsum criteria1996
- A lower bound for randomized on-line scheduling algorithmsInformation Processing Letters, 1994
- Probabilistic computations: Toward a unified measure of complexity1977
- Yet more on the linear search problemIsrael Journal of Mathematics, 1970
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966