期刊
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
卷 43, 期 2, 页码 -出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2898348
关键词
Algorithms; Performance; Sparse direct solvers; multicores; runtime systems; communication-avoiding; memory-aware
资金
- Agence Nationale de la Recherche [ANR-13-MONU-0007]
- GENCI-[CCRT/TGCC/CINES/IDRIS] [2014-i2014065063]
- Agence Nationale de la Recherche (ANR) [ANR-13-MONU-0007] Funding Source: Agence Nationale de la Recherche (ANR)
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据