combblas 2.0.0-3.1build2 source package in Ubuntu
Changelog
combblas (2.0.0-3.1build2) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- Steve Langasek <email address hidden> Sun, 31 Mar 2024 00:31:24 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| combblas_2.0.0.orig.tar.gz | 41.7 MiB | 3f955db1c0ec351713d88affd37f3fbb70b3bb3970527c04ed9e507057156afe |
| combblas_2.0.0-3.1build2.debian.tar.xz | 32.2 MiB | 3e132a0ec30dfffa5478434d58a6de862de90f97378d35188874bf2eae9f0ce5 |
| combblas_2.0.0-3.1build2.dsc | 2.4 KiB | dae342ed489a673f28d177ce2824e79dbd26d23a8a2786683a7c19732d5940f1 |
Available diffs
- diff from 2.0.0-3.1build1 to 2.0.0-3.1build2 (312 bytes)
Binary packages built by this source
- libcombblas-dev: an extensible parallel graph library for graph analytics
The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory
parallel graph library offering a small but powerful set of linear
algebra primitives specifically targeting graph analytics.
.
- The Combinatorial BLAS development influences the Graph BLAS
standardization process.
- It achieves scalability via its two dimensional distribution and
coarse-grained parallelism.
- CombBLAS powers HipMCL, a highly-scalable parallel implementation of
the Markov Cluster Algorithm (MCL).
- Operations among sparse matrices and vectors use arbitrary user
defined semirings.
.
This package provides development files for building client
applications against combblas.
- libcombblas-docs: an extensible parallel graph library for graph analytics (docs)
The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory
parallel graph library offering a small but powerful set of linear
algebra primitives specifically targeting graph analytics.
.
- The Combinatorial BLAS development influences the Graph BLAS
standardization process.
- It achieves scalability via its two dimensional distribution and
coarse-grained parallelism.
- CombBLAS powers HipMCL, a highly-scalable parallel implementation of
the Markov Cluster Algorithm (MCL).
- Operations among sparse matrices and vectors use arbitrary user
defined semirings.
.
This package provides full HTML documentation for the CombBLAS API.
- libcombblas2.0.0t64: an extensible parallel graph library for graph analytics
The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory
parallel graph library offering a small but powerful set of linear
algebra primitives specifically targeting graph analytics.
.
- The Combinatorial BLAS development influences the Graph BLAS
standardization process.
- It achieves scalability via its two dimensional distribution and
coarse-grained parallelism.
- CombBLAS powers HipMCL, a highly-scalable parallel implementation of
the Markov Cluster Algorithm (MCL).
- Operations among sparse matrices and vectors use arbitrary user
defined semirings.
.
This package provides the combblas shared library.
- libcombblas2.0.0t64-dbgsym: debug symbols for libcombblas2.0.0t64
