Testability driven statistical path selection
Jaeyong Chung, Jinjun Xiong, et al.
DAC 2011
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynamic pattern routing (DPR) and 2) movable-segment-driven DPR. These two techniques enable Fashion to explore large solution space to achieve high routability with low time complexity. Compared with BoxRouter, Fashion has a shorter wire length and reduces overflow and runtime by 5 and 15 times, respectively. Compared with FastRoute, Fashion has similar runtime but 90% smaller overflow and 1.9% shorter wire length. Fashion is significantly better than Labyrinth and Fengshui in terms of overflow, wire length, and runtime. © 2006 IEEE.
Jaeyong Chung, Jinjun Xiong, et al.
DAC 2011
Khoi Nguyen Mac, Dhiraj Joshi, et al.
ICCV 2019
Xiaofan Zhang, Junsong Wang, et al.
ICCAD 2018
Yukun Ding, Jinglan Liu, et al.
CIKM 2018