On-line Evolutionary Resource Matching for Job Scheduling in Heterogeneous Grid Environments

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 based architecture, design and 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.

By: Vijay K. Naik; Pawel Garbacki; Krishna Kummamuru; Yong Zhao

Published in: RC23944 in 2006


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .