Decentralized as-soon-as-possible grid scheduling: A feasibility study

Xenofon Vasilakos*, Jan Sacha, Guillaume Pierre

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

5 Citations (Scopus)

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 DGSASAP, 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.

Original languageEnglish
Title of host publication2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010
DOIs
Publication statusPublished - 29 Oct 2010
Event2010 19th International Conference on Computer Communications and Networks, ICCCN 2010 - Zurich, Switzerland
Duration: 2 Aug 20105 Aug 2010

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
ISSN (Print)1095-2055

Conference

Conference2010 19th International Conference on Computer Communications and Networks, ICCCN 2010
CountrySwitzerland
CityZurich
Period2/08/105/08/10

Keywords

  • Decentralized
  • Grid computing
  • Peer-to-peer
  • Scheduling

Fingerprint Dive into the research topics of 'Decentralized as-soon-as-possible grid scheduling: A feasibility study'. Together they form a unique fingerprint.

Cite this