DocumentCode :
1863042
Title :
Research on a Dynamic Dispatching Method of Service Grid
Author :
Qin, Kai ; Zhao, Hongwei
Author_Institution :
Sch. of Inf. Eng., ShengYang Univ., Shenyang, China
fYear :
2010
fDate :
9-10 Jan. 2010
Firstpage :
347
Lastpage :
350
Abstract :
Considering the disadvantages of traditional Scheduling algorithm and the characteristics of Grid Service, a Service Grid Scheduling algorithm based on the loading constraint has been designed and implemented. Firstly, a calculation algorithm based on each join points´ loading has been proposed, providing the Formula of algorithm. Secondly, a comprehensive service distribution algorithm has been designed and implemented in consideration of respective service counts, each join points´ performance and current loading distribution. Finally, the result of the experiment indicates that the scheduling system can improve the efficiency of dispatching service and the utilization ratio of distributed Grid resource.
Keywords :
Web services; grid computing; resource allocation; scheduling; comprehensive service distribution algorithm; distributed grid resource; dynamic dispatching method; load balance; loading constraint; service grid scheduling algorithm; Algorithm design and analysis; Data engineering; Data mining; Delay; Dispatching; Dynamic scheduling; Grid computing; Load management; Monitoring; Scheduling algorithm; Distribution; Load balance; Servic Grid; Synthetic Scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Knowledge Discovery and Data Mining, 2010. WKDD '10. Third International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-1-4244-5397-9
Electronic_ISBN :
978-1-4244-5398-6
Type :
conf
DOI :
10.1109/WKDD.2010.115
Filename :
5432597
Link To Document :
بازگشت