Shuaibu Yau Auna, Faruku Umar Ambursa, Abdulhakeem Ibrahim
{"title":"云环境下一种改进的Max-min工作流调度算法","authors":"Shuaibu Yau Auna, Faruku Umar Ambursa, Abdulhakeem Ibrahim","doi":"10.1109/ICECCO48375.2019.9043295","DOIUrl":null,"url":null,"abstract":"In cloud computing, Service rendering is achieved through virtualization and the use of very large scalable resources where users access services by paying for the share of resources used by them. Several workflow scheduling techniques have been proposed for efficient scheduling. Max-min approach is prominent among them, its features includes efficiency and the ability to guarantee optimal or near optimal solution because of its heuristic nature. Several enhancement to its functionalities have been proposed in the literature and works are still ongoing for improving it. This paper proposed a solution by minimizing total execution time where workflow tasks length are invariably considered before proper scheduling. Our proposed work is compared with standard Max-Min scheduling scheme. The proposed scheme outperforms the standard scheme; two realistic scientific workflows were used as test data for the simulation.","PeriodicalId":166322,"journal":{"name":"2019 15th International Conference on Electronics, Computer and Computation (ICECCO)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Modified Max-min Workflow Scheduling Algorithm for Cloud Environment\",\"authors\":\"Shuaibu Yau Auna, Faruku Umar Ambursa, Abdulhakeem Ibrahim\",\"doi\":\"10.1109/ICECCO48375.2019.9043295\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cloud computing, Service rendering is achieved through virtualization and the use of very large scalable resources where users access services by paying for the share of resources used by them. Several workflow scheduling techniques have been proposed for efficient scheduling. Max-min approach is prominent among them, its features includes efficiency and the ability to guarantee optimal or near optimal solution because of its heuristic nature. Several enhancement to its functionalities have been proposed in the literature and works are still ongoing for improving it. This paper proposed a solution by minimizing total execution time where workflow tasks length are invariably considered before proper scheduling. Our proposed work is compared with standard Max-Min scheduling scheme. The proposed scheme outperforms the standard scheme; two realistic scientific workflows were used as test data for the simulation.\",\"PeriodicalId\":166322,\"journal\":{\"name\":\"2019 15th International Conference on Electronics, Computer and Computation (ICECCO)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Conference on Electronics, Computer and Computation (ICECCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECCO48375.2019.9043295\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Electronics, Computer and Computation (ICECCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCO48375.2019.9043295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Modified Max-min Workflow Scheduling Algorithm for Cloud Environment
In cloud computing, Service rendering is achieved through virtualization and the use of very large scalable resources where users access services by paying for the share of resources used by them. Several workflow scheduling techniques have been proposed for efficient scheduling. Max-min approach is prominent among them, its features includes efficiency and the ability to guarantee optimal or near optimal solution because of its heuristic nature. Several enhancement to its functionalities have been proposed in the literature and works are still ongoing for improving it. This paper proposed a solution by minimizing total execution time where workflow tasks length are invariably considered before proper scheduling. Our proposed work is compared with standard Max-Min scheduling scheme. The proposed scheme outperforms the standard scheme; two realistic scientific workflows were used as test data for the simulation.