{"title":"一种期限满意度增强的工作流调度算法","authors":"Xi Li, Zhi-gang Hu, Chaokun Yan","doi":"10.1109/PDP.2011.29","DOIUrl":null,"url":null,"abstract":"Meeting users' deadline constraint is usually the most important goal of workflow scheduling in Grid environment. In order to consider the dynamism of Grid resource, we adopted a stochastic model to describe dynamic workloads of Grid resources. A concept called Deadline Satisfaction Degree of Workflow (DSDW) was defined to represent the probability that a workflow could be completed before its deadline. We calculated task execution priorities based on their precedence relations in the workflow, then determined the candidate resource for each task so as to maximize DSDW, finally converted distribution problem of overall workflow deadline into a nonlinear programming problem with constraints and resolved it with known solutions. A Deadline Satisfaction Enhanced Scheduling Algorithm for Workflow (DSESAW) involving deadline distribution and resource selection was presented. The extensive simulation experiments using a practical medical image analysis application was conducted to verify our algorithm. Experimental results indicated that our algorithm could adapt to dynamic Grid environment and provide a good guarantee for user's deadline requirements.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Deadline Satisfaction Enhanced Workflow Scheduling Algorithm\",\"authors\":\"Xi Li, Zhi-gang Hu, Chaokun Yan\",\"doi\":\"10.1109/PDP.2011.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Meeting users' deadline constraint is usually the most important goal of workflow scheduling in Grid environment. In order to consider the dynamism of Grid resource, we adopted a stochastic model to describe dynamic workloads of Grid resources. A concept called Deadline Satisfaction Degree of Workflow (DSDW) was defined to represent the probability that a workflow could be completed before its deadline. We calculated task execution priorities based on their precedence relations in the workflow, then determined the candidate resource for each task so as to maximize DSDW, finally converted distribution problem of overall workflow deadline into a nonlinear programming problem with constraints and resolved it with known solutions. A Deadline Satisfaction Enhanced Scheduling Algorithm for Workflow (DSESAW) involving deadline distribution and resource selection was presented. The extensive simulation experiments using a practical medical image analysis application was conducted to verify our algorithm. Experimental results indicated that our algorithm could adapt to dynamic Grid environment and provide a good guarantee for user's deadline requirements.\",\"PeriodicalId\":341803,\"journal\":{\"name\":\"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-02-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDP.2011.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2011.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Deadline Satisfaction Enhanced Workflow Scheduling Algorithm
Meeting users' deadline constraint is usually the most important goal of workflow scheduling in Grid environment. In order to consider the dynamism of Grid resource, we adopted a stochastic model to describe dynamic workloads of Grid resources. A concept called Deadline Satisfaction Degree of Workflow (DSDW) was defined to represent the probability that a workflow could be completed before its deadline. We calculated task execution priorities based on their precedence relations in the workflow, then determined the candidate resource for each task so as to maximize DSDW, finally converted distribution problem of overall workflow deadline into a nonlinear programming problem with constraints and resolved it with known solutions. A Deadline Satisfaction Enhanced Scheduling Algorithm for Workflow (DSESAW) involving deadline distribution and resource selection was presented. The extensive simulation experiments using a practical medical image analysis application was conducted to verify our algorithm. Experimental results indicated that our algorithm could adapt to dynamic Grid environment and provide a good guarantee for user's deadline requirements.