Asynchronous random polling dynamic load balancing

DOI10.1007/3-540-46632-0_5MaRDI QIDQ2729101zbMATH OpenFDO

Authors Peter Sanders

Publication date 23 October 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46632-0_5

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computing methodologies and applications (68U99)

Recommendations

• Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
• scientific article; zbMATH DE number 742953
• Dynamic load balancing by random matchings
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing

Cited in

(4)

• Dynamic priority rules when polling with multiple parallel servers
• Decentralized list scheduling
• Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
• Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing

This page was built for publication: Asynchronous random polling dynamic load balancing

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