On-line load balancing

Yossi Azar; Andrei Z. Broder; Anna R. Karlin

doi:10.1109/SFCS.1992.267770

On-line load balancing

Yossi Azar, Andrei Z. Broder, Anna R. Karlin

Hewlett-Packard

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

62 Scopus citations

Abstract

The setup for the authors' problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a different level of service, and once assigned can not be re-assigned. They make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. The authors derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely /sup (3n)2/3//₂(1+o(1)), and derive a lower bound, Omega ( square root n), for any other deterministic or randomized on-line algorithm.

Original language	English
Title of host publication	Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Publisher	IEEE Computer Society
Pages	218-225
Number of pages	8
ISBN (Electronic)	0818629002
DOIs	https://doi.org/10.1109/SFCS.1992.267770
State	Published - 1992
Externally published	Yes
Event	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States Duration: 24 Oct 1992 → 27 Oct 1992

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	1992-October
ISSN (Print)	0272-5428

Conference

Conference	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Country/Territory	United States
City	Pittsburgh
Period	24/10/92 → 27/10/92

Access to Document

10.1109/SFCS.1992.267770

Cite this

@inproceedings{603b29a47d994dc69eff0455a217f12a,

title = "On-line load balancing",

abstract = "The setup for the authors' problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a different level of service, and once assigned can not be re-assigned. They make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. The authors derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely /sup (3n)2/3//2(1+o(1)), and derive a lower bound, Omega ( square root n), for any other deterministic or randomized on-line algorithm.",

author = "Yossi Azar and Broder, {Andrei Z.} and Karlin, {Anna R.}",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 ; Conference date: 24-10-1992 Through 27-10-1992",

year = "1992",

doi = "10.1109/SFCS.1992.267770",

language = "אנגלית",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "218--225",

booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

address = "ארצות הברית",

}

Azar, Y, Broder, AZ & Karlin, AR 1992, On-line load balancing. in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267770, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 218-225, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 24/10/92. https://doi.org/10.1109/SFCS.1992.267770

On-line load balancing. / Azar, Yossi; Broder, Andrei Z.; Karlin, Anna R.
Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 218-225 267770 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On-line load balancing

AU - Azar, Yossi

AU - Broder, Andrei Z.

AU - Karlin, Anna R.

PY - 1992

Y1 - 1992

N2 - The setup for the authors' problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a different level of service, and once assigned can not be re-assigned. They make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. The authors derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely /sup (3n)2/3//2(1+o(1)), and derive a lower bound, Omega ( square root n), for any other deterministic or randomized on-line algorithm.

AB - The setup for the authors' problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a different level of service, and once assigned can not be re-assigned. They make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. The authors derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely /sup (3n)2/3//2(1+o(1)), and derive a lower bound, Omega ( square root n), for any other deterministic or randomized on-line algorithm.

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

U2 - 10.1109/SFCS.1992.267770

DO - 10.1109/SFCS.1992.267770

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958603398

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 218

EP - 225

BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

PB - IEEE Computer Society

T2 - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

Y2 - 24 October 1992 through 27 October 1992

ER -

On-line load balancing

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this