The problem of scheduling a parallel program represented by a weighted directed acyclic
graph (DAG) to a set of homogeneous processors for minimizing the completion time of the
program has been extensively studied. The NP-completeness of the problem has stimulated
researchers to propose a myriad of heuristic algorithms. While most of these algorithms are
reported to be efficient, it is not clear how they compare against each other. A meaningful
performance evaluation and comparison of these algorithms is a complex task and it must …