On-line restricted assignment of temporary tasks with unknown durations

Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev

doi:10.1016/S0020-0190(02)00350-2

On-line restricted assignment of temporary tasks with unknown durations

Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev

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

Abstract

We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ(√m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m^2/3). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of m. We also show that for a small number of machines, namely m ≤ 5, the greedy algorithm is optimal.

Original language	English
Pages (from-to)	67-72
Number of pages	6
Journal	Information Processing Letters
Volume	85
Issue number	2
DOIs	https://doi.org/10.1016/S0020-0190(02)00350-2
State	Published - 31 Jan 2003
Externally published	Yes

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: [email protected] (A. Armon), [email protected] (Y. Azar), [email protected] (L. Epstein), [email protected] (O. Regev). 1 Research supported in part by the Israel Science Foundation (grant No. 250/01-1) and by a grant of the European Commission. 2 Research supported in part by the Israel Science Foundation (grant No. 250/01-1). 3 Research supported in part by NSF grant CCR-9987845.

Keywords

Competitiveness
On-line algorithms
Temporary tasks

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/S0020-0190(02)00350-2

Cite this

@article{b5d5e612d3214ec2bea9a690d238b427,

title = "On-line restricted assignment of temporary tasks with unknown durations",

abstract = "We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ(√m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m2/3). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of m. We also show that for a small number of machines, namely m ≤ 5, the greedy algorithm is optimal.",

keywords = "Competitiveness, On-line algorithms, Temporary tasks",

author = "Amitai Armon and Yossi Azar and Leah Epstein and Oded Regev",

note = "Funding Information: * Corresponding author. E-mail addresses: [email protected] (A. Armon), [email protected] (Y. Azar), [email protected] (L. Epstein), [email protected] (O. Regev). 1 Research supported in part by the Israel Science Foundation (grant No. 250/01-1) and by a grant of the European Commission. 2 Research supported in part by the Israel Science Foundation (grant No. 250/01-1). 3 Research supported in part by NSF grant CCR-9987845.",

year = "2003",

month = jan,

day = "31",

doi = "10.1016/S0020-0190(02)00350-2",

language = "English",

volume = "85",

pages = "67--72",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - On-line restricted assignment of temporary tasks with unknown durations

AU - Armon, Amitai

AU - Azar, Yossi

AU - Epstein, Leah

AU - Regev, Oded

N1 - Funding Information: * Corresponding author. E-mail addresses: [email protected] (A. Armon), [email protected] (Y. Azar), [email protected] (L. Epstein), [email protected] (O. Regev). 1 Research supported in part by the Israel Science Foundation (grant No. 250/01-1) and by a grant of the European Commission. 2 Research supported in part by the Israel Science Foundation (grant No. 250/01-1). 3 Research supported in part by NSF grant CCR-9987845.

PY - 2003/1/31

Y1 - 2003/1/31

N2 - We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ(√m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m2/3). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of m. We also show that for a small number of machines, namely m ≤ 5, the greedy algorithm is optimal.

AB - We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ(√m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m2/3). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of m. We also show that for a small number of machines, namely m ≤ 5, the greedy algorithm is optimal.

KW - Competitiveness

KW - On-line algorithms

KW - Temporary tasks

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

U2 - 10.1016/S0020-0190(02)00350-2

DO - 10.1016/S0020-0190(02)00350-2

M3 - Article

AN - SCOPUS:0037473761

SN - 0020-0190

VL - 85

SP - 67

EP - 72

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

On-line restricted assignment of temporary tasks with unknown durations

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this