By Topic

Scheduling directed a-cyclic task graphs on heterogeneous network of workstations to minimize schedule length

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)
Baskiyar, S. ; Dept. of Comput. Sci. & Software Eng., Auburn Univ., AL, USA ; SaiRanga, P.C.

We evaluate the performance of a non-preemptive heuristic algorithm called heterogeneous critical node first (HCNF) that statically schedules directed a-cyclic task graphs on heterogeneous multiprocessor systems to minimize the makespan. Using simulations on real applications and benchmark graphs we show that HCNF outperforms HEFT (heterogeneous earliest finish time) significantly in schedule length ratio, speedup and efficiency. Schedule length ratio is the ratio of the parallel time to the sum of weights of the critical path tasks on the fastest processor. Speedup is the ratio of the sequential execution time to the parallel execution time. Efficiency is the ratio of the speedup to the number of processors.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003