An Efficient ILP-Based Scheduling Algorithm for Control-Dominated VHDL Descriptions

In this paper, we present for the first time a mathemati-cal framework for solving a special instance of the schedul-ing problem in control-flow dominated behavioral VHDL descriptions given that the timing of I/O signals has been completely or partially specified. It is based on a code-transformational approach which fully preserves the VHDL semantics. The scheduling problem is mapped onto an in-teger linear program (ILP) which can be constrained to be solvable in polynomial time, but still permits optimizing the statement sequence across basic block boundaries. 1