Efficient schemes for nearest neighbor load balancing

DOI10.1016/S0167-8191(99)00018-6zbMath0930.68163OpenAlexW1985451401MaRDI QIDQ5917954

Andreas Frommer, Burkhard Monien, Ralf Diekmann

Publication date: 12 January 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(99)00018-6

zbMATH Keywords

complexitydiffusion load balancing algorithmslocal greedy heuristicsnearest neighbor balancing algorithmsoptimal polynomial scheme (OPS)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Distributed Jacobi joint diagonalization on clusters of personal computers ⋮ Engineering a combinatorial Laplacian solver: lessons learned ⋮ Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations

This page was built for publication: Efficient schemes for nearest neighbor load balancing