loading...
Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching
Seattle, Washington June 22-June 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPDC.2003.121001812th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rajesh Raman, University of Wisconsin
Miron Livny, University of Wisconsin
Marvin Solomon, University of Wisconsin
Dynamic, heterogenous and distributively owned resource environments present unique challenges to the problems of resource representation, allocation and management. Conventional resource management methods that rely on static models of resource allocation policy and behavior fail to address these challenges. We previously argued that Matchmaking provides an elegant and robust solution to resource management in such dynamic and federated environments. However, Matchmaking is limited by its purely bilateral formalism of matching a single customer with a single resource, precluding more advanced resource management services such as co-allocation. In this paper, we present Gangmatching, a multilateral extension to the Matchmaking model, and discuss the Gangmatching model and its associated implementation and performance issues in context of a real-world license management co-allocation problem.
Index Terms:
distributed resource management, matchmaking, gangmatching, heterogenous computing, Condor
Citation:
Rajesh Raman, Miron Livny, Marvin Solomon, "Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching," hpdc, pp.80, 12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 '03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions