Evaluation of Meta-scheduler Architectures and Task Assignment Policies for High Throughput Computing

Abstract : In this paper we present a model and simulator for many clusters of heterogeneous PCs belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. These studies indicate that the simulator is consistent. Next, we do the comparison with a real batch system and we obtain an average error of 10.5% for the response time and 12% for the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context.
Document type :
Reports
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070430
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:28:26 PM
Last modification on : Friday, May 17, 2019 - 8:51:41 AM

Identifiers

  • HAL Id : inria-00070430, version 1

Collections

Citation

Eddy Caron, Vincent Garonne, Andreï Tsaregorodtsev. Evaluation of Meta-scheduler Architectures and Task Assignment Policies for High Throughput Computing. [Research Report] RR-5576, LIP RR-2005-27, INRIA, LIP. 2005, pp.13. ⟨inria-00070430⟩

Share

Metrics

Record views

519

Files downloads

469