Skip to main content
Kent Academic Repository

PACO-VMP: Parallel Ant Colony Optimization for Virtual Machine Placement

Peake, Joshua, Amos, Martyn, Costen, Nicholas, Masala, Giovanni, Lloyd, Huw (2022) PACO-VMP: Parallel Ant Colony Optimization for Virtual Machine Placement. Future Generation Computer Systems, 129 . pp. 174-186. ISSN 0167-739X. (doi:10.1016/j.future.2021.11.019) (KAR id:93038)

Abstract

The Virtual Machine Placement (VMP) problem is a challenging optimization task that involves the assignment of virtual machines to physical machines in a cloud computing environment. The placement of virtual machines can significantly affect the use of resources in a cluster, with a subsequent impact on operational costs and the environment. In this paper, we present an improved algorithm for VMP, based on Parallel Ant Colony Optimization (PACO), which makes effective use of parallelization techniques and modern processor technologies. We achieve solution qualities that are comparable with or superior to those obtained by other nature-inspired methods, with our parallel implementation obtaining a speed-up of up to 2002x over recent serial algorithms in the literature. This allows us to rapidly find high-quality solutions that are close to the theoretical minimum number of Virtual Machines.

Item Type: Article
DOI/Identification number: 10.1016/j.future.2021.11.019
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Giovanni Masala
Date Deposited: 03 Feb 2022 16:27 UTC
Last Modified: 05 Dec 2022 00:00 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/93038 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.