Yves Robert
YOU?
Author Swipe
View article: Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint
Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint Open
Large data and computing centers consume a significant share of the world's energy consumption. A prominent subset of the workloads in such centers are workflows with interdependent tasks, usually represented as directed acyclic graphs (DA…
View article: Checkpointing strategies for a fixed-length execution
Checkpointing strategies for a fixed-length execution Open
This work considers checkpointing strategies for a parallel application executing on a large-scale platform whose nodes are subject to failures. The application executes for a fixed duration, namely the length of the reservation that it ha…
View article: Steady-State Scheduling on Heterogeneous Clusters: Why and How?
Steady-State Scheduling on Heterogeneous Clusters: Why and How? Open
In this paper, we consider steady-state scheduling techniques for heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve a variety of important problems, which would be too difficult to t…
View article: The iso-level scheduling heuristic for heterogeneous processors
The iso-level scheduling heuristic for heterogeneous processors Open
Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. We present …
View article: On the complexity of task graph scheduling with transient and fail-stop failures
On the complexity of task graph scheduling with transient and fail-stop failures Open
This paper deals with the complexity of task graph scheduling with transient and fail-stop failures. While computing the reliability of a given schedule is easy in the absence of task replication, the problem becomes much more difficult whe…
View article: Improving batch schedulers with node stealing for failed jobs
Improving batch schedulers with node stealing for failed jobs Open
Summary After a machine failure, batch schedulers typically re‐schedule the job that failed with a high priority. This is fair for the failed job but still requires that job to re‐enter the submission queue and to wait for enough resources…
View article: NSF/IEEE-TCPP Curriculum Initiative on Parallel and Distributed Computing Core Topics for Undergraduates
NSF/IEEE-TCPP Curriculum Initiative on Parallel and Distributed Computing Core Topics for Undergraduates Open
This collaborative project represents a multi-faceted effort to shift computer science and engineering education toward ensuring that students can use 21st century platforms that pervasively incorporate parallel and distributed computing (…
View article: Risk-Aware Scheduling Algorithms for Variable Capacity Resources
Risk-Aware Scheduling Algorithms for Variable Capacity Resources Open
International audience
View article: Checkpointing Strategies to Tolerate Non-Memoryless Failures on HPC Platforms
Checkpointing Strategies to Tolerate Non-Memoryless Failures on HPC Platforms Open
This article studies checkpointing strategies for parallel applications subject to failures. The optimal strategy to minimize total execution time, or makespan, is well known when failure IATs obey an Exponential distribution, but it is un…
View article: Scheduling Variable Capacity Resources for Sustainability Workshop
Scheduling Variable Capacity Resources for Sustainability Workshop Open
We gathered the research community focused on compute scheduling in the new age of renewable power generation -- where variation in weather and solar radiation drives renewable generation, and thereby the carbon-intensity of power, and eff…
View article: Hyper-fidelity depletion with discrete motion for pebble bed reactors
Hyper-fidelity depletion with discrete motion for pebble bed reactors Open
Hyper-fidelity (HxF) depletion of pebble bed reactors (PBRs) is the capability to model depletion for every pebble while accounting for motion through the core. Previous HxF work demonstrated feasibility to deplete hundreds of thousands of…
View article: IMPACT OF THERMAL COUPLING ON A PEBBLE BED REACTOR EQUILIBRIUM FROM HYPER-FIDELITY DEPLETION
IMPACT OF THERMAL COUPLING ON A PEBBLE BED REACTOR EQUILIBRIUM FROM HYPER-FIDELITY DEPLETION Open
Due to the complex nature of pebble bed reactors' (PBR) operation and simulations, most approaches depict the fuel evolution using large spectral zones with uniform fluxes and compositions moving with time. However, the lack of experimenta…
View article: COMPARISON OF EXPERIMENTAL AND COMPUTATIONAL FLUX DATA FROM THE ADVANCED GAS REACTOR IRRADIATION CAMPAIGN
COMPARISON OF EXPERIMENTAL AND COMPUTATIONAL FLUX DATA FROM THE ADVANCED GAS REACTOR IRRADIATION CAMPAIGN Open
This work presents the validation of the Serpent 2 depletion calculations using experimental data from the second Advanced Gas Reactor irradiation campaign (AGR-2) performed at Idaho National Laboratory (INL) in the Advanced Test Reactor (…
View article: Dynamic Scheduling Strategies for Firm Semi-Periodic Real-Time Tasks
Dynamic Scheduling Strategies for Firm Semi-Periodic Real-Time Tasks Open
International audience