Congestion prediction in early stages

Routability optimization has become a major concern in the physical design cycle of VLSI circuits. Due to the recent advances in VLSI technology, interconnect has become a dominant factor of the overall performance of a circuit. In order to optimize interconnect cost, we need a good congestion estimation method to predict routability in the early stages of the design cycle. Many congestion models have been proposed but there's still a lot of room for improvement. Some existing models [6] are dependent on parameters that are related to the actual congestion of the circuits. Besides, routers will perform rip-up and re-route operations to prevent overflow but most models do not consider this case. The outcome is that the existing models will usually under-estimate the routability. In this paper, we propose a new congestion model to solve the above problems. The estimation process is divided into three steps: preliminary estimation, detailed estimation and congestion redistribution. We have compared our new model and some existing models with the actual congestion measures obtained by global routing some placement results with a publicly available maze router [2]. Results show that our model has significant improvement in prediction accuracy over the existing models.

[1]  Evangeline F. Y. Young,et al.  Integrated floorplanning and interconnect planning , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[2]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

[3]  Richard B. Brown,et al.  Congestion driven quadratic placement , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[4]  Majid Sarrafzadeh,et al.  Congestion estimation during top-down placement , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Evangeline F. Y. Young,et al.  Routability-driven floorplanner with buffer block planning , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Evangeline F. Y. Young,et al.  A new and efficient congestion evaluation model in floorplanning: wire density control with twin binary trees , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[7]  Majid Sarrafzadeh,et al.  Congestion minimization during placement , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Shankar Krishnamoorthy,et al.  Estimating routing congestion using probabilistic analysis , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Kusnadi,et al.  A method of measuring nets routability for MCM's general area routing problems , 1999, ISPD '99.

[10]  Majid Sarrafzadeh,et al.  Modeling and minimization of routing congestion , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[11]  Yici Cai,et al.  Dynamic global buffer planning optimization based on detail block locating and congestion analysis , 2003, DAC '03.

[12]  Jason Cong,et al.  Interconnect-Driven Floorplanning with Fast Global Wiring Planning and Optimization , 2001 .

[13]  Andrew B. Kahng,et al.  Accurate pseudo-constructive wirelength and congestion estimation , 2003, SLIP '03.

[14]  Patrick Groeneveld,et al.  Probabilistic congestion prediction , 2004, ISPD '04.