Benchmarking the Task Graph Scheduling Algorithms

The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompleteness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compare against each other. A comprehensive performance evaluation and comparison of these algorithms entails addressing a number of difficult issues. One of the issues is that a large number of scheduling algorithms are based upon radically different assumptions, making their comparison on a unified basis a rather intricate task. Another issue is that there is no standard set of benchmarks that can be used to evaluate and compare these algorithms. Furthermore, most algorithms are evaluated using small problem sizes, and it is not clear how their performance scales with the problem size. In this pape...

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Yu-Kwong Kwok, Ishfaq Ahmad
• Keywords: Algorithms, Distributed And Parallel Computing, Heuristic Algorithms, IPPS 1998, Scheduling Algorithms