关键词: 网格计算 任务调度 优先级 最小服务

Abstract:

Resource scheduling is a critical problem involved in grid studies. Currently, much research can be found about grid scheduling, and many scheduling algorithms including static and dynamic scheduling algorithms have been proposed. In this paper, a scheduling algorithm based on the minimum service requ  irement is presented to capture the dynamics and impact of simultaneously co-allocated tasks in a grid. In this approach, the grid scheduler first archi ves every task＇s minimum service requirement, which decreases each task＇s waiting time. The experimental results demonstrate that this approach dimini ishes each task＇s latency and contributes to the overall grid task throughput and CPU efficiency.

Key words: grid computing, task scheduling, priority;minimum service