Signal Identification Track Info Signal Group Info Backbone Generation Synergistic Routing Candidate Generation Complete ? Streak Output Y Primal-Dual Solution Update

As VLSI technology scales to deep sub-micron, design for interconnections becomes increasingly challenging. The traditional bus routing follows a sequential bit-by-bit order, and few works explicitly target inter-bit regularity for signal groups via multi-layer topology selection. To overcome these limitations, we present Streak, an efficient framework that combines topology generation and wire synthesis with a global view of optimization and constrained metal layer track resource allocation. In the framework, an identification stage decomposes binding groups into a set of representative objects; with the generated backbones, equivalent topologies are accompanied by the bits in every object; then a formulation guides the routing considering wire congestion and design regularity. Furthermore, a bottom-up clustering methodology based on layer prediction targets to enhance the routability; a post-refinement stage is developed to match the source-to-sink distance deviation among bits in one group. Experimental results using industrial benchmarks demonstrate the effectiveness of the proposed technique.

[1]  G. Persky,et al.  Topological Routing of Multi-Bit Data Buses , 1984, 21st Design Automation Conference Proceedings.

[2]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Martin D. F. Wong,et al.  Bus-Driven Floorplanning , 2003, ICCAD.

[4]  Evangeline F. Y. Young,et al.  Multi-bend bus driven floorplanning , 2005, ISPD '05.

[5]  Nikil D. Dutt,et al.  Floorplan-aware automated synthesis of bus-based communication architectures , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[6]  Nikil Dutt,et al.  FABSYN: floorplan-aware bus architecture synthesis , 2006 .

[7]  R. Brayton,et al.  A simultaneous bus orientation and bused pin flipping algorithm , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[8]  Tan Yan,et al.  Untangling twisted nets for bus routing , 2007, ICCAD 2007.

[9]  Liang Deng,et al.  OPC-Friendly Bus Driven Floorplanning , 2007, 8th International Symposium on Quality Electronic Design (ISQED'07).

[10]  Sung Kyu Lim,et al.  Bus-aware microarchitectural floorplanning , 2008, 2008 Asia and South Pacific Design Automation Conference.

[11]  Evangeline F. Y. Young,et al.  TCG-based multi-bend bus driven floorplanning , 2008, 2008 Asia and South Pacific Design Automation Conference.

[12]  Chris C. N. Chu,et al.  FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Satoshi Goto,et al.  Bus via reduction based on floorplan revising , 2010, GLSVLSI '10.

[14]  Tsung-Yi Ho,et al.  Bus-driven floorplanning with bus pin assignment and deviation minimization , 2012, Integr..

[15]  Martin D. F. Wong,et al.  An ILP-based automatic bus planner for dense PCBs , 2013, 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC).

[16]  Derong Liu,et al.  TILA: Timing-driven incremental layer assignment , 2015, 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[17]  Derong Liu,et al.  Incremental layer assignment for critical path timing , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[18]  Jin-Tai Yan Efficient Layer Assignment of Bus-Oriented Nets in High-Speed PCB Designs , 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Hai Zhou,et al.  Layout decomposition co-optimization for hybrid e-beam and multiple patterning lithography , 2015, The 20th Asia and South Pacific Design Automation Conference.

[20]  Derong Liu,et al.  TILA-S: Timing-Driven Incremental Layer Assignment Avoiding Slew Violations , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.