Implementing multifrontal sparse solvers for multicore architectures with Sequential Task Flow runtime systems - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Mathematical Software Year : 2016

Implementing multifrontal sparse solvers for multicore architectures with Sequential Task Flow runtime systems

(1) , (2, 3) , (1) , (4, 3)
1
2
3
4

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 and effectiveness of runtime systems based on the Sequential Task Flow model for complex applications , namely, sparse matrix multifrontal factorizations which feature extremely irregular workloads, with tasks of different granularities and characteristics and with a variable memory consumption. Most importantly, it shows how this parallel programming model eases the development of complex features that benefit the performance of sparse, direct solvers as well as their memory consumption. We illustrate our discussion with the multifrontal QR factorization running on top of the StarPU runtime system. ACM Reference Format: Emmanuel Agullo, Alfredo Buttari, Abdou Guermouche and Florent Lopez, 2014. Implementing multifrontal sparse solvers for multicore architectures with Sequential Task Flow runtime systems
Fichier principal
Vignette du fichier
toms_qrm_starpu.pdf (440.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01333645 , version 1 (18-06-2016)

Identifiers

Cite

Emmanuel Agullo, Alfredo Buttari, Abdou Guermouche, Florent Lopez. Implementing multifrontal sparse solvers for multicore architectures with Sequential Task Flow runtime systems. ACM Transactions on Mathematical Software, 2016, ⟨10.1145/2898348⟩. ⟨hal-01333645⟩
506 View
377 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More