Narrow Results

The performance of the Simple List Scheduling algorithm is unsatisfactory. In order to get the better schedule solution, this paper designs a novel task scheduling algorithm which is named as the Iterative List Scheduling algorithm. Compared with the Simple List Scheduling algorithm, the Iterative List Scheduling algorithm enlarges the search space of graph topological order to get smaller schedule length. Experiments with different scale of macroblock and different communication cost are provided to compare the performance of the Iterative List Scheduling and that of the Simple List Scheduling algorithm. Comparison result indicates that, the Iterative List Scheduling algorithm can schedule tasks more effectively than the Simple List Scheduling algorithm, especially under the circumstance of high communication cost. The maximum accelerate ratio reaches 102.8%