Journal Article10.1109/TCAD.2005.847942
A fast algorithm for optimal buffer insertion
Weiping Shi,Zhuo Li +1 more
68
TL;DR: A new algorithm that computes the same optimal buffer insertion, but runs much faster, is presented, which significantly improves the performance of all existing algorithms on buffer insertion and buffer sizing.
read more
Abstract: The classic buffer insertion algorithm of van Ginneken has time and space complexity O(n/sup 2/), where n is the number of possible buffer positions. For more than a decade, van Ginneken's algorithm has been the foundation of buffer insertion. In this paper, we present a new algorithm that computes the same optimal buffer insertion, but runs much faster. For 2-pin nets, our time complexity is O(nlogn) and space complexity is O(n). For multipin nets, our time complexity is O(nlog/sup 2/n) and space complexity is O(nlogn). The speedup is achieved by four novel techniques: predictive pruning, candidate tree, fast redundancy check, and fast merging. On industrial test cases, the new algorithms is 2-80 times faster than van Ginneken's algorithm and uses 1/4-1/500 of the memory. Since van Ginneken's algorithm and its variations are used by most existing algorithms on buffer insertion and buffer sizing, our new algorithm significantly improves the performance of all these algorithms. The predictive pruning technique has been applied to buffer cost minimization (Shi et al., 2004), and significantly improved the running time.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fast Algorithms for Slew-Constrained Minimum Cost Buffering
TL;DR: A highly efficient algorithm based on dynamic programming is proposed to optimally solve slew buffering with discrete buffer locations and a new algorithm using the maximum matching technique is developed to handle the difficult cases in which no assumption is made on buffer input slew.
70
Fast algorithms for slew constrained minimum cost buffering
Shiyan Hu,Charles J. Alpert,Jiang Hu,S.K. Karandikar,Zhuo Li,Weiping Shi,Chin Ngai Sze +6 more
- 24 Jul 2006
TL;DR: A highly efficient algorithm based on dynamic programming is proposed to optimally solve slew buffering with discrete buffer locations and a new algorithm is developed to handle the difficult cases in which no assumption is made on buffer input slew.
56
Fast interconnect synthesis with layer assignment
Zhuo Li,Charles J. Alpert,Shiyan Hu,Tuhin Muhmud,Stephen T. Quay,Paul G. Villarrubia +5 more
- 13 Apr 2008
TL;DR: The importance of layer assignment over wire sizing is outlined, and efficient techniques to perform concurrent buffer insertion and layer assignment to fix the electrical and timing problems, while maintaining speed and efficient use of resources are presented.
43
Low-power clock trees for CPUs
Dong-Jin Lee,Myung-Chul Kim,Igor L. Markov +2 more
- 07 Nov 2010
TL;DR: This work develops new modeling techniques and algorithms, as well as a methodology, for clock power optimization subject to tight skew constraints in the presence of process variations, for high-performance CPUs and SoCs.
Making fast buffer insertion even faster via approximation techniques
Zhuo Li,Chin Ngai Sze,Charles J. Alpert,Jiang Hu,Weiping Shi +4 more
- 18 Jan 2005
TL;DR: Experimental results from industrial designs show that using three approximation techniques together yields solutions in 9 to 25 times faster than van Ginneken style algorithms, while only sacrificing less than 3% delay penalty.
37
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
15.4K
Buffer placement in distributed RC-tree networks for minimal Elmore delay
L.P.P.P. van Ginneken
- 01 May 1990
TL;DR: An algorithm is presented for choosing the buffer positions for a wiring tree such that the Elmore delay is minimal, and an extension of the basic algorithm allows minimization of the number of buffers as a secondary objective.
543
Optimal wire sizing and buffer insertion for low power and a generalized delay model
TL;DR: This approach represents the first work on buffer insertion to incorporate signal slew into the delay model while guaranteeing optimality and efficiently computes the complete, optimal power-delay trade-off curve for added design flexibility.
305
Wire segmenting for improved buffer insertion
Charles J. Alpert,Anirudh Devgan +1 more
- 13 Jun 1997
TL;DR: Weshow that using wire segmenting as a precursor to buffer insertion produces solutions within a few percent of optimal, while using only seconds of CPU time is shown.
230