QoS Guided Min—Min Heuristic for Grid Task Scheduling

查看全文 作　　者：[1]何晓珊;[1]孙贤和;Gregor von [2]Laszewski 机构地区：[1]Department of Computer Science, Illinois Institute of Technology, IL, USA;[2]Mathematics and Computer Science Division, Argonne National Laboratory, IL, USA; 出　　处：《Journal of Computer Science & Technology》索引2003年第18卷第4期,共10页 基　　金：美国自然科学基金 摘　　要：Task scheduling is an integrated component of computing. With the emergence of Grid and ubiquitous computing, new challenges appear in task scheduling based on properties such as security, quality of service, and lack of central control within distributed administrative domains. A Grid task scheduling framework must be able to deal with these issues. One of the goals of Grid task scheduling is to achieve high system throughput while matching applications with the available computing resources. This matching of resources in a non-deterministically shared heterogeneous environment leads to concerns over Quality of Service (QoS). In this paper a novel QoS guided task scheduling algorithm for Grid computing is introduced. The proposed novel algorithm is based on a general adaptive scheduling heuristics that includes QoS guidance.The algorithm is evaluated within a simulated Grid environment. The experimental results show that the new QoS guided Min-Min heuristic can lead to significant performance gain for a variety of applications. The approach is compared with others based on the quality of the prediction formulated by inaccurate information. 关 键 词：QOS 任务调度 网格计算 服务质量 非贡献计算