Anne Benoit
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
Anne Benoit has a total of 87 co-authors. Here are the top co-authors by number of shared publications:
- Yves Robert
ENS Lyon
30 shared publications - Frédéric Vivien
ENS Lyon & INRIA
8 shared publications - Guillaume Aupy
Ecole Normale Supérieure de Lyon
8 shared publications - Henning Meyerhenke
Karlsruhe Institute of Technology (KIT)
5 shared publications Yves Robert
5 shared publications- Lilian Pichot
Laboratoire Sport et sciences sociales (UR1342 ; E3S), Faculté des sciences du sport, Université de Strasbourg
4 shared publications
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 210-224
Throughput Optimization for Multi-level Speculative Decoding
- 15 August 2026
- Published by Springer Nature
- p. 210-224
Throughput Optimization for Multi-level Speculative Decoding
- 15 August 2026
- Published by Springer Nature
- p. 270-284
Carbon-Aware Mapping and Scheduling for Deadline-Constrained Workflows
- 15 August 2026
- Published by Springer Nature
- p. 270-284
Carbon-Aware Mapping and Scheduling for Deadline-Constrained Workflows
- 10 June 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
Minimizing memory in parallel task graph scheduling: Focusing on average consumption
- 10 June 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
Minimizing memory in parallel task graph scheduling: Focusing on average consumption
- 23 January 2026
- Published by Springer Nature in Journal of Scheduling
- Vol. 29 (2) , 125-141
An update on the asymptotic optimality of the longest processing time heuristic
- 23 January 2026
- Published by Springer Nature in Journal of Scheduling
- Vol. 29 (2) , 125-141
An update on the asymptotic optimality of the longest processing time heuristic
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (2) , 427-442
Scheduling Jobs Under a Variable Number of Processors
Even though it is usually assumed that data centers can always operate at maximum capacity, there have been recent scenarios where the amount of electricity that can be used by data centers evolve over time. Hence, the number of available processors is not a constant anymore. In this work, we assume that jobs can be checkpointed before a resource change. Indeed, in the scenarios that we consider, the resource provider warns the user before a change in the number of processors. It is thus possible to anticipate and take checkpoints before the change happens, such that no work is ever lost. The goal is then to maximize the goodput and/or the minimum yield of jobs within the next section (time between two changes in the number of processors). We model the problem and design greedy solutions and sophisticated dynamic programming algorithms with some optimality results for jobs of infinite duration, and adapt the algorithms to finite jobs. A comprehensive set of simulations, building on real-life job sets, demonstrates the performance of the proposed algorithms. Most algorithms achieve a useful platform utilization (goodput) of over 95%. With infinite jobs, the algorithms also keep fairness by having a relative minimum yield above 0.8, meaning that each job gets a good access to the platform (80% of the time that it would have had if each job had its perfect share of the platform). For finite jobs, the minimum yield can be low since very short new jobs may have to wait until the beginning of the next section to start (and finish), significantly impacting their yield. However, for 75% of the jobs within each workload, the yield ratio between these jobs is at most at a factor two, hence demonstrating the fairness of the proposed algorithms.
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (2) , 427-442
Scheduling Jobs Under a Variable Number of Processors
Even though it is usually assumed that data centers can always operate at maximum capacity, there have been recent scenarios where the amount of electricity that can be used by data centers evolve over time. Hence, the number of available processors is not a constant anymore. In this work, we assume that jobs can be checkpointed before a resource change. Indeed, in the scenarios that we consider, the resource provider warns the user before a change in the number of processors. It is thus possible to anticipate and take checkpoints before the change happens, such that no work is ever lost. The goal is then to maximize the goodput and/or the minimum yield of jobs within the next section (time between two changes in the number of processors). We model the problem and design greedy solutions and sophisticated dynamic programming algorithms with some optimality results for jobs of infinite duration, and adapt the algorithms to finite jobs. A comprehensive set of simulations, building on real-life job sets, demonstrates the performance of the proposed algorithms. Most algorithms achieve a useful platform utilization (goodput) of over 95%. With infinite jobs, the algorithms also keep fairness by having a relative minimum yield above 0.8, meaning that each job gets a good access to the platform (80% of the time that it would have had if each job had its perfect share of the platform). For finite jobs, the minimum yield can be low since very short new jobs may have to wait until the beginning of the next section to start (and finish), significantly impacting their yield. However, for 75% of the jobs within each workload, the yield ratio between these jobs is at most at a factor two, hence demonstrating the fairness of the proposed algorithms.
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Efficient and effective methods for variant selection
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessEfficient and effective methods for variant selection
- 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.
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 627-637
Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 627-637
Open AccessCarbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint