Resource Management through Multilateral Matchmaking

Federated distributed systems present new challenges to resource management, which cannot be met by conventional systems that employ relatively static resource models and centralized allocators. We previously argued that Matchmaking provides an elegant and robust resource management solution for these highly dynamic environments [5]. Although powerful and flexible, multiparty policies (e.g., co-allocation) cannot be accomodated by Matchmaking. In this paper we present Gang-Matching, a multilateral matchmaking formalism to address this deficiency.

• Type: Conference
• Year: 2000
• Where: HPDC
• Authors: Rajesh Raman, Miron Livny, Marvin H. Solomon
• Keywords: Distributed And Parallel Computing, HPDC 2000, Multilateral Matchmaking Formalism, Resource Management, Static Resource Models