In this paper, an intermediate representation CDFG(Control Data Flow Graph) and a new scheduling algorithm for ASIC design automation is presented.
The CDFG represents control flow, data dependency and such constraints as resource constraints and ti...
In this paper, an intermediate representation CDFG(Control Data Flow Graph) and a new scheduling algorithm for ASIC design automation is presented.
The CDFG represents control flow, data dependency and such constraints as resource constraints and timing costraints.
The scheduling algorithm minimizes the total operating time by reducing the number of the constraints as maximal as possible, searching a few paths among al the paths produced by conditional branches. The constraints are substituted by subgraphs, and then the number of subgraphs is minimized by using the inclusion and overlap relation among subgraphs.
The proposed algorithm has achieved higher quality results than the previous algorithms on benchmark.