An Efficient Algorithm for Buffered Routing Tree Construction under Fixed Buffer Locations with Accurate Delay Models
Yiqian Zhang, Xianlong Hong, Yici Cai · 2005
This paper studies the problem of buffered routing tree construction under fixed buffer locations with accurate delay models. In our approach, we firstly construct a timing-driven and buffer-aware Steiner tree, based on which each furcation buffer is searched in a bounding box. Then, a buffered routing tree is constructed by a dynamic programming method from the bottom up. The experimental results show that our algorithm performs well.