Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
Emmanuel Agullo, Alfredo Buttari, Abdou Guermouche et al. · ACM Transactions on Mathematical Software · 2016
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.
Cited by 76 works. doi:10.1145/2898348 Open-access PDF
Authors
References
- Lecture Notes in Computer Science 1205
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Nonlinear Dimensionality Reduction by Locally Linear Embedding
- A Global Geometric Framework for Nonlinear Dimensionality Reduction
- Least angle regression
- Regularization and Variable Selection Via the Elastic Net
- Content-based image retrieval at the end of the early years
- Analysis of a complex of statistical variables into principal components.
- Locality Preserving Projections
- Image indexing using color correlograms