X-routing using two Manhattan route instances

In deep sub-micron (DSM) technologies, wire delays comprise a dominant fraction of the total delay of a design. As a consequence, routing techniques which reduce the total wire length of a design are highly relevant to such technologies. One such approach which holds promise is that of non-Manhattan routing (or X routing). In this paper, we describe a technique to perform non-Manhattan routing by combining the results of two related Manhattan routing instances. The first is a regular, unrotated routing instance. The second routing instance is derived from the first by rotating the coordinate system by 45/spl deg/. Both instances are routed on the same pair of metal layers. By selectively combining the results of the two instances, we obtain a final routing result that contains non-Manhattan wire segments. Our approach utilizes a powerful Floyd-Warshall based engine to combine the results of the two instances. We demonstrate that our router produces highly efficient results, reducing the total wire length by an average of about 20% (31%) over the unrotated (rotated) results, with a via-count decrease of between 4% (43%).

[1]  Xiaoyu Song,et al.  Improvement on the diagonal routing model , 1994 .

[2]  A. Kahng,et al.  On optimal interconnections for VLSI , 1994 .

[3]  Fabrizio Luccio,et al.  A preliminary study of a diagonal channel-routing model , 2005, Algorithmica.

[4]  David Marple,et al.  Tailor: a layout system based on trapezoidal corner stitching , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Sunil P. Khatri,et al.  Non-Manhattan routing using a Manhattan router , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[6]  Yao-Wen Chang,et al.  Multilevel full-chip routing for the X-based architecture , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[7]  Cheng-Kok Koh,et al.  Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures , 2000, ACM Great Lakes Symposium on VLSI.

[8]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[9]  Peter Robinson,et al.  Channel routing by sorting , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Bhargab B. Bhattacharya,et al.  Channel routing in Manhattan-diagonal model , 1996, Proceedings of 9th International Conference on VLSI Design.