ParMETIS is an MPI-based parallel library that implements a variety of algorithms for partitioning unstructured graphs, meshes, and for computing fill-reducing orderings of sparse matrices. ParMETIS extends the functionality provided by METIS and includes routines that are especially suited for parallel AMR computations and large scale numerical simulations. The algorithms implemented in ParMETIS are based on the parallel multilevel k-way graph-partitioning, adaptive repartitioning, and parallel multi-constrained partitioning schemes developed in our lab.
Versions and Availability
Module Names for ParMetis on qb2
▶ **FIX-ME** FAQ?
The user's program is written to make use of the ParMETIS library API, please refer to the Resources section for detailed usage.
Last modified: June 25 2015 12:56:42.