Conference paper
Fast algorithms for slew constrained minimum cost buffering
Shiyan Hu, Charles J. Alpert, et al.
DAC 2006
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.
Shiyan Hu, Charles J. Alpert, et al.
DAC 2006
Haoxing Ren, David Z. Pan, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
David A. Papa, Tao Luo, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Charles J. Alpert, Gopal Gandham, et al.
ISCAS 2001