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

  • Authors:
  • Vincent Garonne;Andrei Tsaregorodtsev;Eddy Caron

  • Affiliations:
  • C.P.P.M/CNRS-IN2P3, CEDEX, France;C.P.P.M/CNRS-IN2P3, CEDEX, France;LIP/ENS Lyon/CNRS-INRIA-UCBL, Lyon Cedex 07, France

  • Venue:
  • ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.