科研成果详情

题名Dynamic Consolidation Based on Kth-Order Markov Model for Virtual Machines
作者
发表日期2020
会议录名称EAI/Springer Innovations in Communication and Computing
ISSN2522-8595
页码21-31
摘要The rapid development of cloud computing technology has led to a high level of energy consumption. The central processing unit (CPU) of the data center and other resources often use less than half the rate; therefore, if the work of the virtual machine is focused on part of the server, and the idle server switches to low power mode, the power consumption of the data center can be greatly reduced. Traditional research into virtual machine consolidation is mainly based on the high load threshold of the current host load setting or periodically migrates, and the present study made predictions based on the timing of problems of lower prediction accuracy faced. To solve these problems, we consider the impact of the multi-order Markov model and the CPU state at different times, and propose a new hybrid sequence K Markov model for the next period of time of the host CPU load forecasting. Owing to the large-scale data experiment on the CloudSim simulation platform, the host load forecasting method proposed in this paper is compared with the traditional load detection method to verify that the proposed model has a large reduction in the number of virtual machine migrations and amount of data center energy consumption, and the violation of the service level agreement (SLA) is also at an acceptable level.
关键词Cloud computing Dynamic virtual machine integration Hybrid Markov model
DOI10.1007/978-3-030-17763-8_3
URL查看来源
语种英语English
Scopus入藏号2-s2.0-85134329679
引用统计
文献类型会议论文
条目标识符https://repository.uic.edu.cn/handle/39GCC9TT/12869
专题个人在本单位外知识产出
通讯作者Jiang,Na
作者单位
Zhaotong University,Zhaotong,China
推荐引用方式
GB/T 7714
Jiang,Na. Dynamic Consolidation Based on Kth-Order Markov Model for Virtual Machines[C], 2020: 21-31.
条目包含的文件
条目无相关文件。
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Jiang,Na]的文章
百度学术
百度学术中相似的文章
[Jiang,Na]的文章
必应学术
必应学术中相似的文章
[Jiang,Na]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。