Temporary tasks assignment resolved

Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem exists for almost a decade, see [Borodin El-Yaniv]. We resolve this problem by providing an unapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2 unapproximability for the general case.

Original languageEnglish (US)
Title of host publicationProceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
PublisherAssociation for Computing Machinery
Pages116-124
Number of pages9
Volume06-08-January-2002
ISBN (Print)089871513X
StatePublished - 2002
Event13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 - San Francisco, United States
Duration: Jan 6 2002Jan 8 2002

Other

Other13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
CountryUnited States
CitySan Francisco
Period1/6/021/8/02

Fingerprint

Task Assignment
Resource allocation
Load Balancing
Resolve
Competitive Ratio
Open Problems
Line

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Armon, A., Azar, Y., Epstein, L., & Regev, O. (2002). Temporary tasks assignment resolved. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 (Vol. 06-08-January-2002, pp. 116-124). Association for Computing Machinery.

Temporary tasks assignment resolved. / Armon, Amitai; Azar, Yossi; Epstein, Leah; Regev, Oded.

Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Vol. 06-08-January-2002 Association for Computing Machinery, 2002. p. 116-124.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Armon, A, Azar, Y, Epstein, L & Regev, O 2002, Temporary tasks assignment resolved. in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. vol. 06-08-January-2002, Association for Computing Machinery, pp. 116-124, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, San Francisco, United States, 1/6/02.
Armon A, Azar Y, Epstein L, Regev O. Temporary tasks assignment resolved. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Vol. 06-08-January-2002. Association for Computing Machinery. 2002. p. 116-124
Armon, Amitai ; Azar, Yossi ; Epstein, Leah ; Regev, Oded. / Temporary tasks assignment resolved. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Vol. 06-08-January-2002 Association for Computing Machinery, 2002. pp. 116-124
@inproceedings{03ef568a3a0f434f902bcce55526b88f,
title = "Temporary tasks assignment resolved",
abstract = "Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem exists for almost a decade, see [Borodin El-Yaniv]. We resolve this problem by providing an unapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2 unapproximability for the general case.",
author = "Amitai Armon and Yossi Azar and Leah Epstein and Oded Regev",
year = "2002",
language = "English (US)",
isbn = "089871513X",
volume = "06-08-January-2002",
pages = "116--124",
booktitle = "Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Temporary tasks assignment resolved

AU - Armon, Amitai

AU - Azar, Yossi

AU - Epstein, Leah

AU - Regev, Oded

PY - 2002

Y1 - 2002

N2 - Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem exists for almost a decade, see [Borodin El-Yaniv]. We resolve this problem by providing an unapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2 unapproximability for the general case.

AB - Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem exists for almost a decade, see [Borodin El-Yaniv]. We resolve this problem by providing an unapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2 unapproximability for the general case.

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

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

M3 - Conference contribution

SN - 089871513X

VL - 06-08-January-2002

SP - 116

EP - 124

BT - Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002

PB - Association for Computing Machinery

ER -