Balanced allocation on graphs

DOI10.1145/1109557.1109606zbMath1192.68462arXivcs/0510086OpenAlexW2949649421MaRDI QIDQ3581542

Krishnaram Kenthapadi, Rina Panigrahy

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0510086

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Tight bounds for parallel randomized load balancing ⋮ Graphical balanced allocations and the (1 + β)-choice process ⋮ Parallel load balancing on constrained client-server topologies ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ On the Power of Choice for Boolean Functions ⋮ Balls into non-uniform bins ⋮ Long-term balanced allocation via thinning ⋮ Balanced allocation on hypergraphs ⋮ The Power of Filling in Balanced Allocations ⋮ A Power-of-Two-Choices Unbalanced Allocation Process ⋮ Chains-into-bins processes ⋮ A novel robust on-line protocol for load-balancing in structured peer-to-peer systems ⋮ Stationary Distribution Analysis of a Queueing Model with Local Choice ⋮ Chains-into-Bins Processes ⋮ Balanced allocation on dynamic hypergraphs ⋮ Balanced Allocation on Graphs: A Random Walk Approach

This page was built for publication: Balanced allocation on graphs