TSPSO: Enhanced Task Scheduling using Optimized Particle Swarm Algorithm in Cloud Computing Environment

Swarnendra Kumar Behera, Saroja Kumar Rout, R. Tiwari
{"title":"TSPSO: Enhanced Task Scheduling using Optimized Particle Swarm Algorithm in Cloud Computing Environment","authors":"Swarnendra Kumar Behera, Saroja Kumar Rout, R. Tiwari","doi":"10.1109/APSIT58554.2023.10201736","DOIUrl":null,"url":null,"abstract":"The most significant constraint in cloud computing infrastructure is job/task scheduling which affords the vital role of efficiency of the entire cloud computing services and offerings. Job/ task scheduling in cloud infrastructure means that to assign the best appropriate cloud resources for the given job/task by considering different factors: execution time and cost, infrastructure scalability and reliability, platform availability and throughput, resource utilization, and make span. The proposed enhanced task scheduling algorithm using particle swarm optimization considers the optimization of makes pan and scheduling time. We propose the proposed model by using dynamic adjustment of parameters with discrete positioning (DAPDP) based algorithm to schedule and allocate cloud jobs/tasks that ensure optimized makes pan and scheduling time. DAPDP can witness a substantial role in attaining reliability by seeing the available, scheduled, and allocated cloud resources. Our approach DAPDP compared with other existing particle swarm and optimization job/task scheduling algorithms to prove that DAPDP can save in makes pan, scheduling, and execution time.","PeriodicalId":170044,"journal":{"name":"2023 International Conference in Advances in Power, Signal, and Information Technology (APSIT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference in Advances in Power, Signal, and Information Technology (APSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSIT58554.2023.10201736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The most significant constraint in cloud computing infrastructure is job/task scheduling which affords the vital role of efficiency of the entire cloud computing services and offerings. Job/ task scheduling in cloud infrastructure means that to assign the best appropriate cloud resources for the given job/task by considering different factors: execution time and cost, infrastructure scalability and reliability, platform availability and throughput, resource utilization, and make span. The proposed enhanced task scheduling algorithm using particle swarm optimization considers the optimization of makes pan and scheduling time. We propose the proposed model by using dynamic adjustment of parameters with discrete positioning (DAPDP) based algorithm to schedule and allocate cloud jobs/tasks that ensure optimized makes pan and scheduling time. DAPDP can witness a substantial role in attaining reliability by seeing the available, scheduled, and allocated cloud resources. Our approach DAPDP compared with other existing particle swarm and optimization job/task scheduling algorithms to prove that DAPDP can save in makes pan, scheduling, and execution time.
基于优化粒子群算法的云计算环境下增强任务调度
云计算基础设施中最重要的约束是作业/任务调度,它对整个云计算服务和产品的效率起着至关重要的作用。云基础设施中的作业/任务调度是指通过考虑执行时间和成本、基础设施可扩展性和可靠性、平台可用性和吞吐量、资源利用率和make span等不同因素,为给定的作业/任务分配最合适的云资源。提出了一种基于粒子群优化的增强任务调度算法,该算法考虑了调度目标和调度时间的优化。我们提出了采用基于离散定位(DAPDP)算法的参数动态调整来调度和分配云作业/任务的模型,以确保优化的制作盘和调度时间。通过查看可用的、计划的和分配的云资源,DAPDP可以在实现可靠性方面发挥重要作用。将该方法与现有的粒子群算法和优化作业/任务调度算法进行比较,证明了该方法可以节省调度时间、调度时间和执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信