{"paper":{"title":"LinBox founding scope allocation, parallel building blocks, and separate compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SC"],"primary_cat":"cs.SE","authors_text":"B. David Saunders (CIS), Cl\\'ement Pernet (INRIA Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Jean-Guillaume Dumas (LJK), Thierry Gautier (INRIA Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble)","submitted_at":"2010-07-28T12:20:06Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1317","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}