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

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