Skip to Main content Skip to Navigation
Conference papers

Exploiting a Parametrized Task Graph model for the parallelization of a sparse direct multifrontal solver

Abstract : The advent of multicore processors requires to reconsider the design of high performance computing libraries to embrace portable and effective techniques of parallel software engineering. One of the most promising approaches consists in abstracting an application as a directed acyclic graph (DAG) of tasks. While this approach has been popularized for shared memory environments by the OpenMP 4.0 standard where dependencies between tasks are automatically inferred, we investigate an alternative approach, capable of describing the DAG of task in a distributed setting, where task dependencies are explicitly encoded. So far this approach has been mostly used in the case of algorithms with a regular data access pattern and we show in this study that it can be efficiently applied to a higly irregular numerical algorithm such as a sparse multifrontal QR method. We present the resulting implementation and discuss the potential and limits of this approach in terms of productivity and effectiveness in comparison with more common parallelization techniques. Although at an early stage of development, preliminary results show the potential of the parallel programming model that we investigate in this work.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Alfredo Buttari Connect in order to contact the contributor
Submitted on : Monday, June 27, 2016 - 3:16:01 PM
Last modification on : Wednesday, November 3, 2021 - 7:17:24 AM


Files produced by the author(s)



Emmanuel Agullo, George Bosilca, Alfredo Buttari, Abdou Guermouche, Florent Lopez. Exploiting a Parametrized Task Graph model for the parallelization of a sparse direct multifrontal solver. Euro-Par 2016: Parallel Processing Workshops, Aug 2016, Grenoble, France. ⟨10.1007/978-3-319-58943-5_14⟩. ⟨hal-01337748⟩



Record views


Files downloads