On-Line Load Balancing for Related Machines

Piotr Berman; Moses Charikar; Marek Karpinski

doi:10.1006/jagm.1999.1070

On-Line Load Balancing for Related Machines

Piotr Berman, Moses Charikar, Marek Karpinski

Research output: Contribution to journal › Article › peer-review

58 Scopus citations

Abstract

We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.

Original language	English (US)
Pages (from-to)	108-121
Number of pages	14
Journal	Journal of Algorithms
Volume	35
Issue number	1
DOIs	https://doi.org/10.1006/jagm.1999.1070
State	Published - Apr 2000

All Science Journal Classification (ASJC) codes

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1006/jagm.1999.1070

Cite this

@article{95ffcdaa249f4b8698539bc0869b072b,

title = "On-Line Load Balancing for Related Machines",

abstract = "We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.",

author = "Piotr Berman and Moses Charikar and Marek Karpinski",

note = "Funding Information: 2Supported by Stanford School of Engineering Groswith Fellowship, an ARO MURI Grant DAAH04-96-1-0007 and NSF Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation, and Xerox Corporation. E-mail: moses@ cs.stanford.edu. Funding Information: 3Partially supported by the DFG Grant KA 673 4-1, by the ESPRIT BR Grants 7097, 21726, EC-US 030, and by the Max-Planck Research Prize. E-mail: marek@cs.uni.bonn.de.",

year = "2000",

month = apr,

doi = "10.1006/jagm.1999.1070",

language = "English (US)",

volume = "35",

pages = "108--121",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - On-Line Load Balancing for Related Machines

AU - Berman, Piotr

AU - Charikar, Moses

AU - Karpinski, Marek

N1 - Funding Information: 2Supported by Stanford School of Engineering Groswith Fellowship, an ARO MURI Grant DAAH04-96-1-0007 and NSF Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation, and Xerox Corporation. E-mail: moses@ cs.stanford.edu. Funding Information: 3Partially supported by the DFG Grant KA 673 4-1, by the ESPRIT BR Grants 7097, 21726, EC-US 030, and by the Max-Planck Research Prize. E-mail: marek@cs.uni.bonn.de.

PY - 2000/4

Y1 - 2000/4

N2 - We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.

AB - We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.

UR - http://www.scopus.com/inward/record.url?scp=0009004515&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0009004515&partnerID=8YFLogxK

U2 - 10.1006/jagm.1999.1070

DO - 10.1006/jagm.1999.1070

M3 - Article

AN - SCOPUS:0009004515

VL - 35

SP - 108

EP - 121

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 1

ER -

On-Line Load Balancing for Related Machines

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this