This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'06)
On-line Evolutionary Resource Matching for Job Scheduling in Heterogeneous Grid Environments
Minneapolis, Minnesota
July 12-July 15
ISBN: 0-7695-2612-8
Vijay K. Naik, IBM T. J. Watson Res Center, USA
Pawel Garbacki, Delft Univ.of Technology, The Netherlands
Krishna Kummamuru, IBM India Research Lab, India
Yong Zhao, Univ. of Chicago, USA
In this paper, we describe a resource matcher (RM) developed for the on-line resource matching in heterogeneous grid environments. RM is based on the principles of Evolutionary Algorithms (EA) and supports dynamic resource sharing, job priorities and preferences, job dependencies on multiple resource types, and resource specific and sitewide policies. We describe the evolutionary algorithm and the models used for representing the resource requirements, preferences, and policies. We evaluate three different methods for bootstrapping RM. We then describe a Evolutionary Matcher (EM) Service - a Web Service implementation of RM for on-line resource matching. Preliminary performance results indicate that the EM service is efficient in speed and accuracy and can keep up with high job arrival rates -an important criterion for on-line resource matching systems. The service oriented architecture makes the EM service scalable and extensible and can be integrated with already existing grid services in a straightforward manner.
Citation:
Vijay K. Naik, Pawel Garbacki, Krishna Kummamuru, Yong Zhao, "On-line Evolutionary Resource Matching for Job Scheduling in Heterogeneous Grid Environments," icpads, vol. 2, pp.103-108, 12th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.