Complexity of Scheduling in High Level Synthesis
This work examines the complexity of scheduling for high level synthesis. It has been shown that the problem of finding the minimum time schedule for a set of chains of operations of two types using two processors, one of each type, is NP-complete. However, for two chains only, a polynomial time algorithm can been obtained for scheduling with two processors. The problem of scheduling a rooted binary tree of two operation types on two processors, one of each type, has been shown to be NP-complete. It has also been proved that absolute approximations for schedule length minimization or processor minimization are NP-complete. A related resource constrained scheduling problem has also been shown to be NP-hard.
Copyright © 1998 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.