Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load states information

DOI10.1007/S00224-001-1022-6MaRDI QIDQ5956790zbMATH OpenOpenAlexFDO

Authors K. Li

Publication date 28 February 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-1022-6

zbMATH Keywords

balanced load distribution

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Randomized algorithms for online vector load balancing
• \(O(n)\) algorithms for load balancing in distributed computing systems
• Optimal load balancing on distributed homogeneous unreliable processors
• On the analysis of randomized load balancing schemes
• Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
• Tight bounds for parallel randomized load balancing
• scientific article; zbMATH DE number 1629979
• On-line load balancing of temporary tasks revisited
• Tight bounds for parallel randomized load balancing, extended abstract
• Parallel randomized load balancing: a lower bound for a more general model

Cited in

(1)

• Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks

This page was built for publication: Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load states information

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