云系统中数据密集型工作流应用的正向负载感知调度

M. Kumar, Indrajeet Gupta, P. K. Jana
{"title":"云系统中数据密集型工作流应用的正向负载感知调度","authors":"M. Kumar, Indrajeet Gupta, P. K. Jana","doi":"10.1109/ICIT.2016.030","DOIUrl":null,"url":null,"abstract":"Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Forward Load Aware Scheduling for Data-Intensive Workflow Applications in Cloud System\",\"authors\":\"M. Kumar, Indrajeet Gupta, P. K. Jana\",\"doi\":\"10.1109/ICIT.2016.030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.\",\"PeriodicalId\":220153,\"journal\":{\"name\":\"2016 International Conference on Information Technology (ICIT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Information Technology (ICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2016.030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Information Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2016.030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

科学工作流程和其他大型复杂问题得益于用于处理、存储和通信的云基础设施。工作流调度是一个众所周知的np完全问题。本文针对云环境下的工作流应用,提出了一种负载均衡调度技术。该算法分为两个阶段。在第一阶段,以自下而上的方式计算所有任务的优先级,而虚拟机的选择和调度在第二阶段进行。该技术还考虑在当前任务节点执行后立即执行的总体负载。我们将模拟结果与称为异构最早完成时间(HEFT)的基准调度启发式方法以及所提出技术的一种变体进行了比较。所有的仿真都是使用基准的科学工作流应用程序完成的。我们表明,我们提出的方法显着显示性能指标,即最大完工时间的最小化和平均云利用率的最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Forward Load Aware Scheduling for Data-Intensive Workflow Applications in Cloud System
Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信