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

Jean-Guillaume Dumas (1) , Thierry Gautier (2) , Clément Pernet (2) , B. David Saunders (3)

1 CASYS - Calculs Algébriques et Systèmes Dynamiques
2 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
3 CIS - Department of Computer and Information Sciences [Newark]

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.

Domaines: Génie logiciel [cs.SE]; Calcul parallèle, distribué et partagé [cs.DC]; Calcul formel [cs.SC]

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⟩