作者: Zhuo Li , Ying Zhou , Weiping Shi
DOI: 10.1109/TCAD.2011.2174639
关键词: Algorithm design 、 Elmore delay 、 Buffer (optical fiber) 、 Algorithm 、 Data structure 、 Computer science 、 Linked list 、 Freivalds' algorithm
摘要: Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m the number of sinks and n positions. When small, our significant improvement over recent O(nlog2n) by Shi Li, O(n2) van Ginneken. For b types, algorithms runs in O(b2n+bmn) time, O(bn2) Li Shi. The made possible innovative linked list that can perform addition wire, amortized O(1) smart design pointers. We then present extension cost minimization problem, which improves previous best algorithm. On industrial test cases, new faster than order magnitude.