Untying RMS from Application Scheduling

Cristian Klein 1 Christian Pérez 1
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : As both resources and applications are becoming more complex, resource management also becomes a more challenging task. For example, scheduling code-coupling applications on federations of clusters such as Grids results in complex resource selection algorithms. The abstractions provided by current Resource Management Systems (RMS) - usually rigid jobs or advance reservations - are insufficient to enable such applications to efficiently select resources. This paper studies an RMS architecture that delegates resource selection to applications while the RMS still keeps control over the resources. The proposed architecture is evaluated using a simulator which is then validated with a proof-of-concept implementation. Results show that such a system is feasible and performs well with respect to fairness and scalability.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00519864
Contributor : Cristian Klein <>
Submitted on : Tuesday, September 21, 2010 - 4:18:10 PM
Last modification on : Friday, April 20, 2018 - 3:44:23 PM
Long-term archiving on : Wednesday, December 22, 2010 - 2:30:35 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00519864, version 1

Collections

Citation

Cristian Klein, Christian Pérez. Untying RMS from Application Scheduling. [Research Report] RR-7389, INRIA. 2010. ⟨inria-00519864⟩

Share

Metrics

Record views

320

Files downloads

245