STAIRoute: Global routing using monotone staircase channels

This work proposes a new algorithm for global routing using monotone staircase channels obtained from VLSI floorplan topology. Unlike the existing global routers that follow block placement stage, it immediately follows the floorplanning stage of VLSI design. The monotone staircase channels are identified using the results of recent O(nk log n) top-down hierarchical monotone staircase bipartition. The worst case time complexity of the proposed global routing algorithm is O(n2kt), where n, k and t denote the number of blocks, nets and the number of terminals in a given net respectively for a given floorplan. Experimental results on the MCNC/GSRC floorplanning benchmark circuits show that our method obtained 100% routability for each of the nets, without any over-congestion through the monotone staircase channels. The wire length for each of the t-terminal (t ≥ 2) nets is comparable to the steiner length of that net in almost all cases.

[1]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[2]  Bapi Kar,et al.  A Faster Hierarchical Balanced Bipartitioner for VLSI Floorplans Using Monotone Staircase Cuts , 2012, VDAT.

[3]  Jarrod A. Roy,et al.  High-Performance Routing at the Nanometer Scale , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Parthasarathi Dasgupta,et al.  Monotone bipartitioning problem in a planar point set with applications to VLSI , 2002, TODE.

[5]  Martin D. F. Wong,et al.  Channel ordering for VLSI layout with rectilinear modules , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[7]  Majid Sarrafzadeh,et al.  Pattern routing: use and theory for increasing predictability andavoiding coupling , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Susmita Sur-Kolay,et al.  The cycle structure of channel graphs in nonsliceable floorplans and a unified algorithm for feasible routing order , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[9]  Kun Yuan,et al.  BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability , 2009, TODE.

[10]  Susmita Sur-Kolay,et al.  Hierarchical partitioning of VLSI floorplans by staircases , 2007, TODE.

[11]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[12]  Martin D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD.

[13]  Subhas C. Nandy,et al.  On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan , 2004, J. Circuits Syst. Comput..

[14]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[15]  Ronald L. Rivest,et al.  Introduction to Algorithms, 3rd Edition , 2009 .

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

[17]  Yu Hu,et al.  Fashion: A Fast and Accurate Solution to Global Routing Problem , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[19]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[20]  Min Pan,et al.  FastRoute: A Step to Integrate Global Routing into Placement , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.