A Matchmaking Algorithm for Resource Discovery on Grid

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.