Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
On the Quality of Partitions Based on Space-Filling Curves
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
Improvements to the helpful-set algorithm and a new evaluation scheme for graph-partitioners
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Hi-index | 0.00 |
Using space-filling curves to partition unstructured finite element meshes is a widely applied strategy when it comes to distributing load among several computation nodes. Compared to more elaborated graph partitioning packages, this geometric approach is relatively easy to implement and very fast. However, results are not expected to be as good as those of the latter. In this paper we present results of our experiments comparing the quality of partitionings computed with different types of space-filling curves to those generated with the graph partitioning package Metis.