DocumentCode :
393399
Title :
The Y-architecture: yet another on-chip interconnect solution
Author :
Chen, Hongyu ; Yao, Bo ; Zhou, Feng ; Cheng, Chung-Kuan
Author_Institution :
Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
fYear :
2003
fDate :
21-24 Jan. 2003
Firstpage :
840
Lastpage :
846
Abstract :
In this paper, we propose a new on-chip interconnect scheme called Y-architecture, which can utilize the on-chip routing resources more efficiently than traditional Manhattan interconnect architecture by allowing wires routed in three directions (0°, 60°, and 120°). To evaluate the efficiency of different interconnect architectures, we assume mesh structures with uniform communication demand and develop a multi-commodity flow (MCF) approach to model the on-chip communication traffic. We also extend the combinatorial MCF algorithm of N. Garg and J. Konemann (Proc. 39th Annual Symp. on Foundations of Comp. Sci., pp. 300-309, 1998) to compute the optimal routing resource allocations for different interconnect architectures. The experiments show that: (1) compared with the Manhattan architecture, the Y-architecture demonstrates a throughput improvement of 30.7% for a square chip. The throughput of the Y-architecture is only 2.5% smaller than that of the X-architecture. (2) A chip with the shape of a convex polygon produces better throughput than a rectangular chip: For Y-architecture, a hexagonal chip provides 41% more throughput than a squared chip using the Manhattan architecture. For Manhattan architecture, a diamond chip achieves a throughput improvement of 19.5%, over the squared chip using the same interconnect architecture. (3) Compared with Manhattan architecture, the Y-architecture reduces the wire length of a randomly distributed two pin net by 13.4% and the average wire length of Y-architecture is only 4.3% more than that of the X-architecture.
Keywords :
circuit layout CAD; combinatorial mathematics; integrated circuit interconnections; integrated circuit layout; integrated circuit metallisation; network routing; Manhattan interconnect architecture; X-architecture; Y-architecture; combinatorial MCF algorithm; convex polygon chip; diamond chip; hexagonal chip; mesh structures; multi-commodity flow approach; on-chip communication traffic model; on-chip interconnect; on-chip routing resources; optimal routing resource allocations; randomly distributed two pin net; square chip; throughput improvement; uniform communication demand; wire length; wire routing directions; Computer architecture; Computer science; Costs; Integrated circuit interconnections; Resource management; Routing; Shape; Throughput; Traffic control; Wires;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 2003. Proceedings of the ASP-DAC 2003. Asia and South Pacific
Print_ISBN :
0-7803-7659-5
Type :
conf
DOI :
10.1109/ASPDAC.2003.1195134
Filename :
1195134
Link To Document :
بازگشت