Paper Info
Title
Resource Scheduling in Desktop Grid by Grid-JQA
Abstract
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.
Year
DOI
Venue
2008
10.1109/GPC.WORKSHOPS.2008.27
GPC Workshops
Keywords
Field
DocType
best match,performance metric,resource scheduling,sufferage heuristics,qos parameter,desktop grid computing,desktop grid environment,qos request,desktop grid,aggregation formula,qos-based resource scheduling algorithm,resource allocation,resource management,grid computing,java,computer architecture,scheduling,fault tolerance,quality of service,fault detection
Heuristic,Grid computing,Scheduling (computing),Computer science,Performance metric,Quality of service,Resource allocation,Heuristics,Grid,Distributed computing
Conference
Citations 
PageRank 
References 
8
0.68
15
Authors
2
Name
Order
Citations
PageRank
Leili Mohammad Khanli1725.78
Morteza Analoui212424.94