作者: Zhongdong Qi , Yici Cai , Qiang Zhou , Zhuwei Chen
DOI: 10.1109/ACQED.2015.7274018
关键词:
摘要: As technology advances, modern physical synthesis flows pose layer directive and scenic constraints to global routing. Respecting these in routing is critical achieve timing closure. In this paper, we propose a 3-D algorithm which simultaneously respects constraints. The based on iterative ripping-up rerouting. core components of the include A∗ search strictly obeys given constraints, net ordering approach helps high-quality results. Experimental results demonstrate effectiveness algorithm.