Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
Citations Over TimeTop 10% of 2016 papers
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 article evaluates the usability and effectiveness of runtime systems based on the Sequential Task Flow model for complex applications, namely, sparse matrix multifrontal factorizations that 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.
Related Papers
- Stable Discriminative Dictionary Learning Via Discriminative Deviation(2012)
- → Accurate And Fast Fine-Grained Image Classification via Discriminative Learning(2019)3 cited
- → Discriminative Regions: A Substrate for Analyzing Life-Logging Image Sequences(2014)2 cited
- → Diffusion-TTA: Test-time Adaptation of Discriminative Models via Generative Feedback(2023)