About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
CCGrid 2005
Conference paper
On-line resource matching for heterogeneous grid environments
Abstract
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 Dan 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. © 2005 IEEE.