Decentralized As-Soon-As-Possible Grid Scheduling: a Feasibility Study

Authors: Xenofon Vasilakos, Jan Sacha and Guillaume Pierre.
Source: In Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications (GridPeer), August 2010.

Abstract

Grid systems tend to grow in size, but currently deployed state-of-the-art schedulers have inherent scalability limits due to centralization and high messaging cost. In this paper, we explore the feasibility of scalable grid scheduling using a peer-to-peer overlay. We propose DGS_ASAP, a decentralized scheduling algorithm that schedules compute-intensive jobs such that their execution starts as soon as possible. Simulations of a 5000-node grid show that our design can scale to a large number of nodes, maintaining high grid utilization.

Download

The paper, in PDF (344,576 bytes)

Bibtex Entry

@InProceedings{,
  author = 	 {Xenofon Vasilakos and Jan Sacha and Guillaume Pierre},
  title = 	 {Decentralized As-Soon-As-Possible Grid Scheduling: a Feasibility Study},
  booktitle =    {Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications (GridPeer)},
  year = 	 {2010},
  month = 	 aug
}