Title: A path priority-based task scheduling algorithm for heterogeneous distributed systems

Authors: R. Eswari; S. Nickolas; Michael Arock

Addresses: Department of Computer Applications, National Institute of Technology, Tiruchirappalli – 620015, Tamilnadu, India ' Department of Computer Applications, National Institute of Technology, Tiruchirappalli – 620015, Tamilnadu, India ' Department of Computer Applications, National Institute of Technology, Tiruchirappalli – 620015, Tamilnadu, India

Abstract: Finding an effective schedule of tasks of distributed applications on the heterogeneous distributed computing systems is a trade-off between minimising the makespan and maximising the processor utilisation. The performance can be exploited in these systems through proper scheduling of application tasks. In this paper, a new task scheduling algorithm, called path-based heuristic task scheduling (PHTS) algorithm is proposed. The performance of the proposed algorithm is experimentally compared with the three existing scheduling algorithms. The results show that the PHTS algorithm outperforms other algorithms in terms of schedule length ratio, speedup and efficiency for applications with more tasks.

Keywords: task scheduling; heterogeneous distributed systems; directed acyclic graph; DAG; path priority.

DOI: 10.1504/IJCNDS.2014.059437

International Journal of Communication Networks and Distributed Systems, 2014 Vol.12 No.2, pp.183 - 201

Received: 12 Sep 2012
Accepted: 24 Mar 2013
Published online: 21 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article