LinBox founding scope allocation, parallel building blocks, and separate compilation

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.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00506599
Contributor : Jean-Guillaume Dumas <>
Submitted on : Wednesday, July 28, 2010 - 1:46:19 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Friday, October 29, 2010 - 10:36:45 AM

Files

lb-memparcmp-TechReport.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders. LinBox founding scope allocation, parallel building blocks, and separate compilation. ICMS 2010 - 3rd International Congress on Mathematical Software, Sep 2010, Kobe, Japan. pp.77-83, ⟨10.1007/978-3-642-15582-6_16⟩. ⟨hal-00506599⟩

Share

Metrics

Record views

1010

Files downloads

363