基于期限约束负载均衡水平的成本优化工作流调度

Sobhan Omranian-Khorasani, Mahmoud Naghibzadeh
{"title":"基于期限约束负载均衡水平的成本优化工作流调度","authors":"Sobhan Omranian-Khorasani, Mahmoud Naghibzadeh","doi":"10.1109/CIAPP.2017.8167191","DOIUrl":null,"url":null,"abstract":"The advent of Cloud computing has provided a promising methodology for usage of distributed resources for complex scientific workflow applications. Due to the unique features of cloud technology, such as the pay-as-you-go pricing model and scaling, efficient workflow scheduling is a critical research topic. While most workflow scheduling algorithms are proposed to minimize the overall execution time, cost-driven public cloud services have made cost minimization an emerging and critical issue. Therefore, the objective of this work is to solve the cost optimization problem for scheduling workflows on a commercial Cloud while considering a user-defined deadline constraint. In this paper, a heuristic algorithm for scheduling deadline-constrained workflows is presented — Deadline Constrained Level Based (DCLB)-which uses Level Load Balancing to refine deadline distribution as well as attaining lower communication cost in order to reach the algorithm's goals. Experimental results demonstrate that DCLB compared to existing algorithms, achieves higher cost efficiencies when workflow deadline is met.","PeriodicalId":187056,"journal":{"name":"2017 2nd IEEE International Conference on Computational Intelligence and Applications (ICCIA)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Deadline constrained load balancing level based workflow scheduling for cost optimization\",\"authors\":\"Sobhan Omranian-Khorasani, Mahmoud Naghibzadeh\",\"doi\":\"10.1109/CIAPP.2017.8167191\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The advent of Cloud computing has provided a promising methodology for usage of distributed resources for complex scientific workflow applications. Due to the unique features of cloud technology, such as the pay-as-you-go pricing model and scaling, efficient workflow scheduling is a critical research topic. While most workflow scheduling algorithms are proposed to minimize the overall execution time, cost-driven public cloud services have made cost minimization an emerging and critical issue. Therefore, the objective of this work is to solve the cost optimization problem for scheduling workflows on a commercial Cloud while considering a user-defined deadline constraint. In this paper, a heuristic algorithm for scheduling deadline-constrained workflows is presented — Deadline Constrained Level Based (DCLB)-which uses Level Load Balancing to refine deadline distribution as well as attaining lower communication cost in order to reach the algorithm's goals. Experimental results demonstrate that DCLB compared to existing algorithms, achieves higher cost efficiencies when workflow deadline is met.\",\"PeriodicalId\":187056,\"journal\":{\"name\":\"2017 2nd IEEE International Conference on Computational Intelligence and Applications (ICCIA)\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 2nd IEEE International Conference on Computational Intelligence and Applications (ICCIA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIAPP.2017.8167191\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 2nd IEEE International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIAPP.2017.8167191","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

云计算的出现为复杂的科学工作流应用程序使用分布式资源提供了一种很有前途的方法。由于云技术的独特特性,如按需付费的定价模式和可扩展性,高效的工作流调度是一个关键的研究课题。虽然大多数工作流调度算法都是为了最小化总体执行时间而提出的,但成本驱动的公共云服务使成本最小化成为一个新兴的关键问题。因此,本工作的目标是在考虑用户自定义期限约束的情况下,解决商业云上调度工作流的成本优化问题。本文提出了一种启发式的基于限期约束的工作流调度算法——限期约束级别调度算法(DCLB),该算法利用级别负载平衡来优化限期分配,并获得较低的通信成本,以达到算法的目标。实验结果表明,与现有算法相比,DCLB算法在满足工作流截止日期的情况下具有更高的成本效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deadline constrained load balancing level based workflow scheduling for cost optimization
The advent of Cloud computing has provided a promising methodology for usage of distributed resources for complex scientific workflow applications. Due to the unique features of cloud technology, such as the pay-as-you-go pricing model and scaling, efficient workflow scheduling is a critical research topic. While most workflow scheduling algorithms are proposed to minimize the overall execution time, cost-driven public cloud services have made cost minimization an emerging and critical issue. Therefore, the objective of this work is to solve the cost optimization problem for scheduling workflows on a commercial Cloud while considering a user-defined deadline constraint. In this paper, a heuristic algorithm for scheduling deadline-constrained workflows is presented — Deadline Constrained Level Based (DCLB)-which uses Level Load Balancing to refine deadline distribution as well as attaining lower communication cost in order to reach the algorithm's goals. Experimental results demonstrate that DCLB compared to existing algorithms, achieves higher cost efficiencies when workflow deadline is met.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信