Rapid convergence of a local load balancing algorithm for asynchronous rings
DOI10.1016/S0304-3975(98)00243-6zbMATH Open0916.68007OpenAlexW2075253733MaRDI QIDQ1292435FDOQ1292435
Authors: Johannes E. Gehrke, C. Greg Plaxton, Rajmohan Rajaraman 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00243-6
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
