A flexible data structure for efficient buffer insertion

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn , Issue , 2004, Pages 216-221

  Chen, Ruiming ^a   Zhou, Hai ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH ALGORITHM; BINARY TREE; BUFFER INSERTION; INTERCONNECT DELAYS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DYNAMIC PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; TREES (MATHEMATICS);

BUFFER STORAGE;

EID: 17644386915     PISSN: 10636404     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. C. Alpert and A. Devgan. Wire segmenting for improved buffer insertion. In Proc. of the Design Automation Conf., pages 588-593, 1997.
2. M. Kang, W. W.-M. Dai, T. Dillinger, and D. LaPotin. Delay bounded buffered tree construction for timing driven floorplanning. In Proc. Intl. Conf. on Computer-Aided Design, pages 707-712, 1997.
3. 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:437-447, 1996.
4. J. Lillis et al. New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing. In Proc. of the Design Automation Conf., pages 395-400, 1996.
5. T. Okamoto and J. Cong. Buffered Steiner tree construction with wire sizing for interconnect layout optimization. In Proc. Intl. Conf. on Computer-Aided Design, pages 44-49, 1996.
6. L. P. P. P. van Ginneken. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In Proc. Intl. Symposium on Circuits and Systems, pages 865-868, 1990.
7. Hai Zhou, D. F. Wong, I-Min Liu, and Adnan Aziz. Simultaneous routing and buffer insertion with restrictions on buffer locations. Proc. of the Design Automation Conf., 1999.
8. Weiping Shi and Zhuo Li. An O(nlogn) time algorithm for optimal buffer insertion. In Proc. of the Design Automation Conf., pages 580-585, 2003.
9. V. Khandelwal, A. Davoodi, A. Nanavati, and A. Srivastava. A probabilistic approach to buffer insertion. In Proc. Intl. Conf. on Computer-Aided Design, pages 560-567, 2003.
10. C. J. Alpert, M. Hrkic, and S. T. Quay. A fast algorithm for identifying good buffer insertion candidate locations. In International Symposium on Physical Design, pages 47-52, 2004.
11. P. Saxena, N. Menezes, P. Cocchini, and Desmond A. Kirkpatrick. The scaling challenge: Can correct-by-construction design help? In International Symposium on Physical Design, pages 51-58, 2003.
12. Weiping Shi. A fast algorithm for area minimization of slicing floorplans. tcad, 15:550-557, 1996.
13. L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, 59:91-101, 1983.
14. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), 1990.
15. K. Keutzer. Dagon: Technology binding and local optimization by dag matching. In Proc. of the Design Automation Conf., pages 617-623, June 1987.
16. K. Chaudhary and M. Pedram. A near optimal altorithm for technology mapping minimizing area under delay constraints. In Proc. of the Design Automation Conf., pages 492-498, July 1992.
17. R. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35:677-691, August 1986.
18. Weiping Shi. http://ece.tamu.edu/~wshi.