A new approach for operation scheduling with data flow graph reforming

In behavioral synthesis, the description of the system is transformed into a data flow graph (DFG) first, and then scheduling and allocation are carried out. In this study, under the resource constraint, the fixed DFG with minimal operation count does not necessarily achieve a shortest schedule; its schedule may be longer than that of some algebraically equivalent DFGs. To explore a shortest schedule among those algebraically equivalent DFGs, a new approach is developed which modifies the topology of the graph and does scheduling at the same time. An example shows that the schedule obtained by this method is better than that of the original DFG.<<ETX>>

[1]  C. Y. Roger Chen,et al.  A delay distribution methodology for the optimal systolic synthesis of linear recurrence algorithms , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Daniel P. Siewiorek,et al.  A Technology-Relative Computer-Aided Design System: Abstract Representations, Transformations, and Design Tradeoffs , 1978, 15th Design Automation Conference.

[3]  Alice C. Parker,et al.  Sehwa: a software package for synthesis of pipelines from behavioral specifications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Alice C. Parker,et al.  Tutorial on high-level synthesis , 1988, DAC '88.

[6]  Richard I. Hartley,et al.  Tree-height minimization in pipelined architectures , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  Richard I. Hartley,et al.  Behavioral to structural translation in a bit-serial silicon compiler , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .