Fast and Effective Congestion Refinement Technique

Due to the promotion of modern design feature, the placement solution is becoming more and more difficult to route. Previous routability-driven based technology is usually coupled with the original placer, which is difficult to be widely used in various placement tools. In this paper, we proposed a tool called CRT (Congestion Refinement Technique), which is independent of any placer and any router, and can be applied to various placemen to improve the routability. CRT is a congestion-driven based module shifting technique. Basically, CRT is one kind of technology that better allocating routing resources by shifting the modules. The boundary of tile is shifted in the horizontal and vertical directions without affecting the original placement. Here a longest path solution is presented to solve the problem fast and effectively. The experimental results show that the CRT can effectively alleviate the congestion of unroutable placement solutions. We apply it to placement solutions generated by placers on ISPD2011 [ placement benchmarks. From the result we can see that CRT greatly improves the routbility and saves execution time for the routing stage after refinement.

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

[2]  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.

[3]  Chris C. N. Chu,et al.  FastRoute 2.0: A High-quality and Efficient Global Router , 2007, 2007 Asia and South Pacific Design Automation Conference.

[4]  Yih-Lang Li,et al.  GRPlacer: Improving routability and wire-length of global routing with circuit replacement , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[5]  Jarrod A. Roy,et al.  Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Ryan Kastner,et al.  Congestion Estimation During Top-down Pla , 2007 .

[7]  Majid Sarrafzadeh,et al.  Congestion estimation during top-down placement , 2001, ISPD '01.

[8]  Ulrich Brenner,et al.  An effective congestion driven placement framework , 2002, ISPD '02.

[9]  Yanheng Zhang,et al.  CROP: Fast and effective congestion refinement of placement , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[10]  Chris C. N. Chu,et al.  FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Peter Spindler,et al.  Fast and Accurate Routing Demand Estimation for Efficient Routability-driven Placement , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

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

[13]  Chris C. N. Chu,et al.  An efficient and effective detailed placement algorithm , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[14]  Chris C. N. Chu,et al.  IPR: An Integrated Placement and Routing Algorithm , 2007, 2007 44th ACM/IEEE Design Automation Conference.

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

[16]  Chris C. N. Chu,et al.  FastPlace: efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net model , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Yih-Lang Li,et al.  Multi-threaded collision-aware global routing with bounded-length maze routing , 2010, Design Automation Conference.