使用进化算法为云计算调度工作流

M. Kaya, Betül Boz
{"title":"使用进化算法为云计算调度工作流","authors":"M. Kaya, Betül Boz","doi":"10.24012/dumf.1335981","DOIUrl":null,"url":null,"abstract":"Cloud computing provides powerful, highly scalable, flexible resources for real world applications. It also reduces the cost and operation expenses. Workflow scheduling is important for getting higher performance, reducing cost and using resources more efficiently in cloud computing. Workflow scheduling in cloud systems assigns tasks to resources available in the system and aims to utilize cloud resources by decreasing makespan of the workflow. In this study, an evolutionary algorithm is proposed to solve workflow scheduling problem. The main objective of this work is to minimize the makespan of the schedule. To achieve this goal, problem specific crossover operator and mutation operators are proposed in the evolutionary algorithm. The crossover operator will combine the problem-specific information stored in both parents to create a new individual. The mutation operators will explore neighbor solutions using some intelligent search mechanisms. This unique design of the operators increases the diversity of the search space and the quality of the solutions. As a result, the workflow schedules obtained from the evolutionary algorithm decreases the makespan of the workflow in the cloud system. The performance of the proposed study is measured using well-known scientific workflows and is compared with the algorithms from the literature. The proposed study outperforms all related algorithms in 67% of the test cases and obtains the same results in the remaining test cases.","PeriodicalId":158576,"journal":{"name":"DÜMF Mühendislik Dergisi","volume":"28 25","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bulut Hesaplama İçin Evrimsel Algoritma Kullanarak İş Akışı Planlaması\",\"authors\":\"M. Kaya, Betül Boz\",\"doi\":\"10.24012/dumf.1335981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing provides powerful, highly scalable, flexible resources for real world applications. It also reduces the cost and operation expenses. Workflow scheduling is important for getting higher performance, reducing cost and using resources more efficiently in cloud computing. Workflow scheduling in cloud systems assigns tasks to resources available in the system and aims to utilize cloud resources by decreasing makespan of the workflow. In this study, an evolutionary algorithm is proposed to solve workflow scheduling problem. The main objective of this work is to minimize the makespan of the schedule. To achieve this goal, problem specific crossover operator and mutation operators are proposed in the evolutionary algorithm. The crossover operator will combine the problem-specific information stored in both parents to create a new individual. The mutation operators will explore neighbor solutions using some intelligent search mechanisms. This unique design of the operators increases the diversity of the search space and the quality of the solutions. As a result, the workflow schedules obtained from the evolutionary algorithm decreases the makespan of the workflow in the cloud system. The performance of the proposed study is measured using well-known scientific workflows and is compared with the algorithms from the literature. The proposed study outperforms all related algorithms in 67% of the test cases and obtains the same results in the remaining test cases.\",\"PeriodicalId\":158576,\"journal\":{\"name\":\"DÜMF Mühendislik Dergisi\",\"volume\":\"28 25\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DÜMF Mühendislik Dergisi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24012/dumf.1335981\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DÜMF Mühendislik Dergisi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24012/dumf.1335981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

云计算为现实世界的应用提供了强大、高度可扩展、灵活的资源。它还能降低成本和运营费用。在云计算中,工作流调度对于提高性能、降低成本和更有效地利用资源非常重要。云系统中的工作流调度将任务分配给系统中的可用资源,旨在通过减少工作流的时间跨度来利用云资源。本研究提出了一种进化算法来解决工作流调度问题。这项工作的主要目标是最大限度地减少调度的时间跨度。为实现这一目标,在进化算法中提出了针对具体问题的交叉算子和突变算子。交叉算子将结合存储在双亲中的特定问题信息来创建新个体。变异算子将利用一些智能搜索机制探索相邻的解决方案。这种独特的算子设计提高了搜索空间的多样性和解决方案的质量。因此,从进化算法中获得的工作流程时间表降低了云系统中工作流程的时间跨度。我们利用著名的科学工作流测量了所提研究的性能,并与文献中的算法进行了比较。在 67% 的测试用例中,拟议研究的性能优于所有相关算法,在其余测试用例中也取得了相同的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bulut Hesaplama İçin Evrimsel Algoritma Kullanarak İş Akışı Planlaması
Cloud computing provides powerful, highly scalable, flexible resources for real world applications. It also reduces the cost and operation expenses. Workflow scheduling is important for getting higher performance, reducing cost and using resources more efficiently in cloud computing. Workflow scheduling in cloud systems assigns tasks to resources available in the system and aims to utilize cloud resources by decreasing makespan of the workflow. In this study, an evolutionary algorithm is proposed to solve workflow scheduling problem. The main objective of this work is to minimize the makespan of the schedule. To achieve this goal, problem specific crossover operator and mutation operators are proposed in the evolutionary algorithm. The crossover operator will combine the problem-specific information stored in both parents to create a new individual. The mutation operators will explore neighbor solutions using some intelligent search mechanisms. This unique design of the operators increases the diversity of the search space and the quality of the solutions. As a result, the workflow schedules obtained from the evolutionary algorithm decreases the makespan of the workflow in the cloud system. The performance of the proposed study is measured using well-known scientific workflows and is compared with the algorithms from the literature. The proposed study outperforms all related algorithms in 67% of the test cases and obtains the same results in the remaining test cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信