Revisiting randomized parallel load balancing algorithms
We deal with the well studied allocation problem of assigning n balls to n bins so that the maximum number of balls assigned to the same bin is minimized. We focus on randomized, constant-round, distributed, asynchronous algorithms for this problem. Adler et al. (1998) [1] presented lower bounds and...
Uložené v:
| Vydané v: | Theoretical computer science Ročník 444; s. 87 - 99 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
27.07.2012
|
| Predmet: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | We deal with the well studied allocation problem of assigning n balls to n bins so that the maximum number of balls assigned to the same bin is minimized. We focus on randomized, constant-round, distributed, asynchronous algorithms for this problem.
Adler et al. (1998) [1] presented lower bounds and upper bounds for this problem. A similar lower bound appears in Berenbrink et al. (1999) [2]. The general lower bound is based on a topological assumption. Our first contribution is the observation that the topological assumption does not hold for two algorithms presented by Adler etal. (1998) [1]. We amend this situation by presenting proofs of the lower bound for these two specific algorithms.
We present an algorithm in which a ball that was not allocated in the first round retries with a new choice in the second round. We present tight bounds on the maximum load obtained by our algorithm. The analysis is based on analyzing the expectation and transforming it to a bound with high probability using martingale tail inequalities.
Finally, we present a 3-round heuristic with a single synchronization point. We conducted experiments that demonstrate its advantage over parallel algorithms for 106≤n≤8⋅106 balls and bins. In fact, the obtained maximum load meets the best experimental results for sequential algorithms. |
|---|---|
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/j.tcs.2012.01.009 |