Near-perfect load balancing by randomized rounding

DOI10.1145/1536414.1536433zbMath1304.68019OpenAlexW2023434464MaRDI QIDQ5172705

Thomas Sauerwald, Tobias Friedrich

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1536414.1536433

zbMATH Keywords

load balancingrandomized rounding

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20)

Related Items (6)

Local deal-agreement algorithms for load balancing in dynamic general graphs ⋮ Distributed Averaging in Opinion Dynamics ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Smoothed analysis of balancing networks ⋮ Randomized diffusion for indivisible loads ⋮ Discrete load balancing on complete bipartite graphs

This page was built for publication: Near-perfect load balancing by randomized rounding