Physical planning of on-chip interconnect architectures

Interconnect architecture plays an important role in determining the throughput of meshed communication structures. We assume a mesh structure with uniform communication demand for communication. A multi-commodity flow (MCF) model is proposed to find the throughput for several different routing architectures. The experimental results reveal several trends: 1. The throughput is limited by the capacity of the middle row and column in the mesh, simply enlarging the congested channel cannot produce better throughput. A flexible chip shape provides around 30% throughput improvement over a square chip of equal area. 2. A 45-degree mesh allows 17% throughput improvement over 90-degree mesh and a 90-degree and 45-degree mixed mesh provides 30% throughput improvement. 3. To achieve maximum throughput on a mixed Manhattan and diagonal interconnect architecture, the best ratio of the capacity for diagonal routing layers and the capacity for Manhattan routing layers is 5.6. 4. Incorporating a simplified via model, interleaving diagonal routing layers and Manhattan routing layer is the best way to organize the wiring directions on different layers.

[1]  Vaughn Betz,et al.  Effect of the prefabricated routing track distribution on FPGA area-efficiency , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[3]  Donald Yeung,et al.  Exploring optimal cost-performance designs for Raw microprocessors , 1998, Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251).

[4]  Chung-Kuan Cheng,et al.  EARLY FEASIBILITY AND COST ASSESSMENT FOR MULTICHIP MODULE TECHNOLOGIES , 1995 .

[5]  William J. Dally,et al.  Smart Memories: a modular reconfigurable architecture , 2000, ISCA '00.

[6]  Jonathan Rose,et al.  Experimental Ev alua-tion of Mesh and Partial Crossbar Routing Architec-tures for Multi-FPGA Systems , 1997 .

[7]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[8]  Joel Sokol,et al.  Virtual Path Design in Service-Specific ATM Networks , 2000, J. Heuristics.

[9]  Christoph Albrecht,et al.  Provably good global routing by a new approximation algorithm for multicommodity flow , 2000, ISPD '00.

[10]  A. Fujimura,et al.  A diagonal-interconnect architecture and its application to RISC core design , 2002, 2002 IEEE International Solid-State Circuits Conference. Digest of Technical Papers (Cat. No.02CH37315).

[11]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).