Skip to Main Content
In desktop grid computing, resource scheduling is an important issue. In this paper, we propose a QoS-based resource scheduling algorithm that finds the best match between tasks and resources while meeting QoS requests. We describe Grid-JQA, our proposed architecture supporting resource scheduling in desktop grid environments, and our current implementation of this architecture. In this work we propose an aggregation formula for the QoS parameters. The formula is a unit less combination of the parameters together with weighting factors. Three heuristic approaches have been designed and compared via simulations to match tasks which take into account the QoS requested by the tasks, and at the same time, to minimize the tasks make span as much as possible. Also, an optimum method based on the performance metric has been designed to compare the performance of the heuristics developed. We compare our work with Min_Min, Max_Min and Sufferage heuristics. The results of a simulation are provided to evaluate the main idea of the paper.