Parental Prioritization-Based Task Scheduling in Heterogeneous Systems.

Saved in:

Bibliographic Details
Title:	Parental Prioritization-Based Task Scheduling in Heterogeneous Systems.
Authors:	Arif, Muhammad Shahzad¹ mshehzad77@gmail.com, Iqbal, Zeshan¹ zeshan.iqbal@uettaxila.edu.pk, Tariq, Rehan² rehan@ciit-attock.edu.pk, Aadil, Farhan² farhan.aadil@ciit-attock.edu.pk, Awais, Muhammad¹ awaisntu@gmail.com
Source:	Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. ). Apr2019, Vol. 44 Issue 4, p3943-3952. 10p.
Subjects:	Computer scheduling, Heterogeneous distributed computing, Heterogeneous computing, Directed acyclic graphs, Random graphs
Abstract:	Efficient task scheduling is important for achieving high performance in heterogeneous distributed computing systems. The main focus of this research is to build a task scheduling algorithm for a heterogeneous environment. We proposed an algorithm named parental prioritization earliest finish time. It has two phases, tasks prioritization phase and processor assigning phase. In the tasks prioritization phase, tasks will schedule in parental priority queue (PPQ) on the basis of downward rank and parental priority. Task prioritization is based on the directed acyclic graph. It can schedule the task of successor row before the current row if it has less communication cost. In the processor assigning phase, the processor will allocate to the scheduled tasks obtained from PPQ keeping the computation cost to a minimum. This proposed algorithm is compared with HEFT and CPOP algorithms through graphs generated from random task graph generator and a set of tasks. The experimental results show that our proposed scheduling algorithm performs significantly better than other algorithms in terms of both cost and makespan of schedules. [ABSTRACT FROM AUTHOR]
	Copyright of Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. ) is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Efficient task scheduling is important for achieving high performance in heterogeneous distributed computing systems. The main focus of this research is to build a task scheduling algorithm for a heterogeneous environment. We proposed an algorithm named parental prioritization earliest finish time. It has two phases, tasks prioritization phase and processor assigning phase. In the tasks prioritization phase, tasks will schedule in parental priority queue (PPQ) on the basis of downward rank and parental priority. Task prioritization is based on the directed acyclic graph. It can schedule the task of successor row before the current row if it has less communication cost. In the processor assigning phase, the processor will allocate to the scheduled tasks obtained from PPQ keeping the computation cost to a minimum. This proposed algorithm is compared with HEFT and CPOP algorithms through graphs generated from random task graph generator and a set of tasks. The experimental results show that our proposed scheduling algorithm performs significantly better than other algorithms in terms of both cost and makespan of schedules. [ABSTRACT FROM AUTHOR]
ISSN:	2193567X
DOI:	10.1007/s13369-018-03698-2