An improved spectral bisection algorithm and its application to dynamic load balancing

Parallel Computing

Volumn 21, Issue 1, 1995, Pages 29-48

  Van Driessche, R ^a   Roose, D ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

(Recursive) spectral bisection; Distributed memory computers; Dynamic load balancing; Graph partitioning

Indexed keywords

CALCULATIONS; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC LOADS; FINITE ELEMENT METHOD; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; PARTIAL DIFFERENTIAL EQUATIONS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS;

GRAPH PARTITIONING; GRID ORIENTED SCIENTIFIC CALCULATIONS; INTERDEPENDENCY GRAPHS; INTERPROCESSOR COMMUNICATION; LOAD IMBALANCE; RECURSIVE SPECTRAL BISECTION HEURISTIC;

PARALLEL ALGORITHMS;

EID: 0029197190     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(94)00059-J     Document Type: Article

References (16)

1. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
2. The design and implementation of a parallel unstructured Euler solver using software primitives
3. A simple and efficient automatic FEM domain decomposer
4. Algebraic connectivity of graphs
5. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
6. A representation of hypergraphs in the Euclidean space
7. An improved spectral load balancing method
8. A multilevel algorithm for partitioning graphs
9. Mesh decomposition and communication procedures for finite element applications on the Connection Machine CM-5 system
10. Partitioning sparse matrices with eigenvectors of graphs
11. Design and data structure of fully adaptive multigrid, finite-element software
12. Partitioning of unstructured problems for parallel processing
13. A MIMD implementation of a parallel Euler solver for unstructured grids
14. Performance of dynamic load balancing algorithms for unstructured mesh calculations