Min-parent: An effective approach to enhance resource utilization in cloud environment

Raj Kumar, Mala Kalra, S. Tanwar, Sudhanshu Tyagi, Neeraj Kumar
{"title":"Min-parent: An effective approach to enhance resource utilization in cloud environment","authors":"Raj Kumar, Mala Kalra, S. Tanwar, Sudhanshu Tyagi, Neeraj Kumar","doi":"10.1109/ICACCA.2016.7578906","DOIUrl":null,"url":null,"abstract":"With the rapid growth in online services and scarcity of professionals under same domain, there is a huge requirement for integaration of services with Cloud Computing (CC). It is a latest technological trend in present arena. It provide an efficient infrastructure, better services over the internet. In CC environment scheduling of services is one of the major issue which can have significant impact on resource utilization and system performance. Work-flow scheduling is a problem of finding the correct execution sequence for assigned work-flow tasks. It plays a vital role in the work-flow management. Proper scheduling of work-flow can have an efficient impact on performance of the system. This paper proposes a scheduling algorithm for work-flows. Key parameters include parent-child relationship, task allocation to available Virtual Machines(VMs) for execution. Proposed algorithm mainly focuses on increasing the resource utilization and reducing the make-span. In proposed algorithm, we create a table that contains ready tasks and their corresponding children in a work-flow, and occurrences of child have been counted. Further, on the basis of child occurrences, this parent-child relationship table is sorted and then used for ready tasks scheduling. The proposed algorithm has been executed and validated by using simulation based analysis through WorkflowSim tool kit. The results of the proposed scheduling algorithm significantly minimizes overall execution time of work-flows.","PeriodicalId":109549,"journal":{"name":"2016 International Conference on Advances in Computing, Communication, & Automation (ICACCA) (Spring)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advances in Computing, Communication, & Automation (ICACCA) (Spring)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACCA.2016.7578906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

With the rapid growth in online services and scarcity of professionals under same domain, there is a huge requirement for integaration of services with Cloud Computing (CC). It is a latest technological trend in present arena. It provide an efficient infrastructure, better services over the internet. In CC environment scheduling of services is one of the major issue which can have significant impact on resource utilization and system performance. Work-flow scheduling is a problem of finding the correct execution sequence for assigned work-flow tasks. It plays a vital role in the work-flow management. Proper scheduling of work-flow can have an efficient impact on performance of the system. This paper proposes a scheduling algorithm for work-flows. Key parameters include parent-child relationship, task allocation to available Virtual Machines(VMs) for execution. Proposed algorithm mainly focuses on increasing the resource utilization and reducing the make-span. In proposed algorithm, we create a table that contains ready tasks and their corresponding children in a work-flow, and occurrences of child have been counted. Further, on the basis of child occurrences, this parent-child relationship table is sorted and then used for ready tasks scheduling. The proposed algorithm has been executed and validated by using simulation based analysis through WorkflowSim tool kit. The results of the proposed scheduling algorithm significantly minimizes overall execution time of work-flows.
Min-parent:云环境下提高资源利用率的有效途径
随着在线服务的快速增长和同一领域专业人才的稀缺,对服务与云计算(CC)的集成有着巨大的需求。这是当今世界最新的技术趋势。它通过互联网提供了高效的基础设施和更好的服务。在CC环境中,服务调度是影响资源利用率和系统性能的主要问题之一。工作流调度是为分配的工作流任务找到正确的执行顺序的问题。它在工作流管理中起着至关重要的作用。适当的工作流调度可以对系统的性能产生有效的影响。提出了一种工作流调度算法。关键参数包括父子关系、任务分配到可用的虚拟机中执行。该算法主要着眼于提高资源利用率和减小制作跨度。在该算法中,我们创建了一个表,其中包含工作流中已完成的任务及其对应的子任务,并统计了子任务的出现次数。此外,在子节点出现的基础上,这个父子关系表被排序,然后用于准备任务调度。通过WorkflowSim工具对该算法进行了仿真分析,验证了算法的有效性。所提出的调度算法的结果显著地减少了工作流的总体执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书