Multifrontal QR Factorization for Multicore Architectures over Runtime Systems

Abstract : To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG parallelism regained popularity in the high performance, scientific computing community. Modern runtime systems offer a programming interface that complies with this paradigm and powerful engines for scheduling the tasks into which the application is decomposed. These tools have already proved their effectiveness on a number of dense linear algebra applications. This paper evaluates the usability of runtime systems for complex applications, namely, sparse matrix multifrontal factorizations which constitute extremely irregular workloads, with tasks of different granularities and characteristics and with a variable memory consumption. Experimental results on real-life matrices show that it is possible to achieve the same efficiency as with an ad hoc scheduler which relies on the knowledge of the algorithm. A detailed analysis shows the performance behavior of the resulting code and possible ways of improving the effectiveness of runtime systems.
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01220611
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, October 26, 2015 - 4:10:23 PM
Last modification on : Friday, April 12, 2019 - 4:23:02 PM
Document(s) archivé(s) le : Wednesday, January 27, 2016 - 4:30:48 PM

File

agullo_12708.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01220611, version 1
  • OATAO : 12708

Citation

Emmanuel Agullo, Alfredo Buttari, Abdou Guermouche, Florent Lopez. Multifrontal QR Factorization for Multicore Architectures over Runtime Systems. 19th International Conference Euro-Par (EuroPar 2013), Aug 2013, Aachen, Germany. pp. 521-532. ⟨hal-01220611⟩

Share

Metrics

Record views

285

Files downloads

120