On-line restricted assignment of temporary tasks with unknown durations

Authors:
Amitai Armon;Yossi Azar;Leah Epstein;Oded Regev
Affiliations:
Department of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel;Department of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel;School of Computer Science, The Interdisciplinary Center, Herzliya, Israel;Institute for Advanced Study, Princeton, NJ
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 0

The competitiveness of on-line assignments

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
On-line load balancing of temporary tasks

Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
An improved lower bound for load balancing of tasks with unknown duration

Information Processing Letters
Temporary tasks assignment resolved

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-Line Load Balancing of Temporary Tasks on Identical Machines

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)

Quantified Score

Hi-index	0.89

Visualization

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.