In EDS ansehen

SUPERGLUE: A SHARED MEMORY FRAMEWORK USING DATA VERSIONING FOR DEPENDENCY-AWARE TASK-BASED PARALLELIZATION.

Gespeichert in:
Bibliographische Detailangaben
Titel: SUPERGLUE: A SHARED MEMORY FRAMEWORK USING DATA VERSIONING FOR DEPENDENCY-AWARE TASK-BASED PARALLELIZATION.
Autoren: TILLENIUS, MARTIN
Quelle: SIAM Journal on Scientific Computing; 2015, Vol. 37 Issue 6, pC617-C642, 26p
Schlagwörter: PARALLEL programming, COMPUTER programming, C++, COMPUTER systems, COMPUTER architecture, COMPUTER science
Abstract: In computational science, it is necessary to make efficient use of multicore architectures for dealing with complex real-life application problems. However, with increased hardware complexity, the cost in man hours of writing and rewriting software to adapt to evolving computer systems is becoming prohibitive. Task-based parallel programming models aim to allow the application programmers tofocus on the algorithms and applications, while the performance is handled by a runtime system that schedules the tasks onto nodes, cores, and accelerators. In this paper we describe a task parallel programming model where dependencies are represented through data versioning. Our model allows expressing the program control flow without artificial dependencies, has low complexity for resolving dependencies, and enables scheduling decisions to be made locally. We implement this as a freely available C++ header-only template library, and show experimental results indicating that our implementation both scales and performs well in comparison to similar runtime systems. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Scientific Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:In computational science, it is necessary to make efficient use of multicore architectures for dealing with complex real-life application problems. However, with increased hardware complexity, the cost in man hours of writing and rewriting software to adapt to evolving computer systems is becoming prohibitive. Task-based parallel programming models aim to allow the application programmers tofocus on the algorithms and applications, while the performance is handled by a runtime system that schedules the tasks onto nodes, cores, and accelerators. In this paper we describe a task parallel programming model where dependencies are represented through data versioning. Our model allows expressing the program control flow without artificial dependencies, has low complexity for resolving dependencies, and enables scheduling decisions to be made locally. We implement this as a freely available C++ header-only template library, and show experimental results indicating that our implementation both scales and performs well in comparison to similar runtime systems. [ABSTRACT FROM AUTHOR]
ISSN:10648275
DOI:10.1137/140989716