A New Modified Max-min Workflow Scheduling Algorithm for Cloud Environment

Shuaibu Yau Auna, Faruku Umar Ambursa, Abdulhakeem Ibrahim
{"title":"A New Modified Max-min Workflow Scheduling Algorithm for Cloud Environment","authors":"Shuaibu Yau Auna, Faruku Umar Ambursa, Abdulhakeem Ibrahim","doi":"10.1109/ICECCO48375.2019.9043295","DOIUrl":null,"url":null,"abstract":"In cloud computing, Service rendering is achieved through virtualization and the use of very large scalable resources where users access services by paying for the share of resources used by them. Several workflow scheduling techniques have been proposed for efficient scheduling. Max-min approach is prominent among them, its features includes efficiency and the ability to guarantee optimal or near optimal solution because of its heuristic nature. Several enhancement to its functionalities have been proposed in the literature and works are still ongoing for improving it. This paper proposed a solution by minimizing total execution time where workflow tasks length are invariably considered before proper scheduling. Our proposed work is compared with standard Max-Min scheduling scheme. The proposed scheme outperforms the standard scheme; two realistic scientific workflows were used as test data for the simulation.","PeriodicalId":166322,"journal":{"name":"2019 15th International Conference on Electronics, Computer and Computation (ICECCO)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Electronics, Computer and Computation (ICECCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCO48375.2019.9043295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In cloud computing, Service rendering is achieved through virtualization and the use of very large scalable resources where users access services by paying for the share of resources used by them. Several workflow scheduling techniques have been proposed for efficient scheduling. Max-min approach is prominent among them, its features includes efficiency and the ability to guarantee optimal or near optimal solution because of its heuristic nature. Several enhancement to its functionalities have been proposed in the literature and works are still ongoing for improving it. This paper proposed a solution by minimizing total execution time where workflow tasks length are invariably considered before proper scheduling. Our proposed work is compared with standard Max-Min scheduling scheme. The proposed scheme outperforms the standard scheme; two realistic scientific workflows were used as test data for the simulation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云环境下一种改进的Max-min工作流调度算法
在云计算中,服务呈现是通过虚拟化和使用非常大的可伸缩资源来实现的,其中用户通过为服务使用的资源份额付费来访问服务。为了实现高效调度,提出了几种工作流调度技术。其中,最大最小法最为突出,由于其启发式的性质,其特点包括效率和保证最优或接近最优解的能力。文献中已经提出了对其功能的一些增强,并且仍在进行改进工作。本文提出了一种最小化总执行时间的解决方案,其中工作流任务长度总是在适当调度之前考虑。并与标准的Max-Min调度方案进行了比较。该方案优于标准方案;采用两个现实的科学工作流程作为测试数据进行仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Investigation into Peer-to-Peer Network Security Using Wireshark Greenhouse Monitoring and Control System with an Arduino System Transfer Learning Based Histopathologic Image Classification for Burns Recognition Modelling And Realization of a Compact CPW Transmission Lines Using 3D Mmics Technology in ADS Momentum Review of Advances in Machine Learning Based Protein Secondary Structure Prediction
×
引用
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