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

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

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 proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications
Publication status	Published - 2010

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Access to Document

http://www.globule.org/publi/DAGSFS_gridpeer2010.html

Persistent URL (handle)

Persistent link

Cite this

@inproceedings{1735ad5372e54da680c8c9bb6c01a806,

title = "Decentralized As-Soon-As-Possible Grid Scheduling: a Feasibility Study",

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

author = "X. Vasilakos and J. Sacha and G.E.O. Pierre",

year = "2010",

language = "English",

booktitle = "Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications",

}

TY - GEN

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

AU - Vasilakos, X.

AU - Sacha, J.

AU - Pierre, G.E.O.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

M3 - Conference contribution

BT - Proceedings of the 2nd IEEE Workshop on Grid and P2P Systems and Applications

ER -

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

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this