TRETA - A Novel Heuristic Based Efficient Task Scheduling Algorithm in Cloud Environment

K. Jayasena, K. M. P. Bandaranayake, B. Kumara
{"title":"TRETA - A Novel Heuristic Based Efficient Task Scheduling Algorithm in Cloud Environment","authors":"K. Jayasena, K. M. P. Bandaranayake, B. Kumara","doi":"10.1109/TENCON50793.2020.9293787","DOIUrl":null,"url":null,"abstract":"Cloud computing is a computing platform that allows users to access various kinds of computing services over the internet. Cloud provides on-demand, scalable and highly available resources on pay-per-usage subscriptions. Cloud is an optimum solution for executing a large number of different size tasks as for the computing capability it offers. Task scheduling is one of the major open challenges that need to be addressed. The Task scheduling problem in the cloud is known to be an NP- complete problem. Hence heuristics can be used to get an optimal solution. There have been many heuristics proposed for the task scheduling problem in the cloud. None of them has considered the total execution time of the virtual machine as a factor for finding a better schedule. In this paper, we proposed a new task scheduling algorithm named Total Resource Execution Time Aware Algorithm (TRETA) which takes into account the total execution time of computing resources in obtaining an optimal schedule. The algorithm is compared with Min-Min, Min-Max, FCFS, and MCT heuristics for Makespan, Degree of Imbalance and System Throughput. The proposed algorithm shows a significant amount of improvement in Makespan compared to other heuristics. The algorithm also outperforms other heuristics with respect to System Throughput and Degree of Imbalance which results in better workload distribution among the cloud resources.","PeriodicalId":283131,"journal":{"name":"2020 IEEE REGION 10 CONFERENCE (TENCON)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE REGION 10 CONFERENCE (TENCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON50793.2020.9293787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing is a computing platform that allows users to access various kinds of computing services over the internet. Cloud provides on-demand, scalable and highly available resources on pay-per-usage subscriptions. Cloud is an optimum solution for executing a large number of different size tasks as for the computing capability it offers. Task scheduling is one of the major open challenges that need to be addressed. The Task scheduling problem in the cloud is known to be an NP- complete problem. Hence heuristics can be used to get an optimal solution. There have been many heuristics proposed for the task scheduling problem in the cloud. None of them has considered the total execution time of the virtual machine as a factor for finding a better schedule. In this paper, we proposed a new task scheduling algorithm named Total Resource Execution Time Aware Algorithm (TRETA) which takes into account the total execution time of computing resources in obtaining an optimal schedule. The algorithm is compared with Min-Min, Min-Max, FCFS, and MCT heuristics for Makespan, Degree of Imbalance and System Throughput. The proposed algorithm shows a significant amount of improvement in Makespan compared to other heuristics. The algorithm also outperforms other heuristics with respect to System Throughput and Degree of Imbalance which results in better workload distribution among the cloud resources.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的基于启发式的云环境下高效任务调度算法
云计算是一个允许用户通过互联网访问各种计算服务的计算平台。云提供按需、可扩展和高可用性的按使用付费订阅资源。云是执行大量不同规模任务的最佳解决方案,因为它提供了计算能力。任务调度是需要解决的主要开放挑战之一。云中的任务调度问题是一个NP完全问题。因此,可以使用启发式方法来获得最优解。针对云中的任务调度问题,已经提出了许多启发式算法。它们都没有将虚拟机的总执行时间作为寻找更好调度的一个因素。本文提出了一种新的任务调度算法——总资源执行时间感知算法(Total Resource Execution Time Aware algorithm, TRETA),该算法考虑计算资源的总执行时间来获得最优调度。将该算法与Min-Min、Min-Max、FCFS和MCT启发式算法在Makespan、不平衡度和系统吞吐量方面进行了比较。与其他启发式算法相比,所提出的算法在Makespan方面显示出显著的改进。该算法在系统吞吐量和不平衡程度方面也优于其他启发式算法,从而在云资源之间更好地分配工作负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Non-Intrusive Diabetes Pre-diagnosis using Fingerprint Analysis with Multilayer Perceptron Smart Defect Detection and Sortation through Image Processing for Corn Short-term Unit Commitment Using Advanced Direct Load Control Leukemia Detection Mechanism through Microscopic Image and ML Techniques German Sign Language Translation using 3D Hand Pose Estimation and Deep Learning
×
引用
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