Multiobjective Prioritized Workflow Scheduling in Cloud Computing Using Cuckoo Search Algorithm

IF 1.8 4区 计算机科学 Q3 ENGINEERING, BIOMEDICAL Applied Bionics and Biomechanics Pub Date : 2023-07-07 DOI:10.1155/2023/4350615
Babuli Sahu, S. K. Swain, S. Mangalampalli, Satyasis Mishra
{"title":"Multiobjective Prioritized Workflow Scheduling in Cloud Computing Using Cuckoo Search Algorithm","authors":"Babuli Sahu, S. K. Swain, S. Mangalampalli, Satyasis Mishra","doi":"10.1155/2023/4350615","DOIUrl":null,"url":null,"abstract":"Effective workflow scheduling in cloud computing is still a challenging problem as incoming workflows to cloud console having variable task processing capacities and dependencies as they will arise from various heterogeneous resources. Ineffective scheduling of workflows to virtual resources in cloud environment leads to violations in service level agreements and high energy consumption, which impacts the quality of service of cloud provider. Many existing authors developed workflow scheduling algorithms addressing operational costs and makespan, but still, there is a provision to improve the scheduling process in cloud paradigm as it is an nondeterministic polynomial-hard problem. Therefore, in this research, a task-prioritized multiobjective workflow scheduling algorithm was developed by using cuckoo search algorithm to precisely map incoming workflows onto corresponding virtual resources. Extensive simulations were carried out on workflowsim using randomly generated workflows from simulator. For evaluating the efficacy of our proposed approach, we compared our proposed scheduling algorithm with existing approaches, i.e., Max–Min, first come first serve, minimum completion time, Min–Min, resource allocation security with efficient task scheduling in cloud computing-hybrid machine learning, and Round Robin. Our proposed approach is outperformed by minimizing energy consumption by 15% and reducing service level agreement violations by 22%.","PeriodicalId":8029,"journal":{"name":"Applied Bionics and Biomechanics","volume":" ","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Bionics and Biomechanics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1155/2023/4350615","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, BIOMEDICAL","Score":null,"Total":0}
引用次数: 0

Abstract

Effective workflow scheduling in cloud computing is still a challenging problem as incoming workflows to cloud console having variable task processing capacities and dependencies as they will arise from various heterogeneous resources. Ineffective scheduling of workflows to virtual resources in cloud environment leads to violations in service level agreements and high energy consumption, which impacts the quality of service of cloud provider. Many existing authors developed workflow scheduling algorithms addressing operational costs and makespan, but still, there is a provision to improve the scheduling process in cloud paradigm as it is an nondeterministic polynomial-hard problem. Therefore, in this research, a task-prioritized multiobjective workflow scheduling algorithm was developed by using cuckoo search algorithm to precisely map incoming workflows onto corresponding virtual resources. Extensive simulations were carried out on workflowsim using randomly generated workflows from simulator. For evaluating the efficacy of our proposed approach, we compared our proposed scheduling algorithm with existing approaches, i.e., Max–Min, first come first serve, minimum completion time, Min–Min, resource allocation security with efficient task scheduling in cloud computing-hybrid machine learning, and Round Robin. Our proposed approach is outperformed by minimizing energy consumption by 15% and reducing service level agreement violations by 22%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于Cuckoo搜索算法的云计算多目标优先级工作流调度
云计算中的有效工作流调度仍然是一个具有挑战性的问题,因为云控制台的传入工作流具有可变的任务处理能力和依赖性,因为它们将来自各种异构资源。云环境中对虚拟资源的工作流调度无效,导致违反服务级别协议和高能耗,从而影响云提供商的服务质量。许多现有的作者开发了解决运营成本和完工时间的工作流调度算法,但由于这是一个不确定的多项式难题,因此仍然有改进云范式中调度过程的规定。因此,在本研究中,利用杜鹃搜索算法开发了一种任务优先的多目标工作流调度算法,将传入的工作流精确映射到相应的虚拟资源上。使用模拟器随机生成的工作流在workflowsim上进行了广泛的模拟。为了评估我们提出的方法的有效性,我们将我们提出的调度算法与现有方法进行了比较,即Max–Min、先到先得、最小完成时间、Min–Min,云计算混合机器学习中具有高效任务调度的资源分配安全性,以及Round Robin。我们提出的方法的性能优于将能耗降低15%和将违反服务级别协议的行为减少22%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Bionics and Biomechanics
Applied Bionics and Biomechanics ENGINEERING, BIOMEDICAL-ROBOTICS
自引率
4.50%
发文量
338
审稿时长
>12 weeks
期刊介绍: Applied Bionics and Biomechanics publishes papers that seek to understand the mechanics of biological systems, or that use the functions of living organisms as inspiration for the design new devices. Such systems may be used as artificial replacements, or aids, for their original biological purpose, or be used in a different setting altogether.
期刊最新文献
Real-Time Gait Intention Recognition for Active Control of Unilateral Knee Exoskeleton. Design and Control of an Upper Limb Bionic Exoskeleton Rehabilitation Device Based on Tensegrity Structure. The Effect of Different Degrees of Ankle Dorsiflexion Restriction on the Biomechanics of the Lower Extremity in Stop-Jumping. Evaluation of Cyclic Fatigue Resistance of Novel Replica-Like Instruments in Static Test Model. UCH-L1 Inhibitor Alleviates Nerve Damage Caused by Moyamoya Disease.
×
引用
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