On-line restricted assignment of temporary tasks with unknown durations

Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)67-72
Number of pages6
JournalInformation Processing Letters
Volume85
Issue number2
DOIs
StatePublished - Jan 31 2003

Fingerprint

Greedy Algorithm
Assignment
Competitive Ratio
Unknown
Load Balancing
Resource allocation
Alternatives
Model

Keywords

  • Competitiveness
  • On-line algorithms
  • Temporary tasks

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On-line restricted assignment of temporary tasks with unknown durations. / Armon, Amitai; Azar, Yossi; Epstein, Leah; Regev, Oded.

In: Information Processing Letters, Vol. 85, No. 2, 31.01.2003, p. 67-72.

Research output: Contribution to journalArticle

Armon, Amitai ; Azar, Yossi ; Epstein, Leah ; Regev, Oded. / On-line restricted assignment of temporary tasks with unknown durations. In: Information Processing Letters. 2003 ; Vol. 85, No. 2. pp. 67-72.
@article{5b3d10096ac347ab89fc17f2c5bead2a,
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",
year = "2003",
month = "1",
day = "31",
doi = "10.1016/S0020-0190(02)00350-2",
language = "English (US)",
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

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

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

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

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

M3 - Article

VL - 85

SP - 67

EP - 72

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 2

ER -