DuctTeip: An efficient programming model for distributed task-based parallel computing

•We introduce a hierarchical task parallel programming model for distributed memory systems.•We show that the new model provides both flexibility and performance.•We use the model to implement a Cholesky factorization and a solver for the shallow water equations.•We have compared our implementation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing Jg. 90; S. 102582
Hauptverfasser: Zafari, Afshin, Larsson, Elisabeth, Tillenius, Martin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.12.2019
Schlagworte:
Data versioning
Distributed memory system
Hierarchical decomposition
High performance computing
Scientific computing
Task-based parallel programming
Hierarchical decomposition
Distributed memory system
Scientific computing
High performance computing
Task-based parallel programming
65Y10
65Y05
68Q10
Data versioning
ISSN:0167-8191, 1872-7336, 1872-7336
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We introduce a hierarchical task parallel programming model for distributed memory systems.•We show that the new model provides both flexibility and performance.•We use the model to implement a Cholesky factorization and a solver for the shallow water equations.•We have compared our implementation with other frameworks and shown that it is competitive. Current high-performance computer systems used for scientific computing typically combine shared memory computational nodes in a distributed memory environment. Extracting high performance from these complex systems requires tailored approaches. Task-based parallel programming has been successful both in simplifying the programming and in exploiting the available hardware parallelism for shared memory systems. In this paper we focus on how to extend task-parallel programming to distributed memory systems. We use a hierarchical decomposition of tasks and data in order to accommodate the different levels of hardware. We test the proposed programming model on two different applications, a Cholesky factorization, and a solver for the Shallow Water Equations. We also compare the performance of our implementation with that of other frameworks for distributed task-parallel programming, and show that it is competitive.
ISSN:0167-8191
1872-7336
1872-7336
DOI:10.1016/j.parco.2019.102582