A grid-based approach for connectivity binding with geometric costs

This paper discusses the problem of connectivity binding with geometric costs and a connectivity binder (GB) built to solve it. The goal of GB is to produce bittdings with short interconnection lengths. This is important because routing can account for a significant portion of the layout area and long communication lines tend to lead to longer cycle times due to increased capacitance. Long lines also tend to increase power consumption, so it is important to decrease the interconnection lengths for lowpower designs. This issue becomes even more critical as feature sizes are reduced. GB uses a new grid-based connectivity binding approach that incorporates these layout issues into the binding process. The usejidness of this grtibased approach is discussed and demonstrated.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Emil F. Girczyc,et al.  A generalized interconnect model for data path synthesis , 1991, DAC '90.

[3]  H. De Man,et al.  Automatic synthesis of signal processing benchmark using the CATHEDRAL silicon compilers , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.

[4]  Donald A. Lobo,et al.  Redundant operator creation: a scheduling optimization technique , 1991, 28th ACM/IEEE Design Automation Conference.

[5]  Barry M. Pangrle,et al.  GB: A New Grid-Based Binding Approach for High-Level Synthesis , 1993, The Sixth International Conference on VLSI Design.

[6]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[7]  Sheldon B. Akers.  On the Use of the Linear Assignment Algorithm in Module Placement , 1981, 18th Design Automation Conference.

[8]  Andrew Seawright,et al.  Relevant issues in high-level connectivity synthesis , 1991, 28th ACM/IEEE Design Automation Conference.

[9]  Srinivas Devadas,et al.  Algorithms for hardware allocation in data path synthesis , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  M.C. McFarland.  Using Bottom-Up Design Techniques in the Synthesis of Digital Hardware from Abstract Behavioral Descriptions , 1986, 23rd ACM/IEEE Design Automation Conference.

[11]  John A. Nestor,et al.  Data path allocation using an extended binding model , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.