A Pareto-based GA for Scheduling HPC Applications on Distributed Cloud Infrastructures

International audienceReducing energy consumption is an increasingly important issue in cloud computing, more specifically when dealing with High Performance Computing (HPC). Minimizing energy consumption can significantly reduce the amount of energy bills and then increases the provider's profit. In addition, the reduction of energy decreases greenhouse gas emissions. Therefore, many researches are carried out to develop new methods in order to consume less energy. In this paper, we present a multi-objective genetic algorithm (MO-GA) that optimizes the energy consumption, CO2 emissions and the generated profit of a geographically distributed cloud computing infrastructure. We also propose a greedy heuristic that aims to maximize the number of scheduled applications in order to compare it with the MO-GA. The two approaches have been experimented using realistic workload traces from Feitelson's PWA Parallel Workload Archive. The results show that MO-GA outperforms the greedy heuristic by a significant margin in terms of energy consumption and CO2 emissions. In addition, MO-GA is also proved to be slightly better in terms of profit while scheduling more applications

A Pareto-based Metaheuristic for Scheduling HPC Applications on a Geographically Distributed Cloud Federation

International audienceReducing energy consumption is an increasingly important issue in cloud computing, more specif- ically when dealing with High Performance Comput- ing (HPC). Minimizing energy consumption can signif- icantly reduce the amount of energy bills and then in- crease the provider's profit. In addition, the reduction of energy decreases greenhouse gas emissions. Therefore, many researches are carried out to develop new methods in order to make HPC applications consuming less energy. In this paper, we present a multi-objective genetic algorithm (MO-GA) that optimizes the energy consumption, CO2 emissions and the generated profit of a geographically distributed cloud computing infrastructure. We also propose a greedy heuristic that aims to maximize the number of scheduled applications in order to compare it with the MO-GA. The two approaches have been experimented using realistic workload traces from Feitelson's PWA Parallel Workload Archive. The results show that MO-GA outperforms the greedy heuristic by a significant margin in terms of energy consumption and CO2 emissions. In addition, MO-GA is also proved to be slightly better in terms of profit while scheduling more applications