Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm

Hdl Handle:
http://hdl.handle.net/10545/305326
Title:
Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm
Authors:
Huang, Ye; Bessis, Nik ( 0000-0002-6013-3935 ) ; Norrington, Peter; Kuonen, Pierre; Hirsbrunner, Beat
Abstract:
Job scheduling strategies have been studied for decades in a variety of scenarios. Due to the new characteristics of the emerging computational systems, such as the grid and cloud, metascheduling turns out to be an important scheduling pattern because it is responsible for orchestrating resources managed by independent local schedulers and bridges the gap between participating nodes. Equally, to overcome issues such as bottleneck, single point failure, and impractical unique administrative management, which are normally led by conventional centralized or hierarchical schemes, the decentralized scheduling scheme is emerging as a promising approach because of its capability with regards to scalability and flexibility. In this work, we introduce a decentralized dynamic scheduling approach entitled the community- aware scheduling algorithm (CASA). The CASA is a two-phase scheduling solution comprised of a set of heuristic sub-algorithms to achieve optimized scheduling performance over the scope of overall grid or cloud, instead of individual participating nodes. The extensive experimental evaluation with a real grid workload trace dataset shows that, when compared to the centralized scheduling scheme with BestFit as the metascheduling policy, the use of CASA can lead to a 30%–61% better average job slowdown, and a 68%–86% shorter average job waiting time in a decentralized scheduling manner without requiring detailed real-time processing information from participating nodes.
Affiliation:
University of Fribourg; University of Bedfordshire; University of Derby; University of Applied Sciences of Western Switzerland
Citation:
Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm 2013, 29 (1):402 Future Generation Computer Systems
Journal:
Future Generation Computer Systems
Issue Date:
2013
DOI:
10.1016/j.future.2011.05.006
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S0167739X11000872
Type:
Other
Language:
en
ISSN:
0167739X
Sponsors:
Swiss Hasler Foundation, Marie Curie Knowledge Transfer
Appears in Collections:
Department of Electronics, Computing & Maths

Full metadata record

DC FieldValue Language
dc.contributor.authorHuang, Yeen
dc.contributor.authorBessis, Niken
dc.contributor.authorNorrington, Peteren
dc.contributor.authorKuonen, Pierreen
dc.contributor.authorHirsbrunner, Beaten
dc.date.accessioned2013-11-13T11:50:55Z-
dc.date.available2013-11-13T11:50:55Z-
dc.date.issued2013-
dc.identifier.citationExploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm 2013, 29 (1):402 Future Generation Computer Systemsen
dc.identifier.issn0167739X-
dc.identifier.doi10.1016/j.future.2011.05.006-
dc.description.abstractJob scheduling strategies have been studied for decades in a variety of scenarios. Due to the new characteristics of the emerging computational systems, such as the grid and cloud, metascheduling turns out to be an important scheduling pattern because it is responsible for orchestrating resources managed by independent local schedulers and bridges the gap between participating nodes. Equally, to overcome issues such as bottleneck, single point failure, and impractical unique administrative management, which are normally led by conventional centralized or hierarchical schemes, the decentralized scheduling scheme is emerging as a promising approach because of its capability with regards to scalability and flexibility. In this work, we introduce a decentralized dynamic scheduling approach entitled the community- aware scheduling algorithm (CASA). The CASA is a two-phase scheduling solution comprised of a set of heuristic sub-algorithms to achieve optimized scheduling performance over the scope of overall grid or cloud, instead of individual participating nodes. The extensive experimental evaluation with a real grid workload trace dataset shows that, when compared to the centralized scheduling scheme with BestFit as the metascheduling policy, the use of CASA can lead to a 30%–61% better average job slowdown, and a 68%–86% shorter average job waiting time in a decentralized scheduling manner without requiring detailed real-time processing information from participating nodes.en
dc.description.sponsorshipSwiss Hasler Foundation, Marie Curie Knowledge Transferen
dc.language.isoenen
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0167739X11000872en
dc.rightsArchived with thanks to Future Generation Computer Systemsen
dc.subjectGrid schedulingen
dc.subjectCloud computingen
dc.subjectMeta-scheduling frameworksen
dc.titleExploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithmen
dc.typeOtheren
dc.contributor.departmentUniversity of Fribourgen
dc.contributor.departmentUniversity of Bedfordshireen
dc.contributor.departmentUniversity of Derbyen
dc.contributor.departmentUniversity of Applied Sciences of Western Switzerlanden
dc.identifier.journalFuture Generation Computer Systemsen
All Items in UDORA are protected by copyright, with all rights reserved, unless otherwise indicated.