This report describes the multilevel partitioning methods which have been implemented in the software package Ralpar. Such methods address the problem of nding an e cient partitioning of a mesh for parallel processing in a reasonable time. A graph representation of the connectivity of a mesh is condensed through a number of levels to give a smaller problem that can be partitioned quickly. Kernighan and Lin re nement is used to improve the partition on intermediate levels. A library interface to these partitioning routines is described, the Ralpar multilevel library (RPMLL). Some examples are given to illustrate the performance of this implmentation of multilevel methods. A copy of this report can be found at the Department's web site (http://www.dci.clrc.ac.uk/) under page Group.asp?DCICSEMSW or anonymous ftp server www.inf.rl.ac.uk under the directory pub/mathsoft/publications Mathematical Software Group Department for Computation and Information Rutherford Appleton Laboratory Chilton, DIDCOT Oxfordshire OX11 0QX
[1]
Bruce Hendrickson,et al.
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
,
1995,
SIAM J. Sci. Comput..
[2]
J. G. Malone.
Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers
,
1988
.
[3]
Horst D. Simon,et al.
Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
,
1994,
Concurr. Pract. Exp..
[4]
R F Fowler,et al.
RALPAR: RAL mesh partitioning program: version 1.1
,
1994
.
[5]
Alex Pothen,et al.
PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
,
1990
.
[6]
Vipin Kumar,et al.
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
,
1998,
SIAM J. Sci. Comput..
[7]
Bruce Hendrickson,et al.
A Multi-Level Algorithm For Partitioning Graphs
,
1995,
Proceedings of the IEEE/ACM SC95 Conference.