Balanced allocations

DOI10.1145/335305.335411zbMath1296.68024OpenAlexW2008982530MaRDI QIDQ3192049

Berthold Vöcking, Angelika Steger, Petra Berenbrink, Artur Czumaj

Publication date: 26 September 2014

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

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

The power of two choices for random walks ⋮ Balanced allocation and dictionaries with tightly packed constant size bins ⋮ Unnamed Item ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Multi-party updatable delegated private set intersection ⋮ Balls into non-uniform bins ⋮ Orientability Thresholds for Random Hypergraphs ⋮ Randomization helps to perform independent tasks reliably ⋮ On the power of two choices: balls and bins in continuous time ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Balanced routing of random calls ⋮ Dynamic averaging load balancing on cycles

This page was built for publication: Balanced allocations