Zuoxian Nie, Xin-hua Jiang, Jian-cheng Liu, Hai-yan Yang
{"title":"广义格式良好工作流实例的完成时间估计","authors":"Zuoxian Nie, Xin-hua Jiang, Jian-cheng Liu, Hai-yan Yang","doi":"10.1109/ISPA.2009.43","DOIUrl":null,"url":null,"abstract":"Completion time estimation for workflow instances is an important basis for real time workflow management and scheduling. Current researches on this topic omitted the fact that: instances of workflow that contains OR-SPLIT are certain to bypass some activities, thus at a particular time point, estimation of completion time for workflow instances should be based merely on activities that were already visited by it and are possible to be visited by it in the future. Firstly, rules were proposed to build reachable subnets for workflow instances. Subsequently, the complex problem of completion time estimation for generalized well-formed reachable subnet was decomposed to simpler ones for potential instance subgraphs, which were computed based on active transition performance equivalent model. Lastly, an example was given to demonstrate the process of completion time estimation for generalized well-formed workflow instances.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"246 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Completion Time Estimation for Instances of Generalized Well-Formed Workflow\",\"authors\":\"Zuoxian Nie, Xin-hua Jiang, Jian-cheng Liu, Hai-yan Yang\",\"doi\":\"10.1109/ISPA.2009.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Completion time estimation for workflow instances is an important basis for real time workflow management and scheduling. Current researches on this topic omitted the fact that: instances of workflow that contains OR-SPLIT are certain to bypass some activities, thus at a particular time point, estimation of completion time for workflow instances should be based merely on activities that were already visited by it and are possible to be visited by it in the future. Firstly, rules were proposed to build reachable subnets for workflow instances. Subsequently, the complex problem of completion time estimation for generalized well-formed reachable subnet was decomposed to simpler ones for potential instance subgraphs, which were computed based on active transition performance equivalent model. Lastly, an example was given to demonstrate the process of completion time estimation for generalized well-formed workflow instances.\",\"PeriodicalId\":346815,\"journal\":{\"name\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"volume\":\"246 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2009.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2009.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Completion Time Estimation for Instances of Generalized Well-Formed Workflow
Completion time estimation for workflow instances is an important basis for real time workflow management and scheduling. Current researches on this topic omitted the fact that: instances of workflow that contains OR-SPLIT are certain to bypass some activities, thus at a particular time point, estimation of completion time for workflow instances should be based merely on activities that were already visited by it and are possible to be visited by it in the future. Firstly, rules were proposed to build reachable subnets for workflow instances. Subsequently, the complex problem of completion time estimation for generalized well-formed reachable subnet was decomposed to simpler ones for potential instance subgraphs, which were computed based on active transition performance equivalent model. Lastly, an example was given to demonstrate the process of completion time estimation for generalized well-formed workflow instances.