Local deal-agreement algorithms for load balancing in dynamic general graphs
From MaRDI portal
Recommendations
- Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs
- Locally optimal load balancing
- Synchronous distributed load balancing on dynamic networks
- A simple approach for adapting continuous load balancing processes to discrete settings
- Discrete load balancing is (almost) as easy as continuous load balancing
Cites work
- A simple approach for adapting continuous load balancing processes to discrete settings
- Approximate load balancing on dynamic and asynchronous networks
- Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs
- Constant-space self-stabilizing token distribution in trees
- Discrete load balancing is (almost) as easy as continuous load balancing
- Distributed Computing: A Locality-Sensitive Approach
- Distributing Unit Size Workload Packages in Heterogeneous Networks
- Dynamic load balancing with group communication
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1263231 (Why is no real title available?)
- scientific article; zbMATH DE number 1332668 (Why is no real title available?)
- scientific article; zbMATH DE number 6783405 (Why is no real title available?)
- Improved analysis of deterministic load-balancing schemes
- Locality in Distributed Graph Algorithms
- Locally optimal load balancing
- Near-perfect load balancing by randomized rounding
- Quasirandom load balancing
- Self-stabilization
Cited in
(1)
This page was built for publication: Local deal-agreement algorithms for load balancing in dynamic general graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038713)