CASP: a community-aware scheduling protocol

  • Authors:

  • Ye Huang;Nik Bessis;Pierre Kuonen;Beat Hirsbrunner

  • Affiliations:

  • Department of Informatics, University of Fribourg, Bd. de Perolles 90, Fribourg, Switzerland.;Department of Computer Science and Technology, University of Bedfordshire, Luton, Beds, LU1 3JU, UK.;Department of Information and Communication Technologies, University of Applied Sciences of Western Switzerland (Fribourg), Bd. de Perolles 80, Fribourg, Switzerland.;Department of Informatics, University of Fribourg, Switzerland, Bd. de Perolles 90, Fribourg, Switzerland

  • Venue:
  • International Journal of Grid and Utility Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

The existing resource and topology heterogeneity has divided the scheduling solutions into local schedulers and high-level schedulers (a.k.a. meta-schedulers). Although much work has been proposed to optimise job queue based scheduling, seldom has attention been put on the job sharing behaviours between decentralised distributed resource pools, which in turn raises a notable opportunity to exploit and optimise the process of job sharing between reachable grid dynamically and proactively. In our work, we introduce a novel scheduling protocol named the community-aware scheduling protocol (CASP), which dedicates to disseminate scheduling events of each participating node to as many remote nodes as possible. By means of the proposed protocol, the scheduling process of each received job consists of two phases with awareness of grid volatility. The implemented prototype and evaluated results have shown the introduced CASP is able to cooperate with a variety of local scheduling algorithms as well as diverse types of grids.