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
ICPADS 2006
Conference paper
On-line evolutionary resource matching for job scheduling in heterogeneous grid environments
Abstract
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. © 2006 IEEE.