An improved task scheduling and load balancing algorithm under the heterogeneous cloud computing network

M. Chiang, Hui-Ching Hsieh, Weng-Chung Tsai, Ming-Ching Ke
{"title":"An improved task scheduling and load balancing algorithm under the heterogeneous cloud computing network","authors":"M. Chiang, Hui-Ching Hsieh, Weng-Chung Tsai, Ming-Ching Ke","doi":"10.1109/ICAWST.2017.8256465","DOIUrl":null,"url":null,"abstract":"In recent decades, with the rapid development and popularization of Internet and computer technology, cloud computing had become a highly-demanded service due to the advantages of high computing power, cheap cost of services, scalability, accessibility as well as availability. However, a fly in the ointment was that the system is more complex while dispatching variety of tasks to servers. It means that dispatching tasks to the servers is a challenge since there has a large number of heterogeneous servers, core and diverse application services need to cooperate with each other in the cloud computing network. To deal with the huge number of tasks, an appropriate and effective scheduling algorithm is to allocate these tasks to appropriate servers within the minimum completion time, and to achieve the load balancing of workload. Based on the reasons above, a novel dispatching algorithm, called Advanced MaxSufferage algorithm (AMS), is proposed in this paper to improve the dispatching efficiency in the cloud computing network. The main concept of the AMS is to allocate the tasks to server nodes by comparing the SV value, MSV value, and average value of expected completion time of the server nodes between each task. Basically, the AMS algorithm can obtain better task completion time than previous works and can achieve loadbalancing in cloud computing network.","PeriodicalId":378618,"journal":{"name":"2017 IEEE 8th International Conference on Awareness Science and Technology (iCAST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 8th International Conference on Awareness Science and Technology (iCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAWST.2017.8256465","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

Abstract

In recent decades, with the rapid development and popularization of Internet and computer technology, cloud computing had become a highly-demanded service due to the advantages of high computing power, cheap cost of services, scalability, accessibility as well as availability. However, a fly in the ointment was that the system is more complex while dispatching variety of tasks to servers. It means that dispatching tasks to the servers is a challenge since there has a large number of heterogeneous servers, core and diverse application services need to cooperate with each other in the cloud computing network. To deal with the huge number of tasks, an appropriate and effective scheduling algorithm is to allocate these tasks to appropriate servers within the minimum completion time, and to achieve the load balancing of workload. Based on the reasons above, a novel dispatching algorithm, called Advanced MaxSufferage algorithm (AMS), is proposed in this paper to improve the dispatching efficiency in the cloud computing network. The main concept of the AMS is to allocate the tasks to server nodes by comparing the SV value, MSV value, and average value of expected completion time of the server nodes between each task. Basically, the AMS algorithm can obtain better task completion time than previous works and can achieve loadbalancing in cloud computing network.
异构云计算网络下一种改进的任务调度和负载均衡算法
近几十年来,随着互联网和计算机技术的快速发展和普及,云计算以其计算能力强、服务成本低、可扩展性强、可访问性强、可用性好等优势,成为一项备受需求的服务。然而,美中不足的是,在向服务器分派各种任务时,系统更加复杂。这意味着在云计算网络中,由于存在大量异构服务器,核心和各种应用服务需要相互协作,因此向服务器调度任务是一个挑战。为了处理大量的任务,一种合适有效的调度算法是在最短的完成时间内将这些任务分配到合适的服务器上,并实现工作负载的负载均衡。基于以上原因,本文提出了一种新的调度算法——高级最大容忍算法(AMS),以提高云计算网络中的调度效率。AMS的主要概念是通过比较每个任务之间服务器节点的SV值、MSV值和期望完成时间的平均值,将任务分配给服务器节点。基本上,AMS算法可以获得比以往工作更好的任务完成时间,并且可以在云计算网络中实现负载均衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信