Scheduling directed a-cyclic task graphs on heterogeneous network of workstations to minimize schedule length
Sanjeev Baskiyar, Prashanth C. SaiRanga · 2004
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.