Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input

DOI10.1137/S0097539703437831zbMATH Open1075.68005WikidataQ116754422 ScholiaQ116754422MaRDI QIDQ5317166FDOQ5317166

Authors: Aris Anagnostopoulos, Adam Kirsch, Eli Upfal 

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Recommendations

• Stability of Load Balancing Algorithms in Dynamic Adversarial Systems
• Automata, Languages and Programming
• On the stability of dynamic diffusion load balancing
• Randomized load balancing on networks with stochastic inputs
• The Natural Work-Stealing Algorithm is Stable

zbMATH Keywords

efficiencystabilitysteady state analysisdynamic load balancingstochastic adversary

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Renewal theory (60K05) Network protocols (68M12)

Cited In (2)

• Self-stabilizing repeated balls-into-bins
• Stability of Load Balancing Algorithms in Dynamic Adversarial Systems

This page was built for publication: Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317166)