Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Temporary Tasks Assignment Resolved Amitai Armon Yossi Azar y Leah Epstein z Oded Regev x
 

Summary: Temporary Tasks Assignment Resolved
Amitai Armon  Yossi Azar y Leah Epstein z Oded Regev x
Abstract
Among all basic on-line load balancing problems, the
only unresolved problem was load balancing of tempo-
rary 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 dura-
tions of jobs in the case where durations are known. We
resolve this problem by characterizing this dependency.
Finally, we provide a PTAS for the o -line problem
with a xed number of machines and show a 2 unap-
proximability for the general case.
1 Introduction
On-line load balancing was extensively studied in the
last decade (e.g., [1, 2, 3, 5, 10, 11, 13, 16, 18, 20,
23]). The basic problem contains the identical, related,
restricted and unrelated models for permanent and

  

Source: Azar, Yossi - School of Computer Science, Tel Aviv University
Epstein, Leah - Department of Mathematics, University of Haifa

 

Collections: Computer Technologies and Information Sciences; Mathematics