Matchmaking: Distributed Resource Management for High Throughput Computing

Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not adapt well to distributed systems, particularly those built to support high-throughput computing. Obstacles include heterogeneity of resources, which make uniform allocation algorithms difficult to formulate, and distributed ownership, leading to widely varying allocation policies. Faced with these problems, we developed and implemented the classified advertisement (classad) matchmaking framework, a flexible and general approach to resource management in distributed environment with decentralized ownership of resources. Novel aspects of the framework include a semi-structured data model that combines schema, data, and query in a simple but powerful specification language, and a clean separation of the matching and claiming phases of resource allocation. The representation and protocols result in a robust, scalab...

• Type: Conference
• Year: 1998
• Where: HPDC
• Authors: Rajesh Raman, Miron Livny, Marvin H. Solomon
• Keywords: Distributed And Parallel Computing, HPDC 1998, Obstacles Include Heterogeneity, Resource Management, Uniform Allocation Algorithms