scientific article; zbMATH DE number 6783405

MaRDI QIDQ5365053zbMATH OpenFDO

Authors Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133070

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Randomized diffusion for indivisible loads
• Dynamic load balancing by diffusion in heterogeneous systems
• Universality of load balancing schemes on the diffusion scale
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Randomized load balancing on networks with stochastic inputs
• On the stability of dynamic diffusion load balancing
• Diffusion schemes for load balancing on heterogeneous networks
• Automata, Languages and Programming

Cited in

(9)

• Improved analysis of deterministic load-balancing schemes
• Quasirandom load balancing
• Improved analysis of deterministic load-balancing schemes
• Randomized load balancing on networks with stochastic inputs
• Near-perfect load balancing by randomized rounding
• Quasirandom load balancing
• A simple approach for adapting continuous load balancing processes to discrete settings
• Local deal-agreement algorithms for load balancing in dynamic general graphs
• Randomized diffusion for indivisible loads

This page was built for publication:

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