loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First IEEE International Symposium on Cluster Computing and the Grid (CCGrid'01)
A Benefit Function Mapping Heuristic for a Class of Meta-Tasks in Grid Environments
Brisbane, Australia
May 15-May 18
ISBN: 0-7695-1010-8
Qing Ding, University of Science and Technology of China
Guoliang Chen, University of Science and Technology of China
The Computational Grid is an appealing high performance computational platform. Problem in implementing Computational Grid environment is how to effectively use various resources in the system, such as compute cycle, memory, communication network, and data repositories. A benefit function Resource Mapping heuristic for Computational Grid Environments is presented to map a set of independent tasks (Meta-task) to resources. The algorithm considers the influence of input data repositories' location and QOS of tasks to result of mapping. This semi-dynamic algorithm is more suitable for the Dynamic adaptability and Domain autonomy in the Grid, and the benefit function heuristic adopted in the algorithm can assure the QOS of tasks more effectively.
Index Terms:
Computational Grid, Resource Mapping, Benefit Heuristic
Citation:
Qing Ding, Guoliang Chen, "A Benefit Function Mapping Heuristic for a Class of Meta-Tasks in Grid Environments," ccgrid, pp.654, First IEEE International Symposium on Cluster Computing and the Grid (CCGrid'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.