MPT-based scheduling for high-level synthesis

The conventional scheduling algorithms either give a nonoptimal solution or present a long execution time in moderate cases. In this paper, we propose a branch-and-bound algorithm based on an MPT graph to solve the scheduling problem of high-level synthesis. Six efficient priority rules were developed as bound functions of the algorithm. Experimental results show that this algorithm can obtain a competitive schedule in a very short execution time.