Discrete load balancing is (almost) as easy as continuous load balancing

DOI10.1145/1835698.1835780zbMath1315.68034OpenAlexW2061772035MaRDI QIDQ5176211

Thomas Sauerwald, Robert Elsässer

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmrandom walkload balancing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (5)

Ultra-Fast Load Balancing on Scale-Free Networks ⋮ Local deal-agreement algorithms for load balancing in dynamic general graphs ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Distributed algorithms for QoS load balancing ⋮ Randomized diffusion for indivisible loads

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Discrete load balancing is (almost) as easy as continuous load balancing