TY - GEN
T1 - Parallel randomized load balancing
T2 - 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010
AU - Even, Guy
AU - Medina, Moti
PY - 2010
Y1 - 2010
N2 - We extend the lower bound of Adler et. al [1] and Berenbrink [2] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is of n balls and n bins. The algorithms begin by each ball choosing d bins independently and uniformly at random. The balls and bins communicate to determine the assignment of each ball to a bin. The goal is to minimize the maximum load, i.e., the number of balls that are assigned to the same bin. In [1,2], a lower bound of Ω (r√log n/ log log n)is proved if the communication is limited to r rounds. Three assumptions appear in the proofs in [1,2]: the topological assumption, random choices of confused balls, and symmetry. We extend the proof of the lower bound so that it holds without these three assumptions. This lower bound applies to every parallel randomized load balancing algorithm we are aware of [1,2,3,4].
AB - We extend the lower bound of Adler et. al [1] and Berenbrink [2] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is of n balls and n bins. The algorithms begin by each ball choosing d bins independently and uniformly at random. The balls and bins communicate to determine the assignment of each ball to a bin. The goal is to minimize the maximum load, i.e., the number of balls that are assigned to the same bin. In [1,2], a lower bound of Ω (r√log n/ log log n)is proved if the communication is limited to r rounds. Three assumptions appear in the proofs in [1,2]: the topological assumption, random choices of confused balls, and symmetry. We extend the proof of the lower bound so that it holds without these three assumptions. This lower bound applies to every parallel randomized load balancing algorithm we are aware of [1,2,3,4].
KW - Balls and bins
KW - Load balancing
KW - Lower bounds
KW - Static randomized parallel allocation
UR - http://www.scopus.com/inward/record.url?scp=77249126467&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-11266-9_30
DO - 10.1007/978-3-642-11266-9_30
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77249126467
SN - 3642050050
SN - 9783642050053
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 358
EP - 369
BT - SOFSEM 2010
Y2 - 23 January 2010 through 29 January 2010
ER -