Skip to Main content Skip to Navigation

Towards an automatic generation of dense linear algebra solvers on parallel architectures

Abstract : The increasing complexity of new parallel architectures has widened the gap between adaptability and efficiency of the codes. As high performance numerical libraries tend to focus more on performance, we wish to address this issue using a C++ library called NT2. By analyzing the properties of the linear algebra domain that can be extracted from numerical libraries and combining them with architectural features, we developed a generic approach to solve dense linear systems on various architectures including CPU and GPU. We have then extended our work with an example of a least squares solver based on semi-normal equations in mixed precision that cannot be found in current libraries. For the automatically generated solvers, we report performance comparison with state-of-the-art codes, showing that it is possible to obtain a generic code with a high-level interface (similar to Matlab) that can run either on CPU or GPU and that does not generate significant overhead.
Complete list of metadata

Cited literature [44 references]  Display  Hide  Download
Contributor : Marc Baboulin Connect in order to contact the contributor
Submitted on : Sunday, October 19, 2014 - 12:43:14 PM
Last modification on : Sunday, June 26, 2022 - 12:02:11 PM
Long-term archiving on: : Friday, April 14, 2017 - 12:18:18 PM


Files produced by the author(s)


  • HAL Id : hal-01075663, version 1


Marc Baboulin, Joel Falcou, Ian Masliah. Towards an automatic generation of dense linear algebra solvers on parallel architectures. [Research Report] RR-8615, Université Paris-Sud; INRIA. 2014, pp.20. ⟨hal-01075663⟩



Record views


Files downloads