parmetis 4.0.3-7build2 source package in Ubuntu

Changelog

parmetis (4.0.3-7build2) noble; urgency=medium

  * No-change rebuild for CVE-2024-3094

 -- William Grant <email address hidden>  Mon, 01 Apr 2024 16:16:46 +1100

Upload details

Uploaded by:
William Grant
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release multiverse math
Noble release multiverse math

Downloads

File Size SHA-256 Checksum
parmetis_4.0.3.orig.tar.gz 5.3 MiB f2d9a231b7cf97f1fee6e8c9663113ebf6c240d407d3c118c55b3633d6be6e5f
parmetis_4.0.3-7build2.debian.tar.xz 14.1 KiB 0b0c9e9efea5208f2816edc24ca4a73ee59e0f71d398d6e304da4e90c5bcc58f
parmetis_4.0.3-7build2.dsc 2.4 KiB 695c63adf202a1255daaf17718093f51d23faac21fbbcf8376f7367e3be2e104

Available diffs

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.

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