Manchester Metropolitan University's Research Repository

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

    Peake, J, Amos, M, Costen, N ORCID logoORCID: https://orcid.org/0000-0001-9454-8840, Masala, G and Lloyd, H ORCID logoORCID: https://orcid.org/0000-0001-6537-4036 (2022) PACO-VMP: Parallel Ant Colony Optimization for Virtual Machine Placement. Future Generation Computer Systems: the international journal of grid computing: theory, methods and applications, 129. pp. 174-186. ISSN 0167-739X

    Accepted Version
    Download (2MB) | Preview


    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.

    Impact and Reach


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics for this dataset are available via IRStats2.


    Repository staff only

    Edit record Edit record