Tight bounds for parallel randomized load balancing
From MaRDI portal
Publication:5419070
DOI10.1145/1993636.1993639zbMath1288.68098OpenAlexW1980744864MaRDI QIDQ5419070
Roger Wattenhofer, Christoph Lenzen
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993639
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (9)
Tight bounds for parallel randomized load balancing ⋮ Parallel load balancing on constrained client-server topologies ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ A generalization of multiple choice balls-into-bins: tight bounds ⋮ Algebraic methods in the congested clique ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Self-stabilizing local \(k\)-placement of replicas with local minimum variance
This page was built for publication: Tight bounds for parallel randomized load balancing
