Files
nixpkgs/pkgs/by-name/pa/parmetis/package.nix
Dark Steveneq 646b892680
Some checks failed
Periodic Merges (6h) / master → staging-nixos (push) Failing after 12m50s
Periodic Merges (6h) / master → staging-next (push) Failing after 12m54s
Periodic Merges (24h) / merge-base(master,staging) → haskell-updates (push) Failing after 11m54s
Periodic Merges (6h) / staging-next → staging (push) Failing after 12m13s
Periodic Merges (24h) / staging-next-25.05 → staging-25.05 (push) Failing after 13m24s
Periodic Merges (24h) / release-25.05 → staging-next-25.05 (push) Failing after 14m28s
push sheeet
2025-10-09 14:15:47 +02:00

55 lines
1.3 KiB
Nix

{
lib,
stdenv,
fetchFromGitHub,
cmake,
gklib,
metis,
mpi,
}:
stdenv.mkDerivation {
pname = "parmetis";
version = "4.0.3-unstable-2023-03-26";
src = fetchFromGitHub {
owner = "KarypisLab";
repo = "ParMETIS";
rev = "8ee6a372ca703836f593e3c450ca903f04be14df";
hash = "sha256-L9SLyr7XuBUniMH3JtaBrUHIGzVTF5pr014xovQf2cI=";
};
nativeBuildInputs = [ cmake ];
enableParallelBuilding = true;
buildInputs = [
gklib
metis
mpi
];
configurePhase = ''
runHook preConfigure
make config metis_path=${metis} gklib_path=${gklib} prefix=$out \
shared=${if stdenv.hostPlatform.isStatic then "0" else "1"}
runHook postConfigure
'';
meta = with lib; {
description = "Parallel Graph Partitioning and Fill-reducing Matrix Ordering";
longDescription = ''
MPI-based parallel library that implements a variety of algorithms for
partitioning unstructured graphs, meshes, and for computing fill-reducing
orderings of sparse matrices.
The algorithms implemented in ParMETIS are based on the multilevel
recursive-bisection, multilevel k-way, and multi-constraint partitioning
schemes
'';
homepage = "https://github.com/KarypisLab/ParMETIS";
platforms = platforms.all;
license = licenses.unfree;
maintainers = [ maintainers.costrouc ];
};
}