Premium
A peer‐to‐peer decentralized strategy for resource management in computational Grids
Author(s) -
Di Stefano Antonella,
Santoro Corrado
Publication year - 2007
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1110
Subject(s) - computer science , heuristics , distributed computing , node (physics) , grid , resource (disambiguation) , peer to peer , resource management (computing) , architecture , grid computing , overlay network , exploit , shared resource , resource allocation , overlay , computer network , the internet , mathematics , world wide web , engineering , art , geometry , structural engineering , computer security , visual arts , programming language , operating system
This paper presents a peer‐to‐peer (P2P) approach for the management, in a computational Grid, of those resources that are featured by numerical quantity and thus characterized by a coefficient of utilization, such as percentage of CPU time, disk space, memory space, etc. The proposed approach exploits spatial computing concepts and models a Grid by means of a flat P2P architecture consisting of nodes connected by an overlay network; such a network topology, together with the quantity of resource available in each node, forms a three‐dimensional surface, where valleys correspond to nodes with a large quantity of available resource. In this scenario, this paper proposes an algorithm for resource discovery that is based on navigating such a surface, in search of the deepest valley (global minimum, that is, the best node). The algorithm, which aims at fairly distributing among nodes the quantity of leased resource, is based on some heuristics that mimic the laws of kinematics. Experimental results show the effectiveness of the algorithm. Copyright © 2006 John Wiley & Sons, Ltd.