.png){kind=icon}
返回
Virtual machine placement strategy using cluster-based genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2020.06.120.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of virtual machine (VM) live migration in self-driving systems targets reallocating resources among VMs running different self-driving services for load balance. It is of great importance to enable a running VM to be moved to another physical machine (host) seamlessly. Due to the nature of self-driving applications, it is important to select an optimal set of hosts to place VMs within an interactive time. The VM placement problem can be formalized as a bin packing problem, which is proved to be NP-hard. To solve the problem, we develop a cluster-based genetic algorithm that outputs an approximation result of the bin pack problem. In particular, our proposed algorithm clusters the population of current generation and selects individuals from different groups with reduced crossover operations. The number of crossover operations is directly related to the algorithm efficiency. We use the run-time features to evaluate the preference of VMs on hardware resources, which is utilized to generate initial solutions and avoid overload. Experimental results show that our approach is able to outperform the tradition genetic algorithm regarding both accuracy and efficiency. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Virtual machine
Live migration
Bin packing
Genetic algorithm
Cluster algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Gridded population mapping for Germany based on building density, height and type from Earth Observation data using census disaggregation and bottom-up estimates.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容