.png){kind=icon}
返回
PACO-VMP: Parallel Ant Colony Optimization for Virtual Machine Placement
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2021.11.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Virtual Machine Placement
Ant Colony Optimization
Swarm intelligence
Parallel MAX-MIN Ant System
Parallel Ant Colony Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容