Abstract
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 \(\Omega(\sqrt[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].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, M., Chakrabarti, S., Mitzenmacher, M., Rasmussen, L.E.: Parallel Randomized Load Balancing. Random Struct. Algorithms 13(2), 159–188 (1998)
Berenbrink, P., auf der Heide, F.M., Schröder, K.: Allocating Weighted Jobs in Parallel. Theory of Computing Systems 32(3), 281–300 (1999)
Stemann, V.: Parallel Balanced Allocations. In: SPAA 1996, pp. 261–269. ACM, New York (1996)
Even, G., Medina, M.: Revisiting Randomized Parallel Load Balancing Algorithms. In: SIROCCO 2009 (2009)
Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced Allocations. SIAM Journal on Computing 29(1), 180–200 (2000)
Raab, M., Steger, A.: “Balls into Bins” - A Simple and Tight Analysis. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 159–170. Springer, Heidelberg (1998)
Kolchin, V., Sevastyanov, B., Chistyakov, V.: Random Allocations. John Wiley & Sons, Chichester (1978)
Czumaj, A., auf der Heide, F., Stemann, V.: Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal On Computing 29(5), 1703–1739 (2000)
Voecking, B.: How Asymmetry Helps Load Balancing. Journal of the ACM 50(4), 568–589 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, G., Medina, M. (2010). Parallel Randomized Load Balancing: A Lower Bound for a More General Model. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)