{"title":"基于资源组合可靠性的网格工作流调度","authors":"Guozhong Tian, Jiong Yu","doi":"10.1109/ICNC.2008.234","DOIUrl":null,"url":null,"abstract":"To the time-constrained workflow scheduling in grids, this paper proposes a new scheduling algorithm in terms of the finite-state continuous-time Markov process through selecting a resource combination scheme which has the lowest expenditure under the certain credit level of the resource reliability on the critical path in the DAG-based workflow. The simulation shows the validity of theory analysis.","PeriodicalId":6404,"journal":{"name":"2008 Fourth International Conference on Natural Computation","volume":"64 1","pages":"207-211"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Grid Workflow Scheduling Based on the Resource Combination Reliability\",\"authors\":\"Guozhong Tian, Jiong Yu\",\"doi\":\"10.1109/ICNC.2008.234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To the time-constrained workflow scheduling in grids, this paper proposes a new scheduling algorithm in terms of the finite-state continuous-time Markov process through selecting a resource combination scheme which has the lowest expenditure under the certain credit level of the resource reliability on the critical path in the DAG-based workflow. The simulation shows the validity of theory analysis.\",\"PeriodicalId\":6404,\"journal\":{\"name\":\"2008 Fourth International Conference on Natural Computation\",\"volume\":\"64 1\",\"pages\":\"207-211\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2008.234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2008.234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Grid Workflow Scheduling Based on the Resource Combination Reliability
To the time-constrained workflow scheduling in grids, this paper proposes a new scheduling algorithm in terms of the finite-state continuous-time Markov process through selecting a resource combination scheme which has the lowest expenditure under the certain credit level of the resource reliability on the critical path in the DAG-based workflow. The simulation shows the validity of theory analysis.