LinBox founding scope allocation, parallel building blocks, and separate compilation
Year: 2010
Type: preprint
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.
Source: arXiv (Cornell University)
Institutions: Centre National de la Recherche Scientifique, Laboratoire Jean Kuntzmann, Pôle de recherche et d'enseignement supérieur Université de Grenoble, Université Grenoble Alpes, Institut national de recherche en sciences et technologies du numérique, Laboratoire d'Informatique de Grenoble, University of Delaware
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950899190