Facial reconstruction

Search LJMU Research Online

Browse Repository | Browse E-Theses

Comparison of workload consolidation algorithms for cloud data centers

Ponto, R, Kecskemeti, G and Mann, ZA (2021) Comparison of workload consolidation algorithms for cloud data centers. Concurrency and Computation: Practice and Experience, 33 (9). ISSN 1532-0626

[img] Text
vmcons-compare.pdf - Accepted Version
Restricted to Repository staff only

Download (595kB)
Concurrency and Computation - 2021 - Ponto - Comparison of workload consolidation algorithms for cloud data centers.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (1MB) | Preview


Workload consolidation is an important method for the efficient operation of cloud data centers, impacting important quality attributes like resource utilization and power consumption. Many different approaches have been proposed for workload consolidation, but few comparative studies were executed to date. Therefore, it is unclear which of the proposed approaches work best in which situation. In this paper we present a comprehensive simulation-based comparison of five workload consolidation techniques. We introduce a general framework for workload consolidation techniques to the DISSECT-CF simulator to foster the development and comparison of efficient data-center consolidation algorithms. We use this framework to evaluate the effectiveness of a first fit best fit decreasing heuristic, a custom heuristic, and three population-based metaheuristics (genetic algorithm, artificial bee colony, and particle swarm optimization). The evaluation is based on a wide variety of real-world workload traces. The five algorithms are compared in terms of total energy consumption, the duration of the simulation, and the number of migrations. Based on the results, there is no generally best consolidation technique. The results deliver insight into the pros and cons of the algorithms as well as the impact of different parameters. In particular, the results show that population-based metaheuristics do not offer a significant gain in terms of solution quality to compensate for the increased simulation time.

Item Type: Article
Uncontrolled Keywords: 0801 Artificial Intelligence and Image Processing, 0803 Computer Software, 0805 Distributed Computing
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Divisions: Computer Science & Mathematics
Publisher: Wiley
Date Deposited: 04 Dec 2020 11:11
Last Modified: 06 Jan 2022 13:45
URI: https://researchonline.ljmu.ac.uk/id/eprint/14132
View Item View Item