Interconnect optimisation during data path allocation

In previous research interconnection was optimised when the module allocation for the operations and the register allocation for the variables already had been done. However, both the amount of multiplexing and interconnect are crucial factors to both the delay and the area of a circuit. In this paper it is shown that when variables are grouped into register files and operations are assigned to modules to minimise the interconnections, significant savings (20%) can be obtained in the number of local interconnections and the amount of global interconnect on the expense of only slightly more register area. This can be enhanced by splitting read and write phases of registers and even more by introducing serial (re-) write operations for the same value. The variable grouping is based on edge colouring algorithms that provide a sharp upper bound on the number of colours needed.<<ETX>>

[1]  J.A.G. Jess,et al.  Synthesis of concurrent hardware structures , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[2]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Donald E. Thomas,et al.  The system architect's workbench , 1988, DAC '88.

[4]  Barry M. Pangrle Splicer: a heuristic approach to connectivity binding , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[5]  D. König Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .