List all Resources

ParMetis

University of Minnesota

Parallel Graph Partitioning

http://www-users.cs.umn.edu/~karypis/metis/parmetis/

Summary Assembled by Curation Team

Software: Algorithm or Reusable Library
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 algorithms described in [KK95d], [KK96], [KK97], the adaptive repartitioning algorithm described in [SKK00a], and the parallel multi-constrained algorithms described in [SKK99b].
Development Stage	4 - Development with public userbase
Keywords
Resources with Similar Function
Related Resources	Search Google

Last Updated on: May 01, 2006 Page hits 599, Clicks 264, Version (0)

Suggest Update
Send the Curation Team a suggestion.

No ratings yet		Login to rate resource Login to rate resource
Your review has been saved
Review ParMetis Enter a title for your review (optional): Type your review in the space below: Cancel