Resource auto-scaling for SQL-like queries in the cloud based on parallel reinforcement learning

Mohamed Mehdi Kandi, Shaoyi Yin, A. Hameurlain
{"title":"Resource auto-scaling for SQL-like queries in the cloud based on parallel reinforcement learning","authors":"Mohamed Mehdi Kandi, Shaoyi Yin, A. Hameurlain","doi":"10.1504/IJGUC.2019.102748","DOIUrl":null,"url":null,"abstract":"Cloud computing is a technology that provides on-demand services in which the number of assigned resources can be automatically adjusted. A key challenge is how to choose the right number of resources so that the overall monetary cost is minimised. This problem, known as auto-scaling, was addressed in some existing works but most of them are dedicated to web applications. In these applications, it is assumed that the queries are atomic and each of them uses a single resource for a short period of time. However, this assumption cannot be considered for database applications. A query, in this case, contains many dependent and long tasks so several resources are required. We propose in this work an auto-scaling method based on reinforcement learning. The method is coupled with placement-scheduling. In the experimental section, we show the advantage of coupling the auto-scaling to the placement-scheduling by comparing our work to an existing auto-scaling method.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Grid Util. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJGUC.2019.102748","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cloud computing is a technology that provides on-demand services in which the number of assigned resources can be automatically adjusted. A key challenge is how to choose the right number of resources so that the overall monetary cost is minimised. This problem, known as auto-scaling, was addressed in some existing works but most of them are dedicated to web applications. In these applications, it is assumed that the queries are atomic and each of them uses a single resource for a short period of time. However, this assumption cannot be considered for database applications. A query, in this case, contains many dependent and long tasks so several resources are required. We propose in this work an auto-scaling method based on reinforcement learning. The method is coupled with placement-scheduling. In the experimental section, we show the advantage of coupling the auto-scaling to the placement-scheduling by comparing our work to an existing auto-scaling method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于并行强化学习的云中类sql查询的资源自动伸缩
云计算是一种提供按需服务的技术,其中分配的资源数量可以自动调整。一个关键的挑战是如何选择正确数量的资源,从而使总体货币成本最小化。这个被称为自动缩放的问题已经在一些现有的作品中得到了解决,但大多数都是针对web应用程序的。在这些应用程序中,假设查询是原子的,并且每个查询在短时间内使用单个资源。但是,对于数据库应用程序不能考虑这种假设。在这种情况下,查询包含许多依赖的长任务,因此需要多个资源。我们在这项工作中提出了一种基于强化学习的自动缩放方法。该方法与安置调度相结合。在实验部分,通过将我们的工作与现有的自动缩放方法进行比较,我们展示了将自动缩放与放置调度相结合的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Resource consumption trade-off for reducing hotspot migration in modern data centres Method for determining cloth simulation filtering threshold value based on curvature value of fitting curve An agent-based mechanism to form cloud federations and manage their requirements changes K-means clustering algorithm for data distribution in cloud computing environment FastGarble: an optimised garbled circuit construction framework
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1