Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye
{"title":"网格环境下任务调度的有效机制研究","authors":"Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye","doi":"10.1109/GCC.2006.79","DOIUrl":null,"url":null,"abstract":"This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Research on an Effective Mechanism of Task-scheduling in Grid Environment\",\"authors\":\"Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye\",\"doi\":\"10.1109/GCC.2006.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better\",\"PeriodicalId\":280249,\"journal\":{\"name\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCC.2006.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on an Effective Mechanism of Task-scheduling in Grid Environment
This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better