Conference paper
Steiner tree optimization for buffers. Blockages and bays
Charles J. Alpert, Gopal Gandham, et al.
ISCAS 2001
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.
Charles J. Alpert, Gopal Gandham, et al.
ISCAS 2001
Zhanyuan Jiang, Shiyan Hu, et al.
ICCAD 2006
Ganesh Venkataraman, Jiang Hu, et al.
IEEE Transactions on VLSI Systems
Zhuo Li, C.N. Sze, et al.
ASP-DAC 2005