{"title":"云系统中数据密集型工作流应用的正向负载感知调度","authors":"M. Kumar, Indrajeet Gupta, P. K. Jana","doi":"10.1109/ICIT.2016.030","DOIUrl":null,"url":null,"abstract":"Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Forward Load Aware Scheduling for Data-Intensive Workflow Applications in Cloud System\",\"authors\":\"M. Kumar, Indrajeet Gupta, P. K. Jana\",\"doi\":\"10.1109/ICIT.2016.030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.\",\"PeriodicalId\":220153,\"journal\":{\"name\":\"2016 International Conference on Information Technology (ICIT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Information Technology (ICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2016.030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Information Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2016.030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Forward Load Aware Scheduling for Data-Intensive Workflow Applications in Cloud System
Scientific workflows and other large complex problems are benefited from cloud infrastructure for processing, storage and communication. Workflow scheduling is recognized as a well-known NP-complete problem. In this paper, we propose a load-balanced scheduling technique for workflow applications in a cloud environment. The proposed algorithm works in two phases. In the first phase, priorities of all the tasks are calculated in bottom up fashion while virtual machine selection and scheduling take place in the second phase. This technique also considers the overall load to be executed immediately after the execution of current task node. We compare the simulated results with the benchmark scheduling heuristic named as heterogeneous earliest finish time (HEFT) and a variation of the proposed technique. All the simulations are done by using the benchmark scientific workflow applications. We show that our proposed method remarkably display the performance metrics i.e., minimization in makespan and maximization in average cloud utilization.