Advanced cost-aware Max–Min workflow tasks allocation and scheduling in cloud computing systems

Mostafa Raeisi-Varzaneh, Omar Dakkak, Yousef Fazea, Mohammed Golam Kaosar
{"title":"Advanced cost-aware Max–Min workflow tasks allocation and scheduling in cloud computing systems","authors":"Mostafa Raeisi-Varzaneh, Omar Dakkak, Yousef Fazea, Mohammed Golam Kaosar","doi":"10.1007/s10586-024-04594-1","DOIUrl":null,"url":null,"abstract":"<p>Cloud computing has emerged as an efficient distribution platform in modern distributed computing offering scalability and flexibility. Task scheduling is considered as one of the main crucial aspects of cloud computing. The primary purpose of the task scheduling mechanism is to reduce the cost and makespan and determine which virtual machine (VM) needs to be selected to execute the task. It is widely acknowledged as a nondeterministic polynomial-time complete problem, necessitating the development of an efficient solution. This paper presents an innovative approach to task scheduling and allocation within cloud computing systems. Our focus lies on improving both the efficiency and cost-effectiveness of task execution, with a specific emphasis on optimizing makespan and resource utilization. This is achieved through the introduction of an Advanced Max–Min Algorithm, which builds upon traditional methodologies to significantly enhance performance metrics such as makespan, waiting time, and resource utilization. The selection of the Max–Min algorithm is rooted in its ability to strike a balance between task execution time and resource utilization, making it a suitable candidate for addressing the challenges of cloud task scheduling. Furthermore, a key contribution of this work is the integration of a cost-aware algorithm into the scheduling framework. This algorithm enables the effective management of task execution costs, ensuring alignment with user requirements while operating within the constraints of cloud service providers. The proposed method adjusts task allocation based on cost considerations dynamically. Additionally, the presented approach enhances the overall economic efficiency of cloud computing deployments. The findings demonstrate that the proposed Advanced Max–Min Algorithm outperforms the traditional Max–Min, Min–Min, and SJF algorithms with respect to makespan, waiting time, and resource utilization.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10586-024-04594-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing has emerged as an efficient distribution platform in modern distributed computing offering scalability and flexibility. Task scheduling is considered as one of the main crucial aspects of cloud computing. The primary purpose of the task scheduling mechanism is to reduce the cost and makespan and determine which virtual machine (VM) needs to be selected to execute the task. It is widely acknowledged as a nondeterministic polynomial-time complete problem, necessitating the development of an efficient solution. This paper presents an innovative approach to task scheduling and allocation within cloud computing systems. Our focus lies on improving both the efficiency and cost-effectiveness of task execution, with a specific emphasis on optimizing makespan and resource utilization. This is achieved through the introduction of an Advanced Max–Min Algorithm, which builds upon traditional methodologies to significantly enhance performance metrics such as makespan, waiting time, and resource utilization. The selection of the Max–Min algorithm is rooted in its ability to strike a balance between task execution time and resource utilization, making it a suitable candidate for addressing the challenges of cloud task scheduling. Furthermore, a key contribution of this work is the integration of a cost-aware algorithm into the scheduling framework. This algorithm enables the effective management of task execution costs, ensuring alignment with user requirements while operating within the constraints of cloud service providers. The proposed method adjusts task allocation based on cost considerations dynamically. Additionally, the presented approach enhances the overall economic efficiency of cloud computing deployments. The findings demonstrate that the proposed Advanced Max–Min Algorithm outperforms the traditional Max–Min, Min–Min, and SJF algorithms with respect to makespan, waiting time, and resource utilization.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云计算系统中先进的成本感知最大最小工作流任务分配与调度
在现代分布式计算中,云计算已成为一种高效的分配平台,具有可扩展性和灵活性。任务调度被认为是云计算的主要关键方面之一。任务调度机制的主要目的是降低成本和时间跨度,并确定需要选择哪台虚拟机(VM)来执行任务。人们普遍认为这是一个非确定性多项式时间完整问题,因此有必要开发一种高效的解决方案。本文提出了一种在云计算系统中进行任务调度和分配的创新方法。我们的重点是提高任务执行的效率和成本效益,特别强调优化时间跨度和资源利用率。这是通过引入先进的最大最小算法来实现的,该算法建立在传统方法的基础上,能显著提高任务间距、等待时间和资源利用率等性能指标。之所以选择 Max-Min 算法,是因为该算法能够在任务执行时间和资源利用率之间取得平衡,使其成为应对云任务调度挑战的合适候选算法。此外,这项工作的一个重要贡献是在调度框架中集成了成本感知算法。该算法能够有效管理任务执行成本,确保符合用户需求,同时在云服务提供商的约束条件下运行。所提出的方法可根据成本因素动态调整任务分配。此外,所提出的方法还能提高云计算部署的整体经济效益。研究结果表明,在时间跨度、等待时间和资源利用率方面,所提出的高级最大最小算法优于传统的最大最小算法、最小最小算法和 SJF 算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantitative and qualitative similarity measure for data clustering analysis OntoXAI: a semantic web rule language approach for explainable artificial intelligence Multi-threshold image segmentation using a boosted whale optimization: case study of breast invasive ductal carcinomas PSO-ACO-based bi-phase lightweight intrusion detection system combined with GA optimized ensemble classifiers A scalable and power efficient MAC protocol with adaptive TDMA for M2M communication
×
引用
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