A simple approach for adapting continuous load balancing processes to discrete settings

DOI10.1007/S00446-016-0266-YMaRDI QIDQ5890706zbMATH OpenOpenAlexFDO

Authors Hoda Akbari, Petra Berenbrink, Thomas Sauerwald

Publication date 23 May 2016

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://www.repository.cam.ac.uk/handle/1810/292829

zbMATH Keywords

discrete diffusionload balancingrandomized rounding

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• A simple approach for adapting continuous load balancing processes to discrete settings
• Discrete load balancing is (almost) as easy as continuous load balancing
• Improved analysis of deterministic load-balancing schemes
• Improved analysis of deterministic load-balancing schemes
• Near-perfect load balancing by randomized rounding

Cites work

• A simple approach for adapting continuous load balancing processes to discrete settings
• Approximate load balancing on dynamic and asynchronous networks
• Balanced allocations: a simple proof for the heavily loaded case
• Balanced Allocations: The Heavily Loaded Case
• Balls and bins: A study in negative dependence
• Concurrent imitation dynamics in congestion games
• Convergence time to Nash equilibrium in load balancing
• Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
• Counting networks
• Deterministic random walks on finite graphs
• Deterministic random walks on regular trees
• Deterministic random walks on the integers
• Deterministic random walks on the two-dimensional grid
• Diffusion schemes for load balancing on heterogeneous networks
• Discrete load balancing is (almost) as easy as continuous load balancing
• Distributed selfish load balancing on networks
• Distributed selfish load balancing with weights and speeds
• Distributing Unit Size Workload Packages in Heterogeneous Networks
• Dynamic load balancing by random matchings
• Fast convergence of selfish rerouting
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• scientific article; zbMATH DE number 1263231 (Why is no real title available?)
• scientific article; zbMATH DE number 6783405 (Why is no real title available?)
• Near-perfect load balancing by randomized rounding
• Probability Inequalities for Sums of Bounded Random Variables
• Quasirandom load balancing
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Strongly adaptive token distribution

Cited in

(1)

• A simple approach for adapting continuous load balancing processes to discrete settings

This page was built for publication: A simple approach for adapting continuous load balancing processes to discrete settings

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