parmetis 4.0.3-7build1 source package in Ubuntu
Changelog
parmetis (4.0.3-7build1) noble; urgency=medium * No-change rebuild against libopenmpi3t64 -- Steve Langasek <email address hidden> Wed, 13 Mar 2024 18:34:30 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
parmetis_4.0.3.orig.tar.gz | 5.3 MiB | f2d9a231b7cf97f1fee6e8c9663113ebf6c240d407d3c118c55b3633d6be6e5f |
parmetis_4.0.3-7build1.debian.tar.xz | 14.0 KiB | 70d8427cbb8a813cd93e332018fbdf0054224dfbb418bcd2db860340ca3a8c2a |
parmetis_4.0.3-7build1.dsc | 2.4 KiB | 4143738caa6ae5467f84042fbff91a3f872549d293c4aff31c08e668e646c39c |
Available diffs
- diff from 4.0.3-7 (in Debian) to 4.0.3-7build1 (526 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.
- libparmetis4.0-dbgsym: debug symbols for libparmetis4.0
- 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.
- parmetis-test-dbgsym: debug symbols for parmetis-test