By Topic

On-line evolutionary resource matching for job scheduling in heterogeneous grid environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
V. K. Naik ; IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA ; P. Garbacki ; K. Kummamuru ; Yong Zhao

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 site-wide 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

Published in:

12th International Conference on Parallel and Distributed Systems - (ICPADS'06)  (Volume:2 )

Date of Conference:

0-0 0