Ubuntu
parmetis package

parmetis 4.0.3-4build1 source package in Ubuntu

Changelog

parmetis (4.0.3-4build1) xenial; urgency=medium

  * No-change rebuild for openmpi transition.

 -- Matthias Klose <email address hidden>  Mon, 01 Feb 2016 11:38:07 +0000

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Xenial
Original maintainer:
Debian Science Team
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
parmetis_4.0.3.orig.tar.gz 5.3 MiB f2d9a231b7cf97f1fee6e8c9663113ebf6c240d407d3c118c55b3633d6be6e5f
parmetis_4.0.3-4build1.debian.tar.xz 13.6 KiB 1ab7a95e01575b64326befe115299c302d57707906bbde0a52985bb4153914da
parmetis_4.0.3-4build1.dsc 2.3 KiB 9655a17ee71f797042fff9c27166c0b8a0094ad11817152a8836cee9e23306b6

View changes file

Binary packages built by this source

libparmetis-dev: Parallel Graph Partitioning and Sparse Matrix Ordering Libs: Devel

 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices. It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains files needed to develop programs using ParMetis.

libparmetis4.0: Parallel Graph Partitioning and Sparse Matrix Ordering Shared Libs

 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices. It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains the ParMetis shared libraries.

parmetis-doc: Parallel Graph Partitioning and Sparse Matrix Ordering Lib - Docs

 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices. It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains the documentation and example files.

parmetis-test: Parallel Graph Partitioning and Sparse Matrix Ordering Tests

 ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and
 orders variables for minimal fill when using direct solvers for sparse
 matrices. It does all this in parallel, and also can efficiently re-partition
 a graph or mesh whose connectivity has changed.
 .
 This package contains programs which test the ParMetis libraries using files
 in the parmetis-doc package's examples directory.