Title :
QoS-aware Scheduling Algorithm Based on Complete Matching of User Jobs and Grid Services
Author :
Hao, Weidong ; Yang, Yang ; Lin, Chuang ; Zhai, Zhengli
Author_Institution :
Inf. Eng. Sch., Univ. of Sci. & Technol., Beijing
Abstract :
Grid services scheduling is a challenging problem under open grid service architecture (OGSA). Grid services running on clusters must have mechanism and policies for establishing and supporting QoS. A graph theory formal description is introduced into the service grid model in this paper. The necessary and sufficient condition of complete matching of user job and service resources has been given and proved. Optimal solution to matchmaking of grid jobs and grid services is developed based on the running time weight matrix, and the arithmetic has been verified by simulation analysis which proved to be more efficient than the alike arithmetic. The arithmetic has been implemented and running well
Keywords :
graph theory; grid computing; quality of service; scheduling; QoS-aware scheduling algorithm; graph theory formal description; grid jobs; grid services scheduling; necessary and sufficient condition; open grid service architecture; running time weight matrix; service grid model; service resources; simulation analysis; user job matching; user jobs; Arithmetic; Computer networks; Concurrent computing; Graph theory; Grid computing; Monitoring; Processor scheduling; Resource management; Scheduling algorithm; Sufficient conditions; Complete matching; Graph theory; QoS; Scheduler; Service Grid;
Conference_Titel :
Services Computing, 2006. APSCC '06. IEEE Asia-Pacific Conference on
Conference_Location :
Guangzhou, Guangdong
Print_ISBN :
0-7695-2751-5
DOI :
10.1109/APSCC.2006.81
