Matchmaking: distributed resource management for high throughput computing
University of Wisconsin–Madison
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…
Citation impact
- FWCI
- 50.57
- Percentile
- 100%
- References
- 10
Authors
3Topics & keywords
- Computer science
- Distributed computing
- Scalability
- Software deployment
- Resource allocation
- Robustness (evolution)
- Resource management (computing)
- Throughput