Soha Hassoun, Charles J. Alpert, et al.
ICCAD 2002
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.
Soha Hassoun, Charles J. Alpert, et al.
ICCAD 2002
Nancy Y. Zhou, Phillip Restle, et al.
SLIP 2014
Charles J. Alpert, Anirudh Devgan
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Zhanyuan Jiang, Shiyan Hu, et al.
ICCAD 2006