Berenbrink, PetraPetraBerenbrinkFriedetzky, ThomasThomasFriedetzkyKaaser, DominikDominikKaaserKling, PeterPeterKling2025-02-252025-02-252019-05Proceedings - IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019: 8821017978-1-7281-1246-6978-1-7281-1247-3https://hdl.handle.net/11420/54451We consider the following load balancing process for m tokens distributed arbitrarily among n nodes connected by a complete graph. In each time step a pair of nodes is selected uniformly at random. Let ℓ1 and ℓ2 be their respective number of tokens. The two nodes exchange tokens such that they have [(ℓ1 + ℓ2)/2] and [(ℓ1 + ℓ2)/2] tokens, respectively. We provide a simple analysis showing that this process reaches almost perfect balance within O(n log n + n log Δ) steps with high probability, where Δ is the maximal initial load difference between any two nodes. This bound is asymptotically tight.enTechnology::600: TechnologyConference Paper10.1109/IPDPS.2019.00080Conference Paper