A study of meta-scheduling architectures for high throughput computing: Pull vs. Push

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 called DIRAC in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context.
Type de document :
Communication dans un congrès
ISPDC 2005. The 4th International Symposium on Parallel and Distributed Computing, Jul 2005, Lille, France
Liste complète des métadonnées

https://hal.inria.fr/hal-01431484
Contributeur : Eddy Caron <>
Soumis le : mercredi 11 janvier 2017 - 00:35:02
Dernière modification le : jeudi 8 février 2018 - 11:10:04

Identifiants

  • HAL Id : hal-01431484, version 1

Collections

Citation

Eddy Caron, Vincent Garonne, Andrei Tsaregorodtsev. A study of meta-scheduling architectures for high throughput computing: Pull vs. Push. ISPDC 2005. The 4th International Symposium on Parallel and Distributed Computing, Jul 2005, Lille, France. 〈hal-01431484〉

Partager

Métriques

Consultations de la notice

384