A Hybrid Algorithm for DAG Application Scheduling on Computational Grids - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

A Hybrid Algorithm for DAG Application Scheduling on Computational Grids

Abstract

In the late three decades, grid computing has emerged as a new field providing a high computing performance to solve larger scale computational demands. Because Directed Acyclic Graph (DAG) application scheduling in a distributed environment is a NP-Complete problem, meta-heuristics are introduced to solve this issue. In this paper, we propose to hybridize two well-known heuristics. The first one is the Heterogeneous Earliest Finish Time (HEFT) heu-ristic which determines a static scheduling for a DAG in a heterogeneous environment. The second one is Particle Swarm Optimization (PSO) which is a sto-chastic meta-heuristic used to solve optimization problems. This hybridization aims to minimize the makespan (i.e., overall competition time) of all the tasks within the DAG. The experimental results that have been conducted under hy-bridization show that this approach improves the scheduling in terms of completion time compared to existing algorithms such as HEFT.
Fichier principal
Vignette du fichier
camera-ready.pdf (721.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02920521 , version 1 (24-08-2020)

Identifiers

Cite

Lyes Bouali, Karima Oukfif, Samia Bouzefrane, Fatima Boumghar Oulebsir. A Hybrid Algorithm for DAG Application Scheduling on Computational Grids. International Conference on Mobile, Secure and Programmable Networking (MSPN'2015), Jun 2015, Paris, France. pp.63-77, ⟨10.1007/978-3-319-25744-0_6⟩. ⟨hal-02920521⟩
36 View
152 Download

Altmetric

Share

Gmail Facebook X LinkedIn More