Nearest neighbor load balancing on graphs

DOI10.1007/3-540-68530-8_36MaRDI QIDQ4252039zbMATH OpenFDO

Authors Andreas Frommer, Burkhard Monien, Ralf Diekmann

Publication date 17 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-68530-8_36

zbMATH Keywords

diffusion load balancingnearest neighbor balancingoptimal polynomial scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Efficient schemes for nearest neighbor load balancing
• Efficient schemes for nearest neighbor load balancing
• Optimal and alternating-direction load balancing schemes
• Analysis of nearest neighbor load balancing algorithms for random loads

Cited in

(11)

• Load balancing by graph coloring, an algorithm
• On finite dimension exchange algorithms.
• Fast algorithms for fair dynamic load redistribution in heterogeneous environments
• Analysis of nearest neighbor load balancing algorithms for random loads
• Load balancing algorithms based on gradient methods and their analysis through algebraic graph theory
• Optimal and alternating-direction load balancing schemes
• An O(n n) algorithm for a load balancing problem on paths
• scientific article; zbMATH DE number 975375 (Why is no real title available?)
• Efficient schemes for nearest neighbor load balancing
• Efficient schemes for nearest neighbor load balancing
• Fast load balancing in Cayley graphs and in circuits

This page was built for publication: Nearest neighbor load balancing on graphs

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