loading...
A Decentralized Strategy for Resource Allocation
Linkoping, Sweden June 13-June 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WETICE.2005.614th IEEE International Workshops on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Antonella Di Stefano, University of Catania, Italy
Corrado Santoro, University of Catania, Italy
This paper presents a new approach for resource allocation in a grid based on "spatial computing" concepts. We model a grid using a flat architecture consisting of nodes connected by an overlay network. The 2D spatial distribution of the nodes of the grid, together with the quantity of resource available in each node, forms a 3D surface, where valleys correspond to nodes with a large quantity of available resource. We propose an algorithm for resource allocation that is based on surfing such a 3D surface, in search for the deepest valley (global minimum). 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.
Index Terms:
Grid, Job allocation, Resource allocation, Spatial computing.
Citation:
Antonella Di Stefano, Corrado Santoro, "A Decentralized Strategy for Resource Allocation," wetice, pp.295-300, 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (WETICE'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.