A taxonomy of task-based parallel programming technologies for high-performance computing

Thoman, Peter; Dichev, Kiril; Heller, Thomas; Iakymchuk, Roman; Aguilar, Xavier; Hasanov, Khalid; Gschwandtner, Philipp; Lemarinier, Pierre; Markidis, Stefano; Jordan, Herbert; Fahringer, Thomas; Katrinis, Kostas; Laure, Erwin; Nikolopoulos, Dimitrios S.

doi:10.1007/s11227-018-2238-4

Cited by 116 publications

(52 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Benchmarks that employ parallel loops to expose parallelism have been configured to always use dynamic scheduling to perform well under heterogeneous configurations. Similarly, task-based parallelism which is increasingly common in HPC [29], also employs dynamic scheduling. When evaluating heterogeneous configurations we force the master thread to execute in an out-oforder core at all times.…”

Section: Experimental Methodologymentioning

confidence: 99%

Design trade-offs for emerging HPC processors based on mobile market technology

2019

View full text Add to dashboard Cite

High-Performance Computing (HPC) is at the crossroads of a potential transition towards mobile market processor technology. Unlike in prior transitions, numerous hardware vendors and integrators will have access to state-of-the-art processor designs due to Arm's licensing business model. This fact gives them greater flexibility to implement custom HPC-specific designs. In this paper, we undertake a study to quantify the different energyperformance trade-offs when architecting a processor based on mobile market technology. Through detailed simulations over a representative set of benchmarks, our results show that: (i) a modest amount of last-level cache per core is sufficient, leading to significant power and area savings; (ii) in-order cores offer favorable trade-offs when compared to out-of-order cores for a wide range of benchmarks; and (iii) heterogeneous configurations help to improve processor performance and energy-efficiency.

show abstract

Section: Experimental Methodologymentioning

confidence: 99%

Design trade-offs for emerging HPC processors based on mobile market technology

2019

View full text Add to dashboard Cite

show abstract

“…For complex computations such as the ones described herein, a higher level of abstraction is needed such as that of a task. The authors of [57] review APIs and runtime systems that are designed to support MTC applications. These authors refer to a particular combination of an API and a runtime system as a task-based parallelism technology and note that HPC is moving away from the message passing paradigm to such technologies.…”

Section: Methodsmentioning

confidence: 99%

“…As identified in [57], an ideal API would have the ability to partition, synchronize, and cancel tasks; specify compute nodes for workers to run on; start/stop workers; receive task or process fault information; and checkpoint a job should a nonrecoverable fault occur. These authors also believe that an ideal runtime system would automatically distribute data and code to workers; schedule workers; and deliver fault information to the master compute node.…”

Section: Methodsmentioning

confidence: 99%

Developing political-ecological theory: The need for Many-Task Computing

Haas

2019

Preprint

View full text Add to dashboard Cite

8Models of political-ecological systems can inform policies for managing ecosystems that 9 contain endangered species. One way to increase the credibility of these models is to 10 subject them to a rigorous suite of data-based statistical assessments. Doing so involves 11 statistically estimating the model's parameters, computing confidence intervals for these 12 parameters, determining the model's prediction error rate, and assessing its sensitivity to 13 parameter misspecification. 14 Here, these statistical algorithms along with a method for constructing politically fea-15 sible policies from a statistically fitted model, are coded as JavaSpaces TM programs that 16 run as compute jobs on either supercomputers or a collection of in-house workstations. 17 Several new algorithms for implementing such jobs in distributed computing environments 18 are described. 19 This downloadable code is used to compute each job's output for the management 20 challenge of conserving the East African cheetah (Acinonyx jubatus). This case study shows 21 that the proposed suite of statistical tools can be run on a supercomputer to establish the 22 credibility of a managerially-relevant model of a political-ecological system that contains 23 one or more endangered species. This demonstration means that the new standard of 24 credibility that any political-ecological model needs to meet before being used to inform 25 ecosystem management decisions, is the one given herein. 26 1 27 Keywords: social-ecological systems; ecosystem policymaking; agent-based modeling; 28 high performance computing; sensitivity analysis; statistical estimation of large models 29 1 Introduction 30There is a need to acknowledge the complexity of political-ecological systems and the signif-31 icant challenges to building theories of them [1]. Such systems lie at the interface between 32 social/political science and ecology. The complexity of each of these fields coupled with an 33 additional layer of complexity introduced by the interactions between sociological/political 34 systems and natural systems can result in highly complex system dynamics, i.e., ones that 35 are stiff, nonlinear, and possess feedback loops. For example, Schoon and Van der Leeuw [2] 36 note that systems composed of interacting sociological and ecological subsystems are quick 37 to change and rarely stay in equilibrium for long. Further, many state variables are needed 38 to describe both the decision making processes of the relevant social groups, and the func-39 tioning of the involved ecosystem. A political-ecological system is also referred to as a 40 socio-ecological system or social-ecological system (e.g., see [3]). The former term is em-41 phasized herein because those political actions and processes that drive social movements 42 are often initiated by groups seeking to gain increased political power [4]. Building such 43 models is more than an academic exercise. Indeed, the alarming decline in the planet's 44 biodiversity [5], creates a crucial need for credible politi...

show abstract

“…There are several RS reported in the literature (Danalis et al, 2014;Kale & Krishnan, 1993;Perez, Badia & Labarta, 2008;Gautier et al, 2013;Bauer et al, 2012;Tillenius, 2015), and each of them has its own specificity and interface. We refer to a comparative study (Thoman et al, 2018) for a detailed description where the different aspects and features of RS are categorized. Task-based method is a viable solution to use modern heterogeneous computing nodes and mix computation between CPU and devices.…”

Section: Introductionmentioning

confidence: 99%

Impact study of data locality on task-based applications through the Heteroprio scheduler

Bramas¹

2019

PeerJ Computer Science

View full text Add to dashboard Cite

The task-based approach has emerged as a viable way to effectively use modern heterogeneous computing nodes. It allows the development of parallel applications with an abstraction of the hardware by delegating task distribution and load balancing to a dynamic scheduler. In this organization, the scheduler is the most critical component that solves the DAG scheduling problem in order to select the right processing unit for the computation of each task. In this work, we extend our Heteroprio scheduler that was originally created to execute the fast multipole method on multi-GPUs nodes. We improve Heteroprio by taking into account data locality during task distribution. The main principle is to use different task-lists for the different memory nodes and to investigate how locality affinity between the tasks and the different memory nodes can be evaluated without looking at the tasks’ dependencies. We evaluate the benefit of our method on two linear algebra applications and a stencil code. We show that simple heuristics can provide significant performance improvement and cut by more than half the total memory transfer of an execution.

show abstract

A taxonomy of task-based parallel programming technologies for high-performance computing

Cited by 116 publications

References 23 publications

Design trade-offs for emerging HPC processors based on mobile market technology

Design trade-offs for emerging HPC processors based on mobile market technology

Developing political-ecological theory: The need for Many-Task Computing

Impact study of data locality on task-based applications through the Heteroprio scheduler

Contact Info

Product

Resources

About