Charles J. Alpert, Andrew B. Kahng, et al.
Discrete Applied Mathematics
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, Andrew B. Kahng, et al.
Discrete Applied Mathematics
Charles J. Alpert, Shrirang K. Karandikar, et al.
Proceedings of the IEEE
Charles J. Alpert, Patrick Groeneveld
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
He Zhou, Sunil P. Khatri, et al.
DAC 2019