Rapid convergence of a local load balancing algorithm for asynchronous rings

DOI10.1016/S0304-3975(98)00243-6zbMath0916.68007OpenAlexW2075253733MaRDI QIDQ1292435

Rajmohan Rajaraman, Johannes E. Gehrke, C. Greg Plaxton

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

zbMATH Keywords

load balancingdistributed algorithmsring topologyasynchronous networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized packet routing problem
• On describing the behavior and implementation of distributed systems
• The convergence span of greedy load balancing
• Strongly adaptive token distribution
• Efficient asynchronous distributed symmetry breaking
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• Complexity of network synchronization
• Optimal static load balancing in distributed computer systems
• Electing a leader in a synchronous ring
• Computing on an anonymous ring
• The Token Distribution Problem
• Efficiency of semisynchronous versus asynchronous networks
• Approximate load balancing on dynamic and asynchronous networks

This page was built for publication: Rapid convergence of a local load balancing algorithm for asynchronous rings