An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers

Authors:
Chengzhong Xu;Burkhard Monien;Reinhard Lüling;Francis C. M. Lau
Affiliations:
-;-;-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 9

First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Dynamic load balancing for switch-based networks

Journal of Parallel and Distributed Computing
A new load-balancing strategy for the solution of dynamical large-tree-search problems using a hierarchical approach

IBM Journal of Research and Development
Practical Performance Model for Optimizing Dynamic Load Balancing of Adaptive Applications

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters

Journal of Network and Computer Applications
Biased random walks on resource network graphs for load balancing

The Journal of Supercomputing
A practical approach of diffusion load balancing algorithms

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Deterministic random walks on the two-dimensional grid

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on its local information and manages work load migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms, the dimension exchange and the diffusion methods and their variants in terms of their performances in both one-port and all-port communication architectures. It turns out that the dimension exchange method outperforms the diffusion method in the one-port communication model, and that the strength of the diffusion method is in asynchronous implementations in the all-port communication model. The underlying communication networks considered assume the most popular topologies, the mesh and the torus and their special cases: the hypercube and the k-ary n-cube.