Toward Optimal Diffusion Matrices

Authors:
Robert Elsässer;Burkhard Monien;Günter Rote;Stefan Schamberger
Affiliations:
-;-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 10
Cited 2

Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Group action graphs and parallel architectures

SIAM Journal on Computing
Load balancing and Poisson equation in a graph

Concurrency: Practice and Experience
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
The spectrum of de Bruijn and Kautz graphs

European Journal of Combinatorics
Efficient schemes for nearest neighbor load balancing

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Load Balancing in Parallel Computers: Theory and Practice

Load Balancing in Parallel Computers: Theory and Practice
Engineering Diffusive Load Balancing Algorithms Using Experiments

IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
Quality Balancing for Parallel Adaptive FEM

IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Optimal and Alternating-Direction Load Balancing Schemes

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Load balancing for the numerical solution of the navier-stokes equations

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Fast diffusion load balancing algorithms on torus graphs

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. However, observations show that the convergence rate of diffusion algorithms can be improved using edge weighted graphs without deteriorating the flows quality. In this paper we consider common interconnection topologies and demonstrate, how optimal edge weights can be calculated for the First and Second Order Diffusion Schemes. Using theoretical analysis and practical experiments we show, what improvements can be archived on selected networks.