Thomas Herault
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Thomas Herault has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
- George Bosilca
University of Tennessee, Knoxville, USA
12 shared publications - Aurelien Bouteiller
The University of Tennessee
8 shared publications - Yves Robert
ENS Lyon
8 shared publications - Jack Dongarra
University of Tennessee, Knoxville, TN, USA
6 shared publications - Anne Benoit
ENS Lyon
4 shared publications - Frédéric Vivien
ENS Lyon & INRIA
3 shared publications
Latest Publications
- Open Access
- 29 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (16) , 1-38
A Survey of Distributed Asynchronous Many-Task Models and Their Applications
Asynchronous many-task (AMT) runtime systems have become an important paradigm for expressing fine-grained parallelism and managing asynchrony in high-performance computing (HPC). Originating from early dataflow concepts, AMTs have evolved to enable dynamic task generation, explicit dependency management, and asynchronous execution, facilitating the overlap of computation and communication. These capabilities address the limitations of traditional bulk-synchronous models, such as those employed in MPI+X , which can struggle with irregular, adaptive, or data-driven workloads. This survey provides a comprehensive overview of representative distributed AMT systems—including Charm ++ , HPX, Legion, PaRSEC, Uintah, Chapel, and StarPU—focusing on their design principles, execution models, and runtime mechanisms for scheduling, communication, and synchronization. We examine how these systems tackle key challenges such as load imbalance, runtime overheads, programmability, and performance portability. In addition, the article discusses application domains where AMTs have demonstrated tangible benefits and highlights the conditions under which their use is most advantageous. The goal of this survey is to equip researchers and practitioners with a clear understanding of distributed AMT models and to provide guidance for selecting and applying the most suitable runtime system for specific computational objectives.
- 29 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (16) , 1-38
Open AccessA Survey of Distributed Asynchronous Many-Task Models and Their Applications
Asynchronous many-task (AMT) runtime systems have become an important paradigm for expressing fine-grained parallelism and managing asynchrony in high-performance computing (HPC). Originating from early dataflow concepts, AMTs have evolved to enable dynamic task generation, explicit dependency management, and asynchronous execution, facilitating the overlap of computation and communication. These capabilities address the limitations of traditional bulk-synchronous models, such as those employed in MPI+X , which can struggle with irregular, adaptive, or data-driven workloads. This survey provides a comprehensive overview of representative distributed AMT systems—including Charm ++ , HPX, Legion, PaRSEC, Uintah, Chapel, and StarPU—focusing on their design principles, execution models, and runtime mechanisms for scheduling, communication, and synchronization. We examine how these systems tackle key challenges such as load imbalance, runtime overheads, programmability, and performance portability. In addition, the article discusses application domains where AMTs have demonstrated tangible benefits and highlights the conditions under which their use is most advantageous. The goal of this survey is to equip researchers and practitioners with a clear understanding of distributed AMT models and to provide guidance for selecting and applying the most suitable runtime system for specific computational objectives.
- 2 July 2026
- Published by Springer Nature
- p. 91-103
Abstract Communicators for Task Based Runtime Systems
- 2 July 2026
- Published by Springer Nature
- p. 91-103
Abstract Communicators for Task Based Runtime Systems
- 2 July 2026
- Published by Springer Nature
- p. 161-171
Using C++ Generators in Dataflow Broadcast
- 10 October 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 40 (1) , 96-114
Fixed-work versus fixed-time checkpointing on large-scale failure-prone platforms
Consider a High-Performance Computing (HPC) application executing on a large-scale failure-prone platform. The Fixed-Work Checkpointing ( FWC ) problem consists in minimizing the expected time to execute a fixed amount of work (namely a fraction or the totality of the application). Strategies for the FWC problem have received considerable attention and are well-understood. On the contrary, the dual problem, namely the Fixed-Time Checkpointing ( FTC ) problem, has been considered only very recently. The FTC problem consists in maximizing the expected work achieved during a fixed amount of time (namely the duration of a reservation granted to the application). This work provides a comparative overview of both problems. First we review existing strategies for the FWC problem and extend them to stochastic checkpoints, i.e., when the checkpoint is no longer a deterministic constant but obeys some probability distribution law instead. Then we provide a comprehensive study of the FTC problem. The problem turns out to be surprisingly difficult, even when restricting to taking one or two checkpoints. We provide a threshold-based heuristic to solve the general instance of the problem with an arbitrary number of checkpoints, and we have to resort to time discretization to provide an optimal strategy. We further extend this latter strategy to stochastic checkpoints.
- 10 October 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 40 (1) , 96-114
Fixed-work versus fixed-time checkpointing on large-scale failure-prone platforms
Consider a High-Performance Computing (HPC) application executing on a large-scale failure-prone platform. The Fixed-Work Checkpointing ( FWC ) problem consists in minimizing the expected time to execute a fixed amount of work (namely a fraction or the totality of the application). Strategies for the FWC problem have received considerable attention and are well-understood. On the contrary, the dual problem, namely the Fixed-Time Checkpointing ( FTC ) problem, has been considered only very recently. The FTC problem consists in maximizing the expected work achieved during a fixed amount of time (namely the duration of a reservation granted to the application). This work provides a comparative overview of both problems. First we review existing strategies for the FWC problem and extend them to stochastic checkpoints, i.e., when the checkpoint is no longer a deterministic constant but obeys some probability distribution law instead. Then we provide a comprehensive study of the FTC problem. The problem turns out to be surprisingly difficult, even when restricting to taking one or two checkpoints. We provide a threshold-based heuristic to solve the general instance of the problem with an arbitrary number of checkpoints, and we have to resort to time discretization to provide an optimal strategy. We further extend this latter strategy to stochastic checkpoints.
- 3 October 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 40 (1) , 63-79
Fault-tolerant numerical iterative algorithms at scale
This work investigates how to protect numerical iterative algorithms from all types of errors that can strike at scale: fail-stop errors (a.k.a. failures) and silent errors, striking both as computation errors and memory bit-flips. We combine various techniques: detectors for computation errors, checksums for memory errors, and checkpoint/restart for failures. The objective is to minimize the expected time per iteration of the algorithm. We design a hierarchical pattern that combines and interleaves all these fault-tolerance mechanisms, and we determine the optimal periodic pattern that achieves this objective. We instantiate these results for the performance analysis of the Preconditioned Conjugate Gradient (PCG) algorithm: we report several scenarios where the optimal pattern dramatically decreases the overhead due to error mitigation.
- 3 October 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 40 (1) , 63-79
Fault-tolerant numerical iterative algorithms at scale
This work investigates how to protect numerical iterative algorithms from all types of errors that can strike at scale: fail-stop errors (a.k.a. failures) and silent errors, striking both as computation errors and memory bit-flips. We combine various techniques: detectors for computation errors, checksums for memory errors, and checkpoint/restart for failures. The objective is to minimize the expected time per iteration of the algorithm. We design a hierarchical pattern that combines and interleaves all these fault-tolerance mechanisms, and we determine the optimal periodic pattern that achieves this objective. We instantiate these results for the performance analysis of the Preconditioned Conjugate Gradient (PCG) algorithm: we report several scenarios where the optimal pattern dramatically decreases the overhead due to error mitigation.
- 1 October 2025
- Published by Springer Nature
- p. 120-132
Scalable Block-Sparse Matrix Multiplication Using Template Task Graphs
- 1 October 2025
- Published by Springer Nature
- p. 120-132
Scalable Block-Sparse Matrix Multiplication Using Template Task Graphs
- 16 October 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (1) , 147-166
PaRSEC: Scalability, flexibility, and hybrid architecture support for task-based applications in ECP
This paper highlights the most significant enhancements made to PaRSEC, a scalable task-based runtime system designed for hybrid machines, during the Exascale Computing Project (ECP). The enhancements focus on expanding the capabilities of PaRSEC to address the evolving landscape of parallel computing. Notable achievements include the integration of support for three major types of accelerators (NVIDIA, AMD, and Intel GPUs), the refinement and increased flexibility of the communication subsystem, and the introduction of new programming interfaces tailored for irregular applications. Additionally, the project resulted in the development of powerful debugging and performance analysis tools aimed at assisting users in understanding and optimizing their applications. We present a comprehensive demonstration of these advancements through a series of benchmarks and applications within ECP and beyond, thereby showcasing the enhanced capabilities of PaRSEC across the diverse architectures within the ECP, providing valuable insights into the runtime system’s adaptability and performance across varied computing environments.
- 16 October 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (1) , 147-166
PaRSEC: Scalability, flexibility, and hybrid architecture support for task-based applications in ECP
This paper highlights the most significant enhancements made to PaRSEC, a scalable task-based runtime system designed for hybrid machines, during the Exascale Computing Project (ECP). The enhancements focus on expanding the capabilities of PaRSEC to address the evolving landscape of parallel computing. Notable achievements include the integration of support for three major types of accelerators (NVIDIA, AMD, and Intel GPUs), the refinement and increased flexibility of the communication subsystem, and the introduction of new programming interfaces tailored for irregular applications. Additionally, the project resulted in the development of powerful debugging and performance analysis tools aimed at assisting users in understanding and optimizing their applications. We present a comprehensive demonstration of these advancements through a series of benchmarks and applications within ECP and beyond, thereby showcasing the enhanced capabilities of PaRSEC across the diverse architectures within the ECP, providing valuable insights into the runtime system’s adaptability and performance across varied computing environments.
- Open Access
- 12 March 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 156, 313-324
Multi-GPU work sharing in a task-based dataflow programming model
- 12 March 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 156, 313-324
Open AccessMulti-GPU work sharing in a task-based dataflow programming model
- 15 February 2024
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 188
Revisiting I/O bandwidth-sharing strategies for HPC applications
- 15 February 2024
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 188
Revisiting I/O bandwidth-sharing strategies for HPC applications
- Open Access
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 467-476
When to checkpoint at the end of a fixed-length reservation?
- 12 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 467-476
Open AccessWhen to checkpoint at the end of a fixed-length reservation?