Matchmaking: Distributed Resource Management for High Throughput Computing (1998)
Cached
Download Links
| Venue: | In Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing |
| Citations: | 301 - 19 self |
BibTeX
@INPROCEEDINGS{Raman98matchmaking:distributed,
author = {Rajesh Raman and Miron Livny and Marvin Solomon},
title = {Matchmaking: Distributed Resource Management for High Throughput Computing},
booktitle = {In Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing},
year = {1998},
pages = {28--31}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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, scalabl...
