Article thumbnail
Location of Repository

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

By Xenofon Vasilakos, Jan Sacha and Guillaume Pierre

Abstract

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. Index Terms—grid computing, scheduling, decentralized, peerto-peer I

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.183.598
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.globule.org/publi/D... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.