Quasirandom Load Balancing

DOI10.1137/100799216zbMath1255.68286arXiv1006.3302OpenAlexW2763355822MaRDI QIDQ3143292

Martin Gairing, Tobias Friedrich, Thomas Sauerwald

Publication date: 29 November 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

random walkload balancingdistributed computingrandomized algorithmsquasirandomness

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (12)

Total variation discrepancy of deterministic random walks for ergodic Markov chains ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Unnamed Item ⋮ The Power of Filling in Balanced Allocations ⋮ Randomized Rumour Spreading: The Effect of the Network Topology ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Reachability Switching Games ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ Randomized diffusion for indivisible loads ⋮ Fast Simulation of Large-Scale Growth Models ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Does adding more agents make a difference? A case study of cover time for the rotor-router

This page was built for publication: Quasirandom Load Balancing