𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-Line Load Balancing of Temporary Tasks on Identical Machines

✍ Scribed by Azar, Yossi; Epstein, Leah

Book ID
118198134
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
115 KB
Volume
18
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On-Line Load Balancing of Temporary Task
On-Line Load Balancing of Temporary Tasks
✍ Yossi Azar; Bala Kalyanasundaram; Serge Plotkin; Kirk R Pruhs; Orli Waarts πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 181 KB

O n -competitive algorithm. In addition, trying to overcome the ⍀ n lower bound for the case of unknown task duration, this paper initiates a study of the Ε½ load balancing problem for tasks with known duration i.e., the duration of a task . Ε½ . becomes known upon its arrival . For this case we show

On-Line Load Balancing for Related Machi
On-Line Load Balancing for Related Machines
✍ Piotr Berman; Moses Charikar; Marek Karpinski πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 105 KB

We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio ' of 3 q 8 f 5.828 for the deterministic version, and 3.31rln 2.155 f 4.311 for its randomized variant, improving the previous competitive rat

On-line restricted assignment of tempora
On-line restricted assignment of temporary tasks with unknown durations
✍ Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 85 KB

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