By Topic

Design and analysis of heuristic functions for static task distribution

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
$31 $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)
Shirazi, B. ; Dept. of Comput. Sci. & Eng., Southern Methodist Univ., Dallas, TX, USA ; Wang, M.

Two static task-scheduling algorithms are introduced. The first algorithm, called heavy-node first (HNF), is very simple and is based on a local analysis of program graph nodes at each level. The second method, called Weighted Length (WL), considers a more global view of the program graph, taking into account the relationship among the nodes at different levels. The two schemes are compared against the classical critical-path method (CPM). For a given directed acyclic graph of n nodes representing a program, it is shown that HNF requires O(n log n) steps, while WL and CPM require O(n2) steps to accomplish the allocation. The nontrivial worst-case performance of the three algorithms is analytically evaluated, and their average-case performance is evaluated through a simulation study. It is shown that the performance of the three algorithms is almost the same with respect to execution time and processor idle time. Therefore, taking into account the time complexity of the task distribution itself, it is concluded that a simple and fast heuristic algorithm such as HNF will achieve reasonable performance

Published in:

Distributed Computing Systems in the 1990s, 1988. Proceedings., Workshop on the Future Trends of

Date of Conference:

14-16 Sep 1988