Weiping Shi
Zhuo Li
ABSTRACT
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2), where n is the number of possible buffer positions.
- C. J. Alpert and A. Devgan, "Wire segmenting for improved buffer insertion," DAC 1997, 588--593. Google Scholar
Digital Library
- T. Corman, C. E. Leiserson and R. Rivest, Introduction to Algorithms, McGraw Hill, 1990. Google ScholarDigital Library
- M. Kang, W. W.-M. Dai, T. Dillinger and D. LaPotin, "Delay bounded buffered tree construction for timing driven floorplanning," ICCAD 1997, 707--712. Google ScholarDigital Library
- J. Lillis, C. K. Cheng and T.-T. Y. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model," IEEE Trans. Solid-State Circuits 31(3), 1996, 437--447.Google ScholarCross Ref
- J. Lillis, et. al., "New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing," DAC 1996, 359--400. Google ScholarDigital Library
- T. Okamoto and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization," ICCAD 1996, 44--49. Google ScholarDigital Library
- "A fast algorithm for area minimization of slicing floorplans," IEEE Trans. CAD 15(6), 1996, 550--571. Google ScholarDigital Library
- L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," ISCAS 1990, 865--868.Google Scholar
- H. Zhou, D. F. Wong, I. M. Liu and A. Aziz, "Simultaneous routing and buffer insertion with restrictions on buffer locations," IEEE Trans. CAD 19(7), 2000, 819--824. Google ScholarDigital Library
Index Terms
- An O(nlogn) time algorithm for optimal buffer insertion
Recommendations
Path based buffer insertion
DAC '05: Proceedings of the 42nd annual Design Automation ConferenceAlong with the progress of VLSI technology, buffer insertion plays an increasingly critical role on affecting circuit design and performance. Traditional buffer insertion algorithms are mostly net based and therefore often result in sub-optimal delay or ...
A fast algorithm for identifying good buffer insertion candidate locations
ISPD '04: Proceedings of the 2004 international symposium on Physical designVan Ginneken's algorithm [18] for performing buffer insertion is a classic in the field, since it optimally solves the problem subject to a set of fixed buffer insertion candidate locations for a given Steiner topology. The generation of these candidate ...
A fast algorithm for optimal buffer insertion
The classic buffer insertion algorithm of van Ginneken has time and space complexity O(n2), 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, ...
Comments