Donald Bren School of Information and Computer Sciences

This report describes an implementation of a scheduling algorithm constructed to use the functionality of existing RT datapath components more effectively. Scheduling algorithms for High-Level Synthesis (HLS) have been based on assumptions that failed to recognize that RT datapath components may have complex, concurrent functionality. The algorithm described in this report takes advantage of a representation that was designed to capture the complex, concurrent functionality of combinatorial RT functional units. This enables the algorithm to utilize RT functions that have been available in existing RT components but had been ignored by other scheduling techniques. The algorithm has been implemented to work with the Interactive Synthesis Environment (ISE).