Efficient schemes for nearest neighbor load balancing

DOI10.1016/S0167-8191(99)00018-6zbMath0942.90023OpenAlexW1985451401MaRDI QIDQ5896750

Burkhard Monien, Andreas Frommer, Ralf Diekmann

Publication date: 1999

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 algorithmsOPSoptimal polynomial scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Sparse topologies with small spectrum size ⋮ Ultra-Fast Load Balancing on Scale-Free Networks ⋮ On mixing and edge expansion properties in randomized broadcasting ⋮ Average consensus on networks with quantized communication ⋮ Graphs for small multiprocessor interconnection networks ⋮ Beyond good partition shapes: an analysis of diffusive graph partitioning ⋮ Graph spectra in computer science ⋮ Convergence of max-min consensus algorithms ⋮ On finite dimension exchange algorithms. ⋮ Convergence of the diffusion method for weighted torus graphs using Fourier analysis ⋮ Remarks on dynamic load balancing of integer loads and integral graphs ⋮ On the stability of dynamic diffusion load balancing ⋮ Parameter-invariant models for load balancing on heterogeneous networks ⋮ Multicommodity flows in tree-like networks ⋮ Randomized diffusion for indivisible loads ⋮ Fast algorithms for fair dynamic load redistribution in heterogeneous environments ⋮ Accelerated diffusion algorithms for dynamic load balancing.