parmetis 4.0.3-4build2 source package in Ubuntu
Changelog
parmetis (4.0.3-4build2) xenial; urgency=medium * No-change rebuild for openmpi on s390x. -- Matthias Klose <email address hidden> Sat, 06 Feb 2016 19:52:27 +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 | Published | Component | Section | |
---|---|---|---|---|
Xenial | release | multiverse | math |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
parmetis_4.0.3.orig.tar.gz | 5.3 MiB | f2d9a231b7cf97f1fee6e8c9663113ebf6c240d407d3c118c55b3633d6be6e5f |
parmetis_4.0.3-4build2.debian.tar.xz | 13.6 KiB | 11c0ad0db37d1ff7a774aba480e6393019cd9fa4d3ab462c8200345fe49ce9bd |
parmetis_4.0.3-4build2.dsc | 2.3 KiB | 1a68cdbbff1e58ccbc5fd127fac64f6fa6ee0fe467025d0b7d9171daf0342bc5 |
Available diffs
- diff from 4.0.3-4 (in Debian) to 4.0.3-4build2 (341 bytes)
- diff from 4.0.3-4build1 to 4.0.3-4build2 (301 bytes)
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: No summary available for parmetis-test in ubuntu yakkety.
No description available for parmetis-test in ubuntu yakkety.