Partitioning-based wirelength estimation technique for Y-routing

Accurate wirelength estimation is desirable for VLSI circuit design. However, todays increasing design complexity incorporates greater complexity and hence requires a prior estimate of wirelength without performing exact routing. In this paper, we consider Y -routing, and propose a partitioning-based wirelength estimation scheme for multi-terminal nets. We try to find an optimum partition size of a multi-terminal net, and introduce a correction factor to accommodate wirelength variation for geometrical distribution of pin terminals on a layout. Our proposed method is simple and elegant, and yields reasonable solutions in little time. Experimental results with technology dependent benchmarks, and several industry test cases are encouraging.

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[2]  Marcus Brazil,et al.  Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics , 2005, Algorithmica.

[3]  Andrew B. Kahng,et al.  The Y architecture for on-chip interconnect: analysis and methodology , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Andrew B. Kahng,et al.  Estimation of wirelength reduction for λ-geometry vs. manhattan placement and routing , 2003, SLIP '03.

[5]  Andrew B. Kahng,et al.  Toward better wireload models in the presence of obstacles , 2001, ASP-DAC '01.

[6]  Sheqin Dong,et al.  APWL-Y: An accurate and efficient wirelength estimation technique for hexagon/triangle placement , 2007, Integr..

[7]  Liu Yu,et al.  computational geometry algorithms and applications solutions , 2014 .

[8]  Andrew B. Kahng,et al.  A tale of two nets: studies of wirelength progression in physical design , 2006, SLIP '06.

[9]  Jarrod A. Roy,et al.  Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Andrew B. Kahng,et al.  Intrinsic shortest path length: a new, accurate a priori wirelength estimator , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[11]  M.H. Chowdhury,et al.  Interconnect wire length estimation for stochastic wiring distributions , 2008, 2008 International Conference on Microelectronics.

[12]  Chris C. N. Chu.  FLUTE: fast lookup table based wirelength estimation technique , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[13]  Majid Sarrafzadeh,et al.  An Introduction To VLSI Physical Design , 1996 .

[14]  Majid Sarrafzadeh,et al.  Wirelength estimation based on rent exponents of partitioning and placement , 2001, SLIP '01.

[15]  Benny K. Nielsen,et al.  An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem , 2002, ESA.