By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Eswari ; Dept. of Comput. Applic., Nat. Inst. of Technol., Tiruchirappalli, India ; S. Nickolas

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.

Published in:

Advances in Recent Technologies in Communication and Computing (ARTCom), 2010 International Conference on

Date of Conference:

16-17 Oct. 2010