Skip to Main content Skip to Navigation
Journal articles

Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems

Guillaume Aupy 1, 2 Anne Benoit 1, 2
Abstract : We consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of identical processors, whose speed can be dynamically modified. It is also subject to failures: if a processor is slowed down to decrease the energy consumption, it has a higher chance to fail. Therefore, the scheduling problem requires us to re-execute or replicate tasks (i.e., execute twice the same task, either on the same processor, or on two distinct processors), in order to increase the reliability. It is a tri-criteria problem: the goal is to minimize the energy consumption, while enforcing a bound on the total execution time (the makespan), and a constraint on the reliability of each task. Our main contribution is to propose approximation algorithms for linear chains of tasks and independent tasks. For linear chains, we design a fully polynomial-time approximation scheme. However, we show that there exists no constant factor approximation algorithm for independent tasks, unless P=NP, and we propose in this case an approximation algorithm with a relaxation on the makespan constraint.
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/hal-01252333
Contributor : Equipe Roma <>
Submitted on : Thursday, January 7, 2016 - 2:36:21 PM
Last modification on : Wednesday, February 26, 2020 - 11:14:31 AM
Long-term archiving on: : Friday, April 8, 2016 - 1:25:39 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01252333, version 1

Collections

Citation

Guillaume Aupy, Anne Benoit. Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems. Parallel Processing Letters, World Scientific Publishing, 2016, Parallel Processing Letters, 26 (01), pp.23. ⟨hal-01252333⟩

Share

Metrics

Record views

330

Files downloads

291