云计算中工作流调度的改进MIN-MIN算法

Gifty Gupta, N. Mangla
{"title":"云计算中工作流调度的改进MIN-MIN算法","authors":"Gifty Gupta, N. Mangla","doi":"10.1109/ICAC3N56670.2022.10074016","DOIUrl":null,"url":null,"abstract":"In Cloud Computing environment, scheduling of Cloudlets and resource allocation of Cloudlets are two major issues that need to be considered. To improve the system performance, it is necessary that the Cloudlets scheduled on the resources available must be efficiently executed. For scientific applications, workflow scheduling is a significant issue. To handle this issue, a new mechanism called Enhanced Min-Min (E-Min-Min) is introduced inspired by the Min-Min algorithm. This scheduling algorithm not only schedules the jobs according to their completion time but considers the data transfer time too with equal priority and makes an aggregated function for scheduling of jobs to the best suitable resources. During the scheduling process, the main focus is on the minimization of Makespan, maximize the resource utilization and load balance level and also minimize the cost of scheduling. Workflow scientific applications such as Montage, Cybershake, InSpiral, SIPHT are considered. In workflow the tasks are represented as nodes and their dependencies represents the relationships among them. WorkflowSim simulator with Net Beans IDE is used to create the simulation environment and the results are validated over it. The proposed algorithm shows the better results as compared with the basic Min-Min and Modified Min-Min algorithm.","PeriodicalId":342573,"journal":{"name":"2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Enhanced MIN-MIN algorithm for workflow scheduling in Cloud Computing\",\"authors\":\"Gifty Gupta, N. Mangla\",\"doi\":\"10.1109/ICAC3N56670.2022.10074016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Cloud Computing environment, scheduling of Cloudlets and resource allocation of Cloudlets are two major issues that need to be considered. To improve the system performance, it is necessary that the Cloudlets scheduled on the resources available must be efficiently executed. For scientific applications, workflow scheduling is a significant issue. To handle this issue, a new mechanism called Enhanced Min-Min (E-Min-Min) is introduced inspired by the Min-Min algorithm. This scheduling algorithm not only schedules the jobs according to their completion time but considers the data transfer time too with equal priority and makes an aggregated function for scheduling of jobs to the best suitable resources. During the scheduling process, the main focus is on the minimization of Makespan, maximize the resource utilization and load balance level and also minimize the cost of scheduling. Workflow scientific applications such as Montage, Cybershake, InSpiral, SIPHT are considered. In workflow the tasks are represented as nodes and their dependencies represents the relationships among them. WorkflowSim simulator with Net Beans IDE is used to create the simulation environment and the results are validated over it. The proposed algorithm shows the better results as compared with the basic Min-Min and Modified Min-Min algorithm.\",\"PeriodicalId\":342573,\"journal\":{\"name\":\"2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAC3N56670.2022.10074016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAC3N56670.2022.10074016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在云计算环境中,Cloudlets的调度和资源分配是需要考虑的两个主要问题。为了提高系统性能,必须有效地执行调度在可用资源上的Cloudlets。在科学应用中,工作流调度是一个重要的问题。为了解决这个问题,受Min-Min算法的启发,引入了一种名为增强Min-Min (E-Min-Min)的新机制。该调度算法不仅根据作业的完成时间对作业进行调度,而且以同等优先级考虑数据传输时间,并通过聚合函数将作业调度到最合适的资源上。在调度过程中,主要关注的是最小化Makespan,最大化资源利用率和负载平衡水平,最小化调度成本。工作流科学应用程序,如蒙太奇,Cybershake, InSpiral, SIPHT被考虑。在工作流中,任务被表示为节点,它们的依赖关系表示它们之间的关系。使用Net Beans IDE的WorkflowSim模拟器创建仿真环境,并在其上验证结果。与基本Min-Min算法和改进Min-Min算法相比,该算法取得了较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Enhanced MIN-MIN algorithm for workflow scheduling in Cloud Computing
In Cloud Computing environment, scheduling of Cloudlets and resource allocation of Cloudlets are two major issues that need to be considered. To improve the system performance, it is necessary that the Cloudlets scheduled on the resources available must be efficiently executed. For scientific applications, workflow scheduling is a significant issue. To handle this issue, a new mechanism called Enhanced Min-Min (E-Min-Min) is introduced inspired by the Min-Min algorithm. This scheduling algorithm not only schedules the jobs according to their completion time but considers the data transfer time too with equal priority and makes an aggregated function for scheduling of jobs to the best suitable resources. During the scheduling process, the main focus is on the minimization of Makespan, maximize the resource utilization and load balance level and also minimize the cost of scheduling. Workflow scientific applications such as Montage, Cybershake, InSpiral, SIPHT are considered. In workflow the tasks are represented as nodes and their dependencies represents the relationships among them. WorkflowSim simulator with Net Beans IDE is used to create the simulation environment and the results are validated over it. The proposed algorithm shows the better results as compared with the basic Min-Min and Modified Min-Min algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信