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?)
- Electing a leader in a synchronous ring
- Computing on an anonymous ring
- Complexity of network synchronization
- Approximate load balancing on dynamic and asynchronous networks
- Efficiency of Synchronous Versus Asynchronous Distributed Systems
- Efficiency of semisynchronous versus asynchronous networks
- Title not available (Why is that?)
- The Token Distribution Problem
- The generalized packet routing problem
- Optimal static load balancing in distributed computer systems
- Strongly adaptive token distribution
- On describing the behavior and implementation of distributed systems
- The convergence span of greedy load balancing
- Efficient asynchronous distributed symmetry breaking
- Title not available (Why is that?)
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)
