SPETABARU: A Task-based Runtime System with Speculative Execution Capability - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

SPETABARU: A Task-based Runtime System with Speculative Execution Capability

(1)
1

Abstract

While task-based programming models allow expressing the parallelism of algorithms finely, the traditional data accesses used in the sequential task-flow model (STF) can restrict the parallelism and hide useful information. In this presentation, we describe how more precise data accesses can be used to get better performance, and how uncertain modifications of the data by the tasks open the possibility for speculative execution. We detail different speculative execution models when this uncertainty exists. We also introduce our speculative runtime system, SPETABARU, and provide examples with the parallelization of the Monte Carlo and replica exchange Monte Carlo simulations.
Fichier principal
Vignette du fichier
SIAM CSE 2019.pdf (1.98 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02050190 , version 1 (07-03-2019)

Identifiers

  • HAL Id : hal-02050190 , version 1

Cite

Bérenger Bramas. SPETABARU: A Task-based Runtime System with Speculative Execution Capability. SIAM CSE 2019 - SIAM Conference on Computational Science and Engineering, Feb 2019, Spokane, United States. ⟨hal-02050190⟩
101 View
35 Download

Share

Gmail Facebook Twitter LinkedIn More