✦ LIBER ✦

Improved Bounds for On-Line Load Balancing

✍ Scribed by M. Andrews; M. X. Goemans; L. Zhang

Book ID: 118776359
Publisher: Springer
Year: 1999
Tongue: English
Weight: 266 KB
Volume: 23
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009263

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line load balancing

✍ Yossi Azar; Andrei Z. Broder; Anna R. Karlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 789 KB

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

Improved strategies for dynamic load bal

Improved strategies for dynamic load balancing

✍ Chi-Chung Hui; Chanson, S.T. 📂 Article 📅 1999 🏛 IEEE Computer Society 🌐 English ⚖ 215 KB

Tight Bounds for Selfish and Greedy Load

Tight Bounds for Selfish and Greedy Load Balancing

✍ Ioannis Caragiannis; Michele Flammini; Christos Kaklamanis; Panagiotis Kanellopo 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 1016 KB

On-Line Load Balancing and Network Flow

✍ S. Phillips; J. Westbrook 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 200 KB

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