loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2
Online resource matching for heterogeneous grid environments
Cardiff, Wales, UK
May 09-May 12
ISBN: 0-7803-9074-1
V.K. Naik, IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
In this paper, we first present a linear programming based approach for modeling and solving the resource matching problem in grid environments with heterogeneous resources. The resource matching problem described takes into account resource sharing, job priorities, dependencies on multiple resource types, and resource specific policies. We then propose Web service style architecture for online matching of independent jobs with resources in a grid environment and describe a prototype implementation. Our preliminary performance results indicate that the linear programming based approach for resource matching is efficient in speed and accuracy and can keep up with high job arrival rates of an important criterion for online resource matching systems. Also, the Web service style architecture makes the system scalable and extendable. It can also be integrated with other existing grid services in a straightforward manner.
Citation:
V.K. Naik, C. Liu, L. Yang, J. Wagner, "Online resource matching for heterogeneous grid environments," ccgrid, vol. 2, pp.607-614, Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.