{"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}
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.