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

Xenofon Vasilakos; Jan Sacha; Guillaume Pierre

doi:10.1109/ICCCN.2010.5560056

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 proceeding › Conference 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 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.

Original language	English
Title of host publication	2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010
DOIs	https://doi.org/10.1109/ICCCN.2010.5560056
Publication status	Published - 29 Oct 2010
Event	2010 19th International Conference on Computer Communications and Networks, ICCCN 2010 - Zurich, Switzerland Duration: 2 Aug 2010 → 5 Aug 2010

Publication series

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

Conference

Conference	2010 19th International Conference on Computer Communications and Networks, ICCCN 2010
Country/Territory	Switzerland
City	Zurich
Period	2/08/10 → 5/08/10

Keywords

Decentralized
Grid computing
Peer-to-peer
Scheduling

Access to Document

10.1109/ICCCN.2010.5560056

Handle.net

Persistent link

Cite this

Vasilakos, X., Sacha, J., & Pierre, G. (2010). Decentralized as-soon-as-possible grid scheduling: A feasibility study. In 2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010 Article 5560056 (Proceedings - International Conference on Computer Communications and Networks, ICCCN). https://doi.org/10.1109/ICCCN.2010.5560056

@inproceedings{41148e1a026943788c716675bc496cf7,

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

keywords = "Decentralized, Grid computing, Peer-to-peer, Scheduling",

author = "Xenofon Vasilakos and Jan Sacha and Guillaume Pierre",

year = "2010",

month = oct,

day = "29",

doi = "10.1109/ICCCN.2010.5560056",

language = "English",

isbn = "9781424471164",

series = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",

booktitle = "2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010",

note = "2010 19th International Conference on Computer Communications and Networks, ICCCN 2010 ; Conference date: 02-08-2010 Through 05-08-2010",

}

Vasilakos, X, Sacha, J & Pierre, G 2010, Decentralized as-soon-as-possible grid scheduling: A feasibility study. in 2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010., 5560056, Proceedings - International Conference on Computer Communications and Networks, ICCCN, 2010 19th International Conference on Computer Communications and Networks, ICCCN 2010, Zurich, Switzerland, 2/08/10. https://doi.org/10.1109/ICCCN.2010.5560056

Decentralized as-soon-as-possible grid scheduling: A feasibility study. / Vasilakos, Xenofon; Sacha, Jan; Pierre, Guillaume.
2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010. 2010. 5560056 (Proceedings - International Conference on Computer Communications and Networks, ICCCN).

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

TY - GEN

T1 - Decentralized as-soon-as-possible grid scheduling

T2 - 2010 19th International Conference on Computer Communications and Networks, ICCCN 2010

AU - Vasilakos, Xenofon

AU - Sacha, Jan

AU - Pierre, Guillaume

PY - 2010/10/29

Y1 - 2010/10/29

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.

KW - Decentralized

KW - Grid computing

KW - Peer-to-peer

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=77958467775&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.2010.5560056

DO - 10.1109/ICCCN.2010.5560056

M3 - Conference Contribution (Conference Proceeding)

AN - SCOPUS:77958467775

SN - 9781424471164

T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN

BT - 2010 Proceedings of 19th International Conference on Computer Communications and Networks, ICCCN 2010

Y2 - 2 August 2010 through 5 August 2010

ER -

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

Abstract

Publication series

Conference

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this