Tila: Timing-Driven Incremental Layer Assignment
2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)(2015)
摘要
As VLSI technology scales to deep submicron and beyond, interconnect delay greatly limits the circuit performance. The traditional 2D global routing and subsequent net by net assignment of available empty tracks on various layers lacks a global view for timing optimization. To overcome the limitation, this paper presents a timing driven incremental layer assignment tool, TILA, to reassign layers among routing segments of critical nets and non-critical nets. Lagrangian relaxation techniques are proposed to iteratively provide consistent layer/via assignments. Modeling via min-cost flow for layer shuffling avoids using integer programming and yet guarantees integer solutions via uni-modular property of the inherent model. In addition, multiprocessing of K x K partitions of the whole chip provides run time speed up. Certain parameters introduced in the models provide trade-off between timing optimization and via count. Experimental results in both ISPD'08 and industry benchmark suites demonstrate the effectiveness of the proposed incremental algorithms.
更多查看译文
关键词
TILA,VLSI technology,deep submicron,2D global routing,timing optimization,timing driven incremental layer assignment tool,routing segments,critical nets,noncritical nets,Lagrangian relaxation techniques,min-cost flow modeling,layer shuffling,unimodular property,via count,ISPD'08 suites,industry benchmark suites
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络