DAG Scheduling in Heterogeneous Computing and Grid Environments Using Variable Neighborhood Search Algorithm

Selvi, S. and Manimegalai, D. (2017) DAG Scheduling in Heterogeneous Computing and Grid Environments Using Variable Neighborhood Search Algorithm. Applied Artificial Intelligence, 31 (2). pp. 134-173. ISSN 0883-9514

[thumbnail of DAG Scheduling in Heterogeneous Computing and Grid Environments Using Variable Neighborhood Search Algorithm.pdf] Text
DAG Scheduling in Heterogeneous Computing and Grid Environments Using Variable Neighborhood Search Algorithm.pdf - Published Version

Download (3MB)

Abstract

DAG scheduling is a process that plans and supervises the execution of interdependent tasks on heterogeneous computing resources. Efficient task scheduling is one of the important factors to improve the performance of heterogeneous computing systems. In this paper, an investigation on implementing Variable Neighborhood Search (VNS) algorithm for scheduling dependent jobs on heterogeneous computing and grid environments is carried out. Hybrid Two PHase VNS (HTPHVNS) DAG scheduling algorithm has been proposed. The performance of the VNS and HTPHVNS algorithm has been evaluated with Genetic Algorithm and Heterogeneous Earliest Finish Time algorithm. Simulation results show that VNS and HTPHVNS algorithm generally perform better than other meta-heuristics methods.

Item Type: Article
Subjects: STM One > Computer Science
Depositing User: Unnamed user with email support@stmone.org
Date Deposited: 10 Jul 2023 05:19
Last Modified: 20 Sep 2025 03:42
URI: http://note.send2pub.com/id/eprint/1574

Actions (login required)

View Item
View Item