blob: 96feb1b105368a164c188c7b945ef254dab480be (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
SPELL=parmetis
VERSION=3.1.1
SOURCE=ParMetis-$VERSION.tar.gz
SOURCE_HASH=sha512:b5a28e2ba777df127c2e53eb397fb4b131137e7d2d512cf169d0d7d6d69626ecdbdd7f8dbd036cda9102b97cc8230cb0cb8341ed8d3608d8955727450efa1a97
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
|