On-line Resource Matching for Heterogeneous Grid Environments

In this paper, we first present a linear programming based approach for modeling and solving the resource matching problem in grid environments with heterogeneous resources. The resource matching problem described here takes into account resource sharing, job priorities, dependencies on multiple resource types, and resource specific policies. We then propose a web service style architecture for on-line matching of independent jobs with resources in a grid environment and describe a prototype implementation. Our preliminary performance results indicate that the linear programming based approach for resource matching is efficient in speed and accuracy and can keep up with high job arrival rates – an important criterion for on-line resource matching systems. Also, the web service style architecture makes the system scalable and extendable. It can also be integrated with other existing grid services in a straightforward manner.

By: Vijay K. Naik; Chuang Liu; Lingyun Yang; Jonathan Wagner

Published in: RC23597 in 2005


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 .