activity
20062013
most citedReclaiming the energy of a schedule: models and algorithms

20 citations · 28 across the 11 of their papers we have counts for

collaborators

12 papers

cs.DC2013

On the Combination of Silent Error Detection and Checkpointing

Guillaume Aupy, Anne Benoit, Thomas Hérault +3

In this paper, we revisit traditional checkpointing and rollback recovery strategies, with a focus on silent data corruption errors. Contrarily to fail-stop failures, such latent e…

cs.DC2013

Optimal Checkpointing Period: Time vs. Energy

Guillaume Aupy, Anne Benoit, Thomas Hérault +2

This short paper deals with parallel scientific applications using non-blocking and periodic coordinated checkpointing to enforce resilience. We provide a model and detailed formul…

cs.DS2013

Co-Scheduling Algorithms for High-Throughput Workload Execution

Guillaume Aupy, Manu Shantharam, Anne Benoit +2

This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallel…

cs.DS2013★ 2 cited

Energy-aware checkpointing of divisible tasks with soft or hard deadlines

Guillaume Aupy, Anne Benoit, Rami Melhem +2

In this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through check…

cs.DC2012★ 20 cited

Reclaiming the energy of a schedule: models and algorithms

Guillaume Aupy, Anne Benoit, Fanny Dufossé +1

We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at opt…

cs.DS2011

Energy-aware scheduling under reliability and makespan constraints

Guillaume Aupy, Anne Benoit, Yves Robert

We consider a task graph mapped on a set of homogeneous processors. We aim at minimizing the energy consumption while enforcing two constraints: a prescribed bound on the execution…