Efficient schemes for nearest neighbor load balancing
From MaRDI portal
Publication:5896750
DOI10.1016/S0167-8191(99)00018-6zbMath0942.90023MaRDI QIDQ5896750
Burkhard Monien, Andreas Frommer, Ralf Diekmann
Publication date: 1999
Published in: Parallel Computing (Search for Journal in Brave)
complexity; diffusion load balancing algorithms; local greedy heuristics; nearest neighbor balancing algorithms; OPS; optimal polynomial scheme
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Remarks on dynamic load balancing of integer loads and integral graphs, Graphs for small multiprocessor interconnection networks, Graph spectra in computer science, Multicommodity flows in tree-like networks, Randomized diffusion for indivisible loads, On mixing and edge expansion properties in randomized broadcasting, Convergence of max-min consensus algorithms, Convergence of the diffusion method for weighted torus graphs using Fourier analysis, On finite dimension exchange algorithms., Fast algorithms for fair dynamic load redistribution in heterogeneous environments, Accelerated diffusion algorithms for dynamic load balancing., Sparse topologies with small spectrum size, Beyond good partition shapes: an analysis of diffusive graph partitioning, Parameter-invariant models for load balancing on heterogeneous networks, On the stability of dynamic diffusion load balancing, Average consensus on networks with quantized communication, Ultra-Fast Load Balancing on Scale-Free Networks
