| Parallel Computing
| Tools & Utilities
ParMETIS is an MPI-based parallel library that implements a variety of
algorithms for partitioning unstructured graphs and for computing
fill-reducing orderings for sparse matrices. ParMETIS is particularly suited
for parallel numerical simulations involving large unstructured meshes.
For these computations, ParMETIS dramatically reduces the time spent in
communication by decomposing the mesh in a way that balances the load and
minimizes the number of interface elements.
ParMETIS provides the following four major functions:
- Partition an unstructured graph.
- Improve the quality of an existing partition.
- Repartition a graph that corresponds to an adaptively refined mesh.
- Compute a fill-reducing ordering for sparse direct factorization.
Current Version: 1.0
License Type: Free
Source Code Availability: Yes (must contact as described in home page)
Available Binary Packages:
- Debian Package: No
- RedHat RPM Package: No
- Other Packages: No
ParMETIS is written entirely in ANSI C and
MPI, and is portable on most parallel computers that support MPI.
Tested on SGI Challenge, Cray T3D, IBM SP 2 with MPICH.
MPI, ANSI C Compiler
Mailing Lists/USENET News Groups:
See A Screen Shot? (Not Yet)
Copyright © 1995-2001 by
Copyright © 1997-2001 by
Kachina Technologies, Inc.
All rights reserved.