parmetis 3.1.1-4build1 source package in Ubuntu
Changelog
parmetis (3.1.1-4build1) trusty; urgency=medium * No-change rebuild for libopenmpi1.3 -> libopenmpi1.6 transition. -- Logan Rosen <email address hidden> Mon, 16 Dec 2013 00:21:14 -0500
Upload details
- Uploaded by:
- Logan Rosen
- Uploaded to:
- Trusty
- Original maintainer:
- Debian Science Team
- Architectures:
- any all
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Trusty | release | multiverse | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| parmetis_3.1.1.orig.tar.gz | 5.0 MiB | 44ed920e4ff5cec8755eb06fd05ecbb2bc3eccd7ab943b9d38d0fd2a21f30d5c |
| parmetis_3.1.1-4build1.debian.tar.gz | 59.0 KiB | 68e4dbf56b21ebda7884785d84eaf7b9739ae36a813fa655304ae26a48526ee5 |
| parmetis_3.1.1-4build1.dsc | 1.9 KiB | 8d1b79ac61d403f0b24bbe2827ba665e1c6d43390ed7c5d991969cb9fe6e4414 |
Available diffs
- diff from 3.1.1-4 (in Debian) to 3.1.1-4build1 (336 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.
- libparmetis3.1: No summary available for libparmetis3.1 in ubuntu utopic.
No description available for libparmetis3.1 in ubuntu utopic.
- 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.
