QoS-aware Scheduling Algorithm Based on Complete Matching of User Jobs and Grid Services

摘要：

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 ts 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.

关键词： Service Grid Scheduler Complete matching QoS Graph theory

作者: Weidong Hao Yang Yang Chuang Lin Zhengli Zhai

作者单位: Information Engineering School, University of Science and Technology Beijing, Beijing 100083, China Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China

会议类型: 国际会议

会议名称: 2006 Asia-Pacific Services Computing Conference(IEEE亚太地区服务计算会议)

会议地点: 广州

会议语种:英文

页码: 433-439

在线出版日期: 2006-12-12（万方平台首次上网日期，不代表论文的发表时间）