✦ LIBER ✦

On-Line Load Balancing and Network Flow

✍ Scribed by S. Phillips; J. Westbrook

Publisher: Springer
Year: 1998
Tongue: English
Weight: 200 KB
Volume: 21
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009214

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

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

Perfect load balancing on the star inter

Perfect load balancing on the star interconnection network

✍ N. Imani; H. Sarbazi-Azad; S. G. Akl 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 526 KB

On-line adaptive optimal load flow

✍ M.A. Sheirah; M.B. Eteiba; M.A. El-Sayed; M.I. Auf 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Balanced graphs and network flows

✍ Penrice, Stephen G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be com