Hedgehog: Understandable Scheduler-Free Heterogeneous Asynchronous Multithreaded Data-Flow Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Hedgehog: Understandable Scheduler-Free Heterogeneous Asynchronous Multithreaded Data-Flow Graphs

(1, 2) , (2) , (1) , (1) , (3) , (2)


Getting performance on high-end heterogeneous nodes is challenging. This is due to the large semantic gap between a computation’s specification - possibly mathematical formulas or an abstract sequential algorithm - and its parallel implementation; this gap obscures the program’s parallel structures and how it gains or loses performance. We present Hedgehog, a library aimed at coarse-grain parallelism. It explicitly embeds a data-flow graph in a program and uses this graph at runtime to drive the program’s execution so it takes advantage of hardware parallelism (multicore CPUs and multiple accelerators). Hedgehog has asynchronicity built in. It statically binds individual threads to graph nodes, which are ready to fire when any of their inputs are available. This allows Hedgehog to avoid using a global scheduler and the loss of performance associated with global synchronizations and managing of thread pools. Hedgehog provides a separation of concerns and distinguishes between compute and state maintenance tasks. Its API reflects this separation and allows a developer to gain a better understanding of performance when executing the graph. Hedgehog is implemented as a C++17 headers-only library. One feature of the framework is its low overhead; it transfers control of data between two nodes in ≈ 1 μs. This low overhead combines with Hedgehog’s API to provide essentially cost-free profiling of the graph, thereby enabling experimentation for performance, which enhances a developer’s insight into a program’s performance.
Hedgehog’s asynchronous data-flow graph supports a data streaming programming model both within and between graphs. We demonstrate the effectiveness of this approach by highlighting the performance of streaming implementations of two numerical linear algebra routines, which are comparable to existing libraries: matrix multiplication achieves >95% of the theoretical peak of 4 GPUs; LU decomposition with partial pivoting starts streaming partial final result blocks 40× earlier than waiting for the full result. The relative ease and understandability of obtaining performance with Hedgehog promises to enable non-specialists to target performance on high-end single nodes.
Fichier principal
Vignette du fichier
report.pdf (431.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03004548 , version 1 (05-04-2022)



Alexandre Bardakoff, Bruno Bachelet, Timothy Blattner, Walid Keyrouz, Gerson C. Kroiz, et al.. Hedgehog: Understandable Scheduler-Free Heterogeneous Asynchronous Multithreaded Data-Flow Graphs. IEEE/ACM 3rd Annual Parallel Applications Workshop: Alternatives To MPI+X (PAW-ATM), Nov 2020, Atlanta, United States. pp.1-15, ⟨10.1109/PAWATM51920.2020.00006⟩. ⟨hal-03004548⟩
53 View
3 Download



Gmail Facebook Twitter LinkedIn More