Path-Based Heuristic Task Scheduling Algorithm for Heterogeneous Distributed Computing Systems

A vital role of static task scheduling is to obtain high performance in distributed computing environment. Several algorithms have been proposed for homogeneous and heterogeneous distributed computing systems. In this paper we propose a static list Path based Heuristic Task Scheduling (PHTS) algorithm to efficiently schedule tasks on the heterogeneous distributed computing systems. The algorithm is mainly focused on reducing the makespan. It consists of three phases: A path prioritizing phase, selecting all possible paths from the given graph and sorting them by descending order. Secondly, a task selection phase, selecting the tasks from the sorted paths and finally, a processor selection phase, assigning the tasks to processors which minimizes the completion time. From the theoretical analysis of the PHTS algorithm with HEFT for a DAG graph, the better schedule length is observed.