基于动态肖像和任务资源匹配的自适应云资源配额方案

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zuodong Jin;Dan Tao;Peng Qi;Ruipeng Gao
{"title":"基于动态肖像和任务资源匹配的自适应云资源配额方案","authors":"Zuodong Jin;Dan Tao;Peng Qi;Ruipeng Gao","doi":"10.1109/TCC.2024.3410390","DOIUrl":null,"url":null,"abstract":"Due to the unrestricted location of cloud resources, an increasing number of users are opting to apply for them. However, determining the appropriate resource quota has always been a challenge for applicants. Excessive quotas can result in resource wastage, while insufficient quotas can pose stability risks. Therefore, it's necessary to propose an adaptive quota scheme for cloud resource. Most existing researches have designed fixed quota schemes for all users, without considering the differences among users. To solve this, we propose an adaptive cloud quota scheme through dynamic portraits and task-resource optimal matching. Specifically, we first aggregate information from text, statistical, and fractal three dimensions to establish dynamic portraits. On this basis, the bidirectional mixture of experts (Bi-MoE) model is designed to match the most suitable resource combinations for tasks. Moreover, we define the time-varying rewards and utilize portrait-based reinforcement learning (PRL) to obtain the optimal quotas, which ensures stability and reduces waste. Extensive simulation results demonstrate that the proposed scheme achieves a memory utilization rate of around 70%. Additionally, it shows improvements in task execution stability, throughput, and the percentage of effective execution time.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"12 4","pages":"996-1010"},"PeriodicalIF":5.3000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Adaptive Cloud Resource Quota Scheme Based on Dynamic Portraits and Task-Resource Matching\",\"authors\":\"Zuodong Jin;Dan Tao;Peng Qi;Ruipeng Gao\",\"doi\":\"10.1109/TCC.2024.3410390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the unrestricted location of cloud resources, an increasing number of users are opting to apply for them. However, determining the appropriate resource quota has always been a challenge for applicants. Excessive quotas can result in resource wastage, while insufficient quotas can pose stability risks. Therefore, it's necessary to propose an adaptive quota scheme for cloud resource. Most existing researches have designed fixed quota schemes for all users, without considering the differences among users. To solve this, we propose an adaptive cloud quota scheme through dynamic portraits and task-resource optimal matching. Specifically, we first aggregate information from text, statistical, and fractal three dimensions to establish dynamic portraits. On this basis, the bidirectional mixture of experts (Bi-MoE) model is designed to match the most suitable resource combinations for tasks. Moreover, we define the time-varying rewards and utilize portrait-based reinforcement learning (PRL) to obtain the optimal quotas, which ensures stability and reduces waste. Extensive simulation results demonstrate that the proposed scheme achieves a memory utilization rate of around 70%. Additionally, it shows improvements in task execution stability, throughput, and the percentage of effective execution time.\",\"PeriodicalId\":13202,\"journal\":{\"name\":\"IEEE Transactions on Cloud Computing\",\"volume\":\"12 4\",\"pages\":\"996-1010\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Cloud Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10553279/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10553279/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

由于云资源的位置不受限制,越来越多的用户选择申请云资源。然而,确定适当的资源配额对申请人来说一直是一个挑战。配额过多会造成资源浪费,配额不足会带来稳定性风险。因此,有必要提出一种云资源自适应配额方案。现有的研究大多为所有用户设计了固定的配额方案,没有考虑用户之间的差异。为了解决这个问题,我们提出了一种通过动态画像和任务资源最优匹配的自适应云配额方案。具体而言,我们首先从文本、统计和分形三个维度汇总信息,建立动态画像。在此基础上,设计双向混合专家(Bi-MoE)模型,匹配最适合任务的资源组合。此外,我们定义了时变奖励,并利用基于肖像的强化学习(PRL)来获得最优配额,保证了稳定性并减少了浪费。大量的仿真结果表明,该方案的内存利用率约为70%。此外,它还显示了任务执行稳定性、吞吐量和有效执行时间百分比方面的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Adaptive Cloud Resource Quota Scheme Based on Dynamic Portraits and Task-Resource Matching
Due to the unrestricted location of cloud resources, an increasing number of users are opting to apply for them. However, determining the appropriate resource quota has always been a challenge for applicants. Excessive quotas can result in resource wastage, while insufficient quotas can pose stability risks. Therefore, it's necessary to propose an adaptive quota scheme for cloud resource. Most existing researches have designed fixed quota schemes for all users, without considering the differences among users. To solve this, we propose an adaptive cloud quota scheme through dynamic portraits and task-resource optimal matching. Specifically, we first aggregate information from text, statistical, and fractal three dimensions to establish dynamic portraits. On this basis, the bidirectional mixture of experts (Bi-MoE) model is designed to match the most suitable resource combinations for tasks. Moreover, we define the time-varying rewards and utilize portrait-based reinforcement learning (PRL) to obtain the optimal quotas, which ensures stability and reduces waste. Extensive simulation results demonstrate that the proposed scheme achieves a memory utilization rate of around 70%. Additionally, it shows improvements in task execution stability, throughput, and the percentage of effective execution time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信