Abstract
With the blooming of cloud computing, the demand for data centers has been rising greatly in recent years. Their energy consumption and environmental impact has become much more significant due to the continuous growth of data center supply. It is possible to reduce the amount of energy consumed by a data center by shutting down unnecessary servers and maintaining only a subset running, such that it is enough to fulfill the resource demand. With recent advances in virtualization technology, it even became possible to consolidate the workload of multiple under-utilized servers into a single server. However, too aggressive consolidation may lead to significant degradation of data center performance. Therefore, the problem of simultaneously minimizing energy consumption and performance degradation in a data center is a complex and challenging problem. In this paper, a novel multi-objective Boolean optimization encoding for virtual machine consolidation is proposed and several approaches to solve it are described and compared. Moreover, this encoding is extended to consider anti-collocation constraints and the migration of virtual machines that are initially placed. This work is in part motivated by the great improvements in the performance of Boolean optimization solvers, thus increasing their applicability and effectiveness for a wider spectrum of complex problems. In this case, specific techniques are applied to further boost the performance, namely search space reduction by symmetry breaking and heuristic reduction of the instance size. An extensive experimental evaluation shows the suitability of the proposed solution in comparison to the state-of-the-art approaches based on stochastic methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.