Tight Analyses of Two Local Load Balancing Algorithms

DOI10.1137/S0097539795292208MaRDI QIDQ4268870zbMATH OpenOpenAlexFDO

Authors

Publication date 28 October 1999

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

Full work available at URL https://doi.org/10.1137/s0097539795292208

zbMATH Keywords

distributed network algorithmsload balancing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1263231
• Rapid convergence of a local load balancing algorithm for asynchronous rings
• Discrete load balancing is (almost) as easy as continuous load balancing
• Locally optimal load balancing
• Improved analysis of deterministic load-balancing schemes

Cited in

(13)

• Rapid convergence of a local load balancing algorithm for asynchronous rings
• Dynamic averaging load balancing on cycles
• Quantized consensus
• Ultra-fast load balancing on scale-free networks
• scientific article; zbMATH DE number 4094771 (Why is no real title available?)
• scientific article; zbMATH DE number 1263231 (Why is no real title available?)
• Analysis of Simple Algorithms for Dynamic Load Balancing
• Random walks on dynamic graphs: mixing times, hitting times, and return probabilities
• Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
• Quantized consensus in Hamiltonian graphs
• Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs
• Efficient distributed decomposition and routing algorithms in minor-free networks and their applications
• Randomized diffusion for indivisible loads

This page was built for publication: Tight Analyses of Two Local Load Balancing Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268870)