Energy-saving scheduling on IaaS HPC cloud environments based on a multi-objective genetic algorithm
| Autor: | Fernando Guirado, Fernando Cores, Josep L. Lérida, Sergi Vila |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
020203 distributed computing
Computer science business.industry Distributed computing Workload Cloud computing 02 engineering and technology Energy consumption computer.software_genre Virtualization Theoretical Computer Science Shared resource Scheduling (computing) Idle Elasticity (cloud computing) Hardware and Architecture Virtual machine 0202 electrical engineering electronic engineering information engineering business computer Software Information Systems |
| Zdroj: | The Journal of Supercomputing. 75:1483-1495 |
| ISSN: | 1573-0484 0920-8542 |
| DOI: | 10.1007/s11227-018-2668-z |
| Popis: | Nowadays, cloud computing is a growing scenario applied to many scientific and manufacturing areas due to its flexibility for adapting to highly demanding computing requirements. The advantages of pay-as-you-go model, elasticity, and the flexibility and customization offered by virtualization make cloud computing an attractive option for meeting the needs of some high-performance computing (HPC) users. However, in this environment, the inherent resources heterogeneity, the virtual machine resource sharing, and the HPC-agnostic cloud schedulers are some bottlenecks for effective HPC in cloud. Furthermore, the energy factor has added another layer of complexity in the task scheduling because of the necessity of maximizing the resources utilization and reducing their idle states. In such a complex infrastructure, the scheduling process that allocates the user parallel tasks, represented by cloudlets, to the virtual machines becomes the focus not only to reduce the job execution times, but also to deal with the energy-performance trade-off. In this work, we propose a multi-objective genetic algorithm to determine the most suitable allocation of cloudlets to the available virtual machines. This innovative approach is able to generate scheduling decisions evading systematic allocations and providing new chances for the remaining cloudlets to be scheduled in order to reduce the whole execution time and also the energy consumption. We validated our proposal using real workload traces from HPC environments and compared the results with well-known algorithms from the literature. The obtained results showed that our proposal achieves lower execution times and minimum energy consumption compared with other classic algorithms from the literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink