NPAC Technical Report SCCS-729
Fast and Parallel Mapping Algorithms for Irregular Problems
Chao-Wei Ou, Sanjay Ranka, Geoffrey Fox
Submitted July 1 1993
Abstract
This paper describes the performance of locality-based
mapping and remapping partitioners for unstructured
grid. We show that the algorithm
produces good mappings at a relatively low cost
and can be easily parallelized. Further,
the algorithm can provide remapping for
incremental problems at a fraction of the total cost.