Analyzing disturbed diffusion on networks

Authors:
Henning Meyerhenke;Thomas Sauerwald
Affiliations:
Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Paderborn, Germany;Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Paderborn, Germany
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 10
Cited 1

Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
An improved diffusion algorithm for dynamic load balancing

Parallel Computing
Efficient schemes for nearest neighbor load balancing

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Multigrid

Multigrid
Load Balancing in Parallel Computers: Theory and Practice

Load Balancing in Parallel Computers: Theory and Practice
An overview of the BlueGene/L Supercomputer

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain

An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Accelerating shape optimizing load balancing for parallel fem simulations by algebraic multigrid

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A shape optimizing load distribution heuristic for parallel adaptive FEM computations

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies

A new diffusion-based multilevel algorithm for computing graph partitions

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work provides the first detailed investigation of the disturbed diffusion scheme FOS/C introduced in [17] as a type of diffusion distance measure within a graph partitioning framework related to Lloyd's k-means algorithm [14]. After outlining connections to distance measures proposed in machine learning, we show that FOS/C can be related to random walks despite its disturbance. Its convergence properties regarding load distribution and edge flow characterization are examined on two different graph classes, namely torus graphs and distance-transitive graphs (including hypercubes), representatives of which are frequently used as interconnection networks.