LinBox founding scope allocation, parallel building blocks, and separate compilation
From MaRDI portal
Abstract: To maximize efficiency in time and space, allocations and deallocations, in the exact linear algebra library linbox, must always occur in the founding scope. This provides a simple lightweight allocation model. We present this model and its usage for the rebinding of matrices between different coefficient domains. We also present automatic tools to speed-up the compilation of template libraries and a software abstraction layer for the introduction of transparent parallelism at the algorithmic level.
Recommendations
- scientific article; zbMATH DE number 1860706
- Generic matrix multiplication and memory management in LinBox
- Elements of design for containers and solutions in the LinBox library (extended abstract)
- A BLAS based C library for exact linear algebra on integer matrices
- scientific article; zbMATH DE number 872490
Cited in
(6)- Collaborative computer algebra
- A BLAS based C library for exact linear algebra on integer matrices
- scientific article; zbMATH DE number 1860706 (Why is no real title available?)
- Finding Hamming weights without looking at truth tables
- Generic matrix multiplication and memory management in LinBox
- Elements of design for containers and solutions in the LinBox library (extended abstract)
This page was built for publication: LinBox founding scope allocation, parallel building blocks, and separate compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747864)