Title: A Dynamic Resource Scheduling Algorithm Based on the Minimum Service Requirement
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 requirement is presented to capture the dynamics and impact of simultaneously co-allocated tasks in a grid. In this approach, the grid scheduler first archives every task’s minimum service requirement, which decreases each task’s waiting time. The experimental results demonstrate that this approach diminishes each task’s latency and contributes to the overall grid task throughput and CPU efficiency.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot