A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An efficient ILP-based scheduling algorithm for control-dominated VHDL descriptions
1997
ACM Transactions on Design Automation of Electronic Systems
Preserved Fulltext
In this paper, we present for the first time a mathematical framework for solving a special instance of the scheduling 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 codetransformational approach which fully preserves the VHDL semantics. The scheduling problem is mapped onto an integer linear program (ILP) which can be constrained to be solvable in polynomial time, but still permits
doi:10.1145/268424.268428
fatcat:fzekxsnmvbe27pnxbelxoqwzxa