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
โ Scribed by Yossi Azar; Andrei Z. Broder; Anna R. Karlin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 789 KB
- Volume
- 130
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
It is well known that after placing n balls independently and uniformly at ## ลฝ . random into n bins, the fullest bin holds โฐ log nrlog log n balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one
This paper presents the design philosophy and implementation of the BALANCE system. BALANCE is a flexible, network independent and computer architecture independent load balancing system which allows the building of reusable parallel and distributed applications. By implementing related services as