Conference paper
Interconnect optimization considering multiple critical paths
Jiang Hu, Ying Zhou, et al.
ISPD 2018
Buffer insertion is essential for achieving timing closure. This work studies buffer insertion under two types of constraints: (i) avoiding blockages, and (ii) inserting buffers into pre-determined buffer bay regions. We propose a general Steiner tree routing problem to drive this application and present a maze-routing based heuristic. We show that this approach leads to useful solutions on industry designs.
Jiang Hu, Ying Zhou, et al.
ISPD 2018
Bing Lu, Jiang Hu, et al.
ISPD 2003
Zhuo Li, C.N. Sze, et al.
ASP-DAC 2005
Shiyan Hu, Zhuo Li, et al.
DAC 2009