Static allocation of a task tree onto a linear array

The linear array processor architecture is an important class of interconnection structure that is suitable for VLSI. A heuristic algorithm is presented for mapping a task tree onto a linear array to minimize the total execution time. The algorithm partitions the node set of the task tree into clusters and maps these clusters onto processors. Simulation experiments show that the proposed algorithm is much more efficient than a conventional algorithm.<<ETX>>