Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Journal Article

Increasing the degree of parallelism using speculative execution in task-based runtime systems


Bramas,  Berenger
Max Planck Computing and Data Facility, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Bramas, B. (2019). Increasing the degree of parallelism using speculative execution in task-based runtime systems. PeerJ Computer Science, 5: e183. doi:10.7717/peerj-cs.183.

Cite as: https://hdl.handle.net/21.11116/0000-0005-8E50-1

Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and the assignment of the work to the computational units. However, some applications have a limited degree of parallelism such that no matter how efficient the RS implementation, they may not scale on modern multicore CPUs. In this paper, we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data, and we formalize a new methodology to enable speculative execution in a graph of tasks. This description is partially implemented in our new C++ RS called SPETABARU, which is capable of executing tasks in advance if some others are not certain to modify the data. We study the behavior of our approach to compute Monte Carlo and replica exchange Monte Carlo simulations.