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

X. Vasilakos, J. Sacha, G.E.O. Pierre

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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 publicationProceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications
Publication statusPublished - 2010

    Fingerprint

Cite this

Vasilakos, X., Sacha, J., & Pierre, G. E. O. (2010). Decentralized As-Soon-As-Possible Grid Scheduling: a Feasibility Study. In Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications