parmetis 4.0.3-7 source package in Ubuntu

Changelog

parmetis (4.0.3-7) unstable; urgency=medium

  * Team upload.
  * d/tests/build1: allow oversubscription with OpenMPI.

 -- Ansgar <email address hidden>  Sun, 17 Jul 2022 22:21:07 +0200

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release multiverse math
Lunar release multiverse math

Downloads

File Size SHA-256 Checksum
parmetis_4.0.3-7.dsc 1.7 KiB 42e452f480283282efb97c07667b9c6b99a33b81c58e525ece6ca8dcd0e9797a
parmetis_4.0.3.orig.tar.gz 5.3 MiB f2d9a231b7cf97f1fee6e8c9663113ebf6c240d407d3c118c55b3633d6be6e5f
parmetis_4.0.3-7.debian.tar.xz 13.9 KiB 0f2130dd5c6a7b2df5214b795eb51df2cc71c43e1194a117150297cec85b93b6

Available diffs

No changes file available.

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: No summary available for libparmetis4.0 in ubuntu kinetic.

No description available for libparmetis4.0 in ubuntu kinetic.

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