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

作     者：Zafari, Afshin Larsson, Elisabeth Tillenius, Martin 

作者机构：Uppsala Univ Dept Informat Technol Box 337 SE-75105 Uppsala Sweden 

出 版 物：《PARALLEL COMPUTING》 (并行计算)

年 卷 期：2019年第90卷

页      面：102582-102582页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：SNIC through Uppsala Multidisciplinary Center for Advanced Computational Science (UPPMAX) [p2009014] 

主　　题：Task-based parallel programming Distributed memory system High performance computing Scientific computing Hierarchical decomposition Data versioning 

摘      要：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. (C) 2019 Elsevier B.V. All rights reserved.