LinBox founding scope allocation, parallel building blocks, and separate compilation
Jean-Guillaume Dumas (LJK), Thierry Gautier (INRIA Rh\^one-Alpes / LIG, Laboratoire d'Informatique de Grenoble), Cl\'ement Pernet (INRIA, Rh\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), B. David, Saunders (CIS)
TL;DR
This paper introduces a lightweight allocation model for the LinBox library, enabling efficient scope management, matrix rebinding, faster compilation, and transparent parallelism at the algorithmic level.
Contribution
It presents a novel scope-based allocation model, tools for template compilation speed-up, and a software abstraction layer for parallelism in LinBox.
Findings
Efficient scope-based memory management in LinBox.
Tools for accelerating template library compilation.
A software abstraction layer for transparent parallelism.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Logic, programming, and type systems · Formal Methods in Verification