An Indicator-Based Algorithm for Task Scheduling in Multi-Cloud Environments

S. K. Pande, Priyanka Swain, S. K. Nayak, S. K. Panda
{"title":"An Indicator-Based Algorithm for Task Scheduling in Multi-Cloud Environments","authors":"S. K. Pande, Priyanka Swain, S. K. Nayak, S. K. Panda","doi":"10.4018/ijcac.308274","DOIUrl":null,"url":null,"abstract":"Cloud computing is the ability to scale various resources and services that can be dynamically configured by the cloud service provider (CSP) and delivered on demand by the customers. The objective of most of the task scheduling algorithms is to ensure that the overall processing time of all the tasks (i.e., makespan) is minimized. Here, minimization of makespan in no way guarantees the minimization of execution cost. In indicator-based (IBTS) task scheduling algorithm for the multi-cloud environment, we can outline the significant contributions as the following: (1) IBTS achieves multi-objective solutions while considering parameters, makespan, and execution cost. (2) IBTS proposes a normalization framework with time and cost length indicators for efficient task scheduling. (3) The efficacy of the IBTS algorithm is demonstrated using both the benchmark and synthetic datasets. (4) The simulation outcomes of the IBTS algorithm in comparison with three existing task scheduling algorithms, namely ETBTS, MOTS, and PBTS, clearly exhibit superiority, which proves acceptance of IBTS algorithm.","PeriodicalId":442336,"journal":{"name":"Int. J. Cloud Appl. Comput.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Cloud Appl. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijcac.308274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cloud computing is the ability to scale various resources and services that can be dynamically configured by the cloud service provider (CSP) and delivered on demand by the customers. The objective of most of the task scheduling algorithms is to ensure that the overall processing time of all the tasks (i.e., makespan) is minimized. Here, minimization of makespan in no way guarantees the minimization of execution cost. In indicator-based (IBTS) task scheduling algorithm for the multi-cloud environment, we can outline the significant contributions as the following: (1) IBTS achieves multi-objective solutions while considering parameters, makespan, and execution cost. (2) IBTS proposes a normalization framework with time and cost length indicators for efficient task scheduling. (3) The efficacy of the IBTS algorithm is demonstrated using both the benchmark and synthetic datasets. (4) The simulation outcomes of the IBTS algorithm in comparison with three existing task scheduling algorithms, namely ETBTS, MOTS, and PBTS, clearly exhibit superiority, which proves acceptance of IBTS algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多云环境下基于指标的任务调度算法
云计算是一种扩展各种资源和服务的能力,这些资源和服务可以由云服务提供商(CSP)动态配置,并根据客户的需求交付。大多数任务调度算法的目标是确保所有任务的总体处理时间(即makespan)最小化。在这里,最小化makespan并不能保证最小化执行成本。在多云环境下基于指标(indicator-based, IBTS)的任务调度算法中,我们可以概括如下重要贡献:(1)IBTS在考虑参数、完工时间和执行成本的情况下实现了多目标解决方案。(2) IBTS提出了一种具有时间和成本长度指标的标准化框架,用于高效的任务调度。(3)利用基准数据集和合成数据集验证了IBTS算法的有效性。(4)与现有的三种任务调度算法(ETBTS、MOTS和PBTS)相比,IBTS算法的仿真结果显示出明显的优越性,证明了IBTS算法的可接受性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mitigating Risks in the Cloud-Based Metaverse Access Control Strategies and Techniques Using Supervised Learning to Detect Command and Control Attacks in IoT System Level Benchmarking of Public Clouds A Secure Framework to Prevent Three-Tier Cloud Architecture From Malicious Malware Injection Attacks Sociocultural Factors in Times of Global Crisis
×
引用
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