Dynamic averaging load balancing on cycles
From MaRDI portal
Publication:2118388
DOI10.1007/s00453-021-00905-9OpenAlexW4205540997MaRDI QIDQ2118388
Amirmojtaba Sabour, Giorgi Nadiradze, Dan Alistarh
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00905-9
Cites Work
- Dynamic load balancing by random matchings
- Approximate counting, uniform generation and rapidly mixing Markov chains
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- Randomized allocation processes
- Balanced allocations
- Graphical balanced allocations and the (1 + β)-choice process
- Balanced Allocations
- Balanced Allocations: A Simple Proof for the Heavily Loaded Case
- The Power of Choice in Priority Scheduling
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- An Analysis of Random-Walk Cuckoo Hashing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item