On-line load balancing of temporary tasks on identical machines

Yossi Azar; Leah Epstein

doi:10.1137/S0895480197329296

On-line load balancing of temporary tasks on identical machines

Yossi Azar
, Leah Epstein

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

Abstract

We prove an exact lower bound of 2 -1/M on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 - 2/m+1 randomized algorithms. For small values of m we give an improved randomized lower bound of 2 - 1/m.

Original language	English
Pages (from-to)	347-352
Number of pages	6
Journal	SIAM Journal on Discrete Mathematics
Volume	18
Issue number	2
DOIs	https://doi.org/10.1137/S0895480197329296
State	Published - Oct 2004
Externally published	Yes

Keywords

Competitive ratio
Load balancing
On-line
Scheduling
Temporary tasks

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/S0895480197329296

Cite this

@article{7f0178be9a6646448f53a97ce6a0c0a0,

title = "On-line load balancing of temporary tasks on identical machines",

abstract = "We prove an exact lower bound of 2 -1/M on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 - 2/m+1 randomized algorithms. For small values of m we give an improved randomized lower bound of 2 - 1/m.",

keywords = "Competitive ratio, Load balancing, On-line, Scheduling, Temporary tasks",

author = "Yossi Azar and Leah Epstein",

year = "2004",

month = oct,

doi = "10.1137/S0895480197329296",

language = "English",

volume = "18",

pages = "347--352",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - On-line load balancing of temporary tasks on identical machines

AU - Azar, Yossi

AU - Epstein, Leah

PY - 2004/10

Y1 - 2004/10

N2 - We prove an exact lower bound of 2 -1/M on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 - 2/m+1 randomized algorithms. For small values of m we give an improved randomized lower bound of 2 - 1/m.

AB - We prove an exact lower bound of 2 -1/M on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 - 2/m+1 randomized algorithms. For small values of m we give an improved randomized lower bound of 2 - 1/m.

KW - Competitive ratio

KW - Load balancing

KW - On-line

KW - Scheduling

KW - Temporary tasks

UR - https://www.scopus.com/pages/publications/18744397552

U2 - 10.1137/S0895480197329296

DO - 10.1137/S0895480197329296

M3 - Article

AN - SCOPUS:18744397552

SN - 0895-4801

VL - 18

SP - 347

EP - 352

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

On-line load balancing of temporary tasks on identical machines

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this