Skip to Main content Skip to Navigation
New interface
Conference papers

Implementing a systolic algorithm for QR factorization on multicore clusters with PaRSEC

Abstract : This article introduces a new systolic algorithm for QR factorization, and its implementation on a supercomputing cluster of multicore nodes. The algorithm targets a virtual 3D-array and requires only local communications. The implementation of the algorithm uses threads at the node level, and MPI for inter-node communications. The complexity of the implementation is addressed with the PaRSEC software, which takes as input a parametrized dependence graph, which is derived from the algorithm, and only requires the user to decide, at the high-level, the allocation of tasks to nodes. We show that the new algorithm exhibits competitive performance with state-of-the-art QR routines on a supercomputer called Kraken, which shows that high-level programming environments, such as PaRSEC, provide a viable alternative to enhance the production of quality software on complex and hierarchical architectures.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Mathieu Faverge Connect in order to contact the contributor
Submitted on : Monday, December 2, 2013 - 10:02:26 AM
Last modification on : Friday, November 18, 2022 - 9:25:22 AM
Long-term archiving on: : Monday, March 3, 2014 - 1:55:48 PM


Files produced by the author(s)


  • HAL Id : hal-00844492, version 1



Guillaume Aupy, Mathieu Faverge, Yves Robert, Jakub Kurzak, Piotr Luszczek, et al.. Implementing a systolic algorithm for QR factorization on multicore clusters with PaRSEC. PROPER 2013 - 6th Workshop on Productivity and Performance, Aug 2013, Aachen, Germany. ⟨hal-00844492⟩



Record views


Files downloads