𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Revisiting randomized parallel load balancing algorithms

✍ Scribed by Guy Even; Moti Medina

Book ID
116907329
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
346 KB
Volume
444
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel randomized load balancing
Parallel randomized load balancing
✍ Micah Adler; Soumen Chakrabarti; Michael Mitzenmacher; Lars Rasmussen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 313 KB

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

Data-parallel load balancing strategies
Data-parallel load balancing strategies
✍ Cyril Fonlupt; Philippe Marquet; Jean-Luc Dekeyser πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 456 KB
Distributed algorithms for QoS load bala
Distributed algorithms for QoS load balancing
✍ Heiner Ackermann; Simon Fischer; Martin Hoefer; Marcel SchΓΆngens πŸ“‚ Article πŸ“… 2010 πŸ› Springer-Verlag 🌐 English βš– 235 KB
Analysis of nearest neighbor load balanc
Analysis of nearest neighbor load balancing algorithms for random loads
✍ Peter Sanders πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 280 KB

Nearest neighbor load balancing algorithms, like diusion, are popular due to their simplicity, Β―exibility, and robustness. We show that they are also asymptotically very ecient when a random rather than a worst case initial load distribution is considered. We show that diusion needs Hlog n 2ad balan