Minimizing Task Completion Time in the Cloud based on Random Neural Network

Yu Wang, Wu Tongtong
{"title":"Minimizing Task Completion Time in the Cloud based on Random Neural Network","authors":"Yu Wang, Wu Tongtong","doi":"10.1109/CBFD52659.2021.00019","DOIUrl":null,"url":null,"abstract":"With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments.","PeriodicalId":230625,"journal":{"name":"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CBFD52659.2021.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于随机神经网络的云中任务完成时间最小化
随着物联网和5G的发展,接入互联网的设备数量每天都在增加。虽然移动边缘计算有效地减轻了云中心的压力,但云中心仍然面临着大量SaaS应用的任务调度和资源分配的挑战。本文通过简化的排队模型推导了任务平均完成时间最小化的条件,并结合随机神经网络提出了一种基于在线测量的任务平均完成时间最小化的自适应动态调度算法,该算法占用的资源和计算量很小。作为分析算法性能的一种方式,在许多不同的环境中测试了各种各样的算法。仿真结果表明,该算法能有效地缩短各种环境下的平均任务完成时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An infrared dim and small target image preprocessing algorithm based on improved bilateral filtering A systematic Analysis: Molecular Information in viral Disease using Deep Learning Auto Encoder Double-Triplet-Pseudo-Siamese Architecture For Remote Sensing Aircraft Target Recognition Improvement of Internal Control of Anti Money Laundering in State-owned Enterprises Based on Evolutionary Game Analysis Forecast on Shanghai Composite Index linked with Investor Sentiment Effect
×
引用
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