Rapid convergence of a local load balancing algorithm for asynchronous rings
From MaRDI portal
Publication:1292435
Recommendations
- scientific article; zbMATH DE number 1263231
- Tight Analyses of Two Local Load Balancing Algorithms
- The convergence of realistic distributed load-balancing algorithms
- Discrete load balancing is (almost) as easy as continuous load balancing
- Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs
Cites Work
- 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 1142328 (Why is no real title available?)
- Approximate load balancing on dynamic and asynchronous networks
- Complexity of network synchronization
- Computing on an anonymous ring
- Efficiency of Synchronous Versus Asynchronous Distributed Systems
- Efficiency of semisynchronous versus asynchronous networks
- Efficient asynchronous distributed symmetry breaking
- Electing a leader in a synchronous ring
- On describing the behavior and implementation of distributed systems
- Optimal static load balancing in distributed computer systems
- Strongly adaptive token distribution
- The Token Distribution Problem
- The convergence span of greedy load balancing
- The generalized packet routing problem
This page was built for publication: Rapid convergence of a local load balancing algorithm for asynchronous rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292435)