云数据中心虚拟机重调度的可扩展和高效强化学习

IF 5.9 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Xianzhong Ding;Yunkai Zhang;Binbin Chen;Donghao Ying;Tieying Zhang;Jianjun Chen;Lei Zhang;Alberto Cerpa;Wan Du
{"title":"云数据中心虚拟机重调度的可扩展和高效强化学习","authors":"Xianzhong Ding;Yunkai Zhang;Binbin Chen;Donghao Ying;Tieying Zhang;Jianjun Chen;Lei Zhang;Alberto Cerpa;Wan Du","doi":"10.1109/TPDS.2026.3674891","DOIUrl":null,"url":null,"abstract":"Managing a vast number of virtual machines (VMs) efficiently is a critical challenge in modern large-scale data centers. The continuous creation and termination of VMs lead to resource fragmentation across physical machines (PMs), necessitating periodic VM rescheduling to optimize resource utilization. Despite its significance, VM rescheduling has received limited attention in the literature. A key challenge is that, unlike conventional combinatorial optimization problems, the efficiency of rescheduling algorithms is heavily impacted by inference time, as VM states evolve dynamically during execution. This scalability bottleneck hampers existing methods. To address this, we propose VMR<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>L, a reinforcement learning framework tailored for VM rescheduling. VMR<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>L integrates a two-stage decision-making process to accommodate complex operational constraints, a feature extraction mechanism that captures critical relational information for rescheduling, and a risk-aware evaluation strategy that enables users to balance execution speed and rescheduling accuracy. Extensive experiments using real-world data from a production-scale data center demonstrate that VMR<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>L achieves near-optimal performance while reducing inference time to a matter of seconds.","PeriodicalId":13257,"journal":{"name":"IEEE Transactions on Parallel and Distributed Systems","volume":"37 5","pages":"1186-1204"},"PeriodicalIF":5.9000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scalable and Efficient Reinforcement Learning for Virtual Machine Rescheduling in Cloud Data Centers\",\"authors\":\"Xianzhong Ding;Yunkai Zhang;Binbin Chen;Donghao Ying;Tieying Zhang;Jianjun Chen;Lei Zhang;Alberto Cerpa;Wan Du\",\"doi\":\"10.1109/TPDS.2026.3674891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Managing a vast number of virtual machines (VMs) efficiently is a critical challenge in modern large-scale data centers. The continuous creation and termination of VMs lead to resource fragmentation across physical machines (PMs), necessitating periodic VM rescheduling to optimize resource utilization. Despite its significance, VM rescheduling has received limited attention in the literature. A key challenge is that, unlike conventional combinatorial optimization problems, the efficiency of rescheduling algorithms is heavily impacted by inference time, as VM states evolve dynamically during execution. This scalability bottleneck hampers existing methods. To address this, we propose VMR<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>L, a reinforcement learning framework tailored for VM rescheduling. VMR<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>L integrates a two-stage decision-making process to accommodate complex operational constraints, a feature extraction mechanism that captures critical relational information for rescheduling, and a risk-aware evaluation strategy that enables users to balance execution speed and rescheduling accuracy. Extensive experiments using real-world data from a production-scale data center demonstrate that VMR<inline-formula><tex-math>$^{2}$</tex-math></inline-formula>L achieves near-optimal performance while reducing inference time to a matter of seconds.\",\"PeriodicalId\":13257,\"journal\":{\"name\":\"IEEE Transactions on Parallel and Distributed Systems\",\"volume\":\"37 5\",\"pages\":\"1186-1204\"},\"PeriodicalIF\":5.9000,\"publicationDate\":\"2026-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Parallel and Distributed Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11440117/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/3/18 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Parallel and Distributed Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11440117/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/3/18 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

高效地管理大量虚拟机(vm)是现代大型数据中心面临的一个关键挑战。由于虚拟机的不断创建和终止,会导致物理机之间的资源碎片化,需要定期对虚拟机进行重新调度,以优化资源利用。尽管具有重要意义,但VM重调度在文献中受到的关注有限。一个关键的挑战是,与传统的组合优化问题不同,重调度算法的效率受到推理时间的严重影响,因为VM状态在执行过程中是动态演变的。这种可伸缩性瓶颈阻碍了现有的方法。为了解决这个问题,我们提出了VMR$^{2}$L,这是一个为VM重新调度量身定制的强化学习框架。VMR$^{2}$L集成了一个两阶段的决策过程,以适应复杂的操作约束,一个特征提取机制,捕获重调度的关键关系信息,以及一个风险感知评估策略,使用户能够平衡执行速度和重调度准确性。使用来自生产规模数据中心的真实数据进行的大量实验表明,VMR$^{2}$L在将推理时间缩短到几秒钟的同时实现了近乎最佳的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scalable and Efficient Reinforcement Learning for Virtual Machine Rescheduling in Cloud Data Centers
Managing a vast number of virtual machines (VMs) efficiently is a critical challenge in modern large-scale data centers. The continuous creation and termination of VMs lead to resource fragmentation across physical machines (PMs), necessitating periodic VM rescheduling to optimize resource utilization. Despite its significance, VM rescheduling has received limited attention in the literature. A key challenge is that, unlike conventional combinatorial optimization problems, the efficiency of rescheduling algorithms is heavily impacted by inference time, as VM states evolve dynamically during execution. This scalability bottleneck hampers existing methods. To address this, we propose VMR$^{2}$L, a reinforcement learning framework tailored for VM rescheduling. VMR$^{2}$L integrates a two-stage decision-making process to accommodate complex operational constraints, a feature extraction mechanism that captures critical relational information for rescheduling, and a risk-aware evaluation strategy that enables users to balance execution speed and rescheduling accuracy. Extensive experiments using real-world data from a production-scale data center demonstrate that VMR$^{2}$L achieves near-optimal performance while reducing inference time to a matter of seconds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems 工程技术-工程:电子与电气
CiteScore
11.00
自引率
9.40%
发文量
281
审稿时长
5.6 months
期刊介绍: IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to: a) Parallel and distributed algorithms, focusing on topics such as: models of computation; numerical, combinatorial, and data-intensive parallel algorithms, scalability of algorithms and data structures for parallel and distributed systems, communication and synchronization protocols, network algorithms, scheduling, and load balancing. b) Applications of parallel and distributed computing, including computational and data-enabled science and engineering, big data applications, parallel crowd sourcing, large-scale social network analysis, management of big data, cloud and grid computing, scientific and biomedical applications, mobile computing, and cyber-physical systems. c) Parallel and distributed architectures, including architectures for instruction-level and thread-level parallelism; design, analysis, implementation, fault resilience and performance measurements of multiple-processor systems; multicore processors, heterogeneous many-core systems; petascale and exascale systems designs; novel big data architectures; special purpose architectures, including graphics processors, signal processors, network processors, media accelerators, and other special purpose processors and accelerators; impact of technology on architecture; network and interconnect architectures; parallel I/O and storage systems; architecture of the memory hierarchy; power-efficient and green computing architectures; dependable architectures; and performance modeling and evaluation. d) Parallel and distributed software, including parallel and multicore programming languages and compilers, runtime systems, operating systems, Internet computing and web services, resource management including green computing, middleware for grids, clouds, and data centers, libraries, performance modeling and evaluation, parallel programming paradigms, and programming environments and tools.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书