           SPELL=parmetis
         VERSION=3.1
          SOURCE=ParMetis-$VERSION.tar.gz
     SOURCE_HASH=sha512:115723741f810c404511b4e15f71f8ebf013cb541b793f95ad93f2a57a773f48177495e1d70cc25a45b566a14909d766f3c256e953daf3e3e9acd3e2b436f303
SOURCE_DIRECTORY=$BUILD_DIRECTORY/ParMetis-$VERSION
   SOURCE_URL[0]=http://glaros.dtc.umn.edu/gkhome/fetch/sw/parmetis/$SOURCE
      LICENSE[0]=UNKNOWN
        WEB_SITE=http://www-users.cs.umn.edu/~karypis/metis/parmetis
        KEYWORDS="graph cluster"
         ENTERED=20020604
           SHORT="parallel graph partitioning programs"
cat << EOF
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
parallel multilevel k-way graph-partitioning algorithms 
EOF
