Abstract
With VLSI technology nodes scaling into the nanometer regime, interconnect delay plays an increasingly critical role in timing. For layer assignment, most works deal with via counts or total net delays, ignoring critical paths of each net and resulting in potential timing issues. In this article, we propose an incremental layer assignment framework targeting delay optimization in timing the critical path of each net. A set of novel techniques are presented: self-adaptive quadruple partition based on K × K division benefits the runtime; semidefinite programming is utilized for each partition; and the sequential mapping algorithm guarantees integer solutions while satisfying edge capacities; additionally, concurrent mapping offers a global view of assignment and post delay optimization reduces the path timing violations. The effectiveness of our work is verified by ISPD’08 benchmarks.
- Jianchang Ao, Sheqin Dong, Song Chen, and Satoshi Goto. 2013. Delay-driven layer assignment in global routing under multi-tier interconnect structure. In ACM International Symposium on Physical Design (ISPD’13). 101--107. Google ScholarDigital Library
- Brian Borchers. 1999. CSDP, A C library for semidefinite programming. Optimization Methods and Software 11 (1999), 613--623. Google ScholarCross Ref
- Rohit Chandra. 2001. Parallel Programming in OpenMP. Morgan Kaufmann.Google Scholar
- James Hsueh-Chung Chen, Theodorus E. Standaert, Emre Alptekin, Terry A. Spooner, and Vamsi Paruchuri. 2014. Interconnect performance and scaling strategy at 7 nm node. In IEEE International Interconnect Technology Conference (IITC’14). 93--96. Google ScholarCross Ref
- Jason Cong and Bin Liu. 2012. A metric for layout-friendly microarchitecture optimization in high-level synthesis. In ACM/IEEE Design Automation Conference (DAC’12). 1239--1244. Google ScholarDigital Library
- Ke-Ren Dai, Wen-Hao Liu, and Yih-Lang Li. 2009. Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing. In IEEE/ACM Asia and South Pacific Design Automation Conference (ASPDAC’09). 570--575.Google Scholar
- Peng Du, Shih-Hung Weng, Xiang Hu, and Chung-Kuan Cheng. 2011. Power grid sizing via convex programming. In International Conference on ASIC (ASICON’11). 337--340.Google Scholar
- Ananda D. Gunawardena, S. K. Jain, and Larry Snyder. 1991. Modified iterative methods for consistent linear systems. Linear Algebra Applications 154 (1991), 123--143. Google ScholarCross Ref
- Gurobi Optimization Inc. 2016. Gurobi Optimizer Reference Manual. http://www.gurobi.com.Google Scholar
- Chin-Hsiung Hsu, Huang-Yu Chen, and Yao-Wen Chang. 2008. Multi-layer global routing considering via and wire capacities. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD’08). 350--355.Google Scholar
- Meng-Kai Hsu, Nitesh Katta, Homer Yen-Hung Lin, Keny Tzu-Hen Lin, King Ho Tam, and Ken Chung-Hsing Wang. 2014. Design and manufacturing process co-optimization in nano-technology. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD’14). 574--581.Google ScholarDigital Library
- Jiang Hu and Sachin S. Sapatnekar. 2001. A survey on multi-net global routing for integrated circuits. Integration, the VLSI Journal 31, 1 (2001), 1--49.Google Scholar
- Andrew B. Kahng, Bao Liu, and Sheldon X.-D. Tan. 2006. Efficient decoupling capacitor planning via convex programming methods. In ACM International Symposium on Physical Design (ISPD’06). 102--107. Google ScholarDigital Library
- Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, and Satoshi Tanaka. 2015. Fast mask assignment using positive semidefinite relaxation in LELECUT triple patterning lithography. In IEEE/ACM Asia and South Pacific Design Automation Conference (ASPDAC’15). 665--670. Google ScholarCross Ref
- Tsung-Hsien Lee and Ting-Chi Wang. 2008. Congestion-constrained layer assignment for via minimization in global routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) 27, 9 (2008), 1643--1656. Google ScholarDigital Library
- Tsung-Hsien Lee and Ting-Chi Wang. 2010. Simultaneous antenna avoidance and via optimization in layer assignment of multi-layer global routing. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD’10). 312--318. Google ScholarCross Ref
- Derong Liu, Bei Yu, Salim Chowdhury, and David Z. Pan. 2016. Incremental layer assignment for critical path timing. In ACM/IEEE Design Automation Conference (DAC’16). 85:1--85:6. Google ScholarDigital Library
- Derong Liu, Bei Yu, Salim Chowdhury, and David Z. Pan. 2017. TILA-S: Timing-driven incremental layer assignment avoiding slew violations. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) (2017).Google Scholar
- Wen-Hao Liu and Yih-Lang Li. 2011. Negotiation-based layer assignment for via count and via overflow minimization. In IEEE/ACM Asia and South Pacific Design Automation Conference (ASPDAC’11). 539--544. Google ScholarCross Ref
- Vinicius Livramento, Derong Liu, Salim Chowdhury, Bei Yu, Xiaoqing Xu, David Z. Pan, Jose Luis Guntzel, and Luiz C. V. dos Santos. 2017. Incremental layer assignment driven by an external signoff timing engine. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) (2017).Google Scholar
- Gi-Joon Nam, Cliff Sze, and Mehmet Yildiz. 2008. The ISPD global routing benchmark suite. In ACM International Symposium on Physical Design (ISPD’08). 156--159. Google ScholarDigital Library
- Maurice Queyranne. 1986. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Operations Research Letters 4, 5 (1986), 231--234. Google ScholarDigital Library
- Daohang Shi, Edward Tashjian, and Azadeh Davoodi. 2016. Dynamic planning of local congestion from varying-size vias for global routing layer assignment. In IEEE/ACM Asia and South Pacific Design Automation Conference (ASPDAC’16). 372--377. Google ScholarCross Ref
- Lieven Vandenberghe and Stephen Boyd. 1996. Semidefinite programming. SIAM Review (SIREV) 38, 1 (1996), 49--95. Google ScholarDigital Library
- Lieven Vandenberghe, Stephen Boyd, and Abbas El Gamal. 1997. Optimal wire and transistor sizing for circuits with non-tree topology. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD’97). 252--259. Google ScholarCross Ref
- Bei Yu, Derong Liu, Salim Chowdhury, and David Z. Pan. 2015a. TILA: Timing-driven incremental layer assignment. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD’15). 110--117. Google ScholarCross Ref
- Bei Yu, Kun Yuan, Duo Ding, and David Z. Pan. 2015b. Layout decomposition for triple patterning lithography. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) 34, 3 (March 2015), 433--446. Google ScholarCross Ref
Index Terms
- Incremental Layer Assignment for Timing Optimization
Recommendations
Delay-driven layer assignment in global routing under multi-tier interconnect structure
ISPD '13: Proceedings of the 2013 ACM International symposium on Physical DesignA multilayer routing system usually adopts multiple interconnect configuration with different wire sizes and thicknesses. Since thicker layers of metal lead to fatter wires with smaller resistance, the layer assignment of nets has a large impact on the ...
Novel Airgap Insertion and Layer Reassignment for Timing Optimization Guided by Slack Dependency
ISPD '24: Proceedings of the 2024 International Symposium on Physical DesignBEOL with airgap technology is an alternative metallization option with promising performance, electrical yield and reliability to explore at 2nm node and beyond. Airgaps form cavities in inter-metal dielectrics (IMD) between interconnects. The ultra-low ...
Robust layer assignment for via optimization in multi-layer global routing
ISPD '09: Proceedings of the 2009 international symposium on Physical designIn this paper, we study a layer assignment problem which arises during multi-layer global routing. Our layer assignment problem takes the total wire overflow and the maximum wire overflow of a given 2D global routing solution to form the wire congestion ...
Comments