By Topic

A Matchmaking Algorithm for Resource Discovery on Grid

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

3 Author(s)
Md. Rafiqul Islam ; Computer Science and Engineering Discipline, Khulna University, Khulna, Bangladesh. ; Md. Zahidul Islam ; Nazia Leyla

Resource management is a very important feature in the grid computing environment. The matchmaking framework [1] provides a reasonable solution to resource management in distributed environment; it is composed of four important components as classified advertisement (classad), matchmaker protocol, matchmaking algorithm and claiming protocols [2]. In this paper we proposed a fast and efficient searching method for matchmaking algorithm. The proposed algorithm reduces the searching time to a linear function from cubic function proposed in paper [2]. We discussed briefly the working principles of the method, its performance and its limitations.

Published in:

2007 International Conference on Information and Communication Technology

Date of Conference:

7-9 March 2007