A bi-objective hybrid genetic algorithm to minimize energy consumption and makespan for precedence-constrained applications using dynamic voltage scaling - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

A bi-objective hybrid genetic algorithm to minimize energy consumption and makespan for precedence-constrained applications using dynamic voltage scaling

(1) , (2) , (3) , (1) , (3)
1
2
3

Abstract

Precedence-constrained parallel applications are one of the most typical application model used in scientific and engineering fields. Almost all efforts, on this kind of applications, have focused on the minimization of makespan (completion time). It is only recently that much attention has been paid to energy consumption. In this paper, we address the precedence-constrained parallel applications on heterogeneous computing systems (HCSs). We propose a new bi-objective hybrid genetic algorithm that takes into account, not only makespan, but also energy consumption. This metaheuristic adopts dynamic voltage scaling (DVS) to minimize energy consumption. Our study provides promising results showing the significance and potential of DVS. The experimental results from our comparative evaluation study confirm the superior performance of our approach over the other known heuristics on the two criteria energy saving and completion time.
Not file

Dates and versions

hal-00837546 , version 1 (22-06-2013)

Identifiers

Cite

El-Ghazali Talbi, Mohand Mezmaz, Young Choon Lee, Nouredine Melab, Albert Zomaya. A bi-objective hybrid genetic algorithm to minimize energy consumption and makespan for precedence-constrained applications using dynamic voltage scaling. WCCI 2010 - IEEE World Congress on Computational Intelligence, Jul 2010, Barcelona, Spain. ⟨10.1109/CEC.2010.5586540⟩. ⟨hal-00837546⟩
105 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More