基于多目标可靠性的工作流调度程序:一种基于改进的云环境下花朵授粉算法的弹性和有说服力的任务调度程序

Neha Miglani, Gaurav Sharma, Savita Khurana
{"title":"基于多目标可靠性的工作流调度程序:一种基于改进的云环境下花朵授粉算法的弹性和有说服力的任务调度程序","authors":"Neha Miglani, Gaurav Sharma, Savita Khurana","doi":"10.1002/cpe.7150","DOIUrl":null,"url":null,"abstract":"This research article formulates contemporary approach named multi‐objective reliability‐based workflow scheduler. Numerous strategies have been proposed in the past to prioritize and map the tasks to cloud resources. Though the recent studies lead to efficient solutions however they are restrained in terms of performance due to lack of resource consideration based on utilization rate and reliability index. It is crucial to consider reliability parameter while mapping tasks onto the virtual machines and not just the reliability value, but the cost incurred must also be minimized. To this end, the proposed strategy has been categorized into four modules, (i) scrutiny of reliable VMs, (ii) task ranking, (iii) optimizing the task re‐ordering using flower pollination optimization, and (iv) task mapping onto the VM. It intends to map task onto the most suitable machine in terms of makespan, efficiency, and incurred cost. In the experimental setup, four scientific workflows have been considered namely, LIGO, Genome, Cybershake, and Montage, they have been tested on the proposed approach while making comparison with the existing approaches namely FPA, GWO, and GA. The simulation results justified the claims by allocating resources to the cloudlets efficiently and stabilizing all the aforementioned parameters by attaining performance measures adequately.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"94 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi‐objective reliability‐based workflow scheduler: An elastic and persuasive task scheduler based upon modified‐flower pollination algorithm in cloud environment\",\"authors\":\"Neha Miglani, Gaurav Sharma, Savita Khurana\",\"doi\":\"10.1002/cpe.7150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This research article formulates contemporary approach named multi‐objective reliability‐based workflow scheduler. Numerous strategies have been proposed in the past to prioritize and map the tasks to cloud resources. Though the recent studies lead to efficient solutions however they are restrained in terms of performance due to lack of resource consideration based on utilization rate and reliability index. It is crucial to consider reliability parameter while mapping tasks onto the virtual machines and not just the reliability value, but the cost incurred must also be minimized. To this end, the proposed strategy has been categorized into four modules, (i) scrutiny of reliable VMs, (ii) task ranking, (iii) optimizing the task re‐ordering using flower pollination optimization, and (iv) task mapping onto the VM. It intends to map task onto the most suitable machine in terms of makespan, efficiency, and incurred cost. In the experimental setup, four scientific workflows have been considered namely, LIGO, Genome, Cybershake, and Montage, they have been tested on the proposed approach while making comparison with the existing approaches namely FPA, GWO, and GA. The simulation results justified the claims by allocating resources to the cloudlets efficiently and stabilizing all the aforementioned parameters by attaining performance measures adequately.\",\"PeriodicalId\":10584,\"journal\":{\"name\":\"Concurrency and Computation: Practice and Experience\",\"volume\":\"94 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation: Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/cpe.7150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种基于多目标可靠性的工作流调度方法。过去已经提出了许多策略来确定任务的优先级并将其映射到云资源。目前的研究虽然提出了高效的解决方案,但由于缺乏基于利用率和可靠性指标的资源考虑,在性能上受到制约。在将任务映射到虚拟机时,考虑可靠性参数是至关重要的,不仅要考虑可靠性值,还必须最小化所产生的成本。为此,提出的策略被分为四个模块,(i)可靠VM的审查,(ii)任务排序,(iii)使用花授粉优化优化任务重新排序,以及(iv)任务映射到VM。它的目的是将任务映射到最合适的机器上,在完成时间、效率和产生的成本方面。在实验设置中,考虑了四种科学工作流程,即LIGO, Genome, Cybershake和Montage,它们已经在提议的方法上进行了测试,同时与现有的方法即FPA, GWO和GA进行了比较。仿真结果通过有效地将资源分配给cloudlets,并通过充分获得性能度量来稳定上述所有参数,从而证明了声明的正确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi‐objective reliability‐based workflow scheduler: An elastic and persuasive task scheduler based upon modified‐flower pollination algorithm in cloud environment
This research article formulates contemporary approach named multi‐objective reliability‐based workflow scheduler. Numerous strategies have been proposed in the past to prioritize and map the tasks to cloud resources. Though the recent studies lead to efficient solutions however they are restrained in terms of performance due to lack of resource consideration based on utilization rate and reliability index. It is crucial to consider reliability parameter while mapping tasks onto the virtual machines and not just the reliability value, but the cost incurred must also be minimized. To this end, the proposed strategy has been categorized into four modules, (i) scrutiny of reliable VMs, (ii) task ranking, (iii) optimizing the task re‐ordering using flower pollination optimization, and (iv) task mapping onto the VM. It intends to map task onto the most suitable machine in terms of makespan, efficiency, and incurred cost. In the experimental setup, four scientific workflows have been considered namely, LIGO, Genome, Cybershake, and Montage, they have been tested on the proposed approach while making comparison with the existing approaches namely FPA, GWO, and GA. The simulation results justified the claims by allocating resources to the cloudlets efficiently and stabilizing all the aforementioned parameters by attaining performance measures adequately.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信