메뉴 건너뛰기




Volumn 25, Issue 3, 2006, Pages 484-489

An O(bn 2) time algorithm for optimal buffer insertion with b buffer types

Author keywords

Buffer insertion; Data structure; Elmore delay; Interconnect; Routing

Indexed keywords

BUFFER INSERTION; ELMORE DELAY; INTERCONNECTS; ROUTING;

EID: 33244457847     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.854631     Document Type: Article
Times cited : (10)

References (14)
  • 2
    • 0025594311 scopus 로고
    • Buffer placement in distributed RC-tree network for minimal Elmore delay
    • New Orleans, LA
    • L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," in Proc. IEEE Int. Symp. Circuits Systems, New Orleans, LA, 1990, pp. 865-868.
    • (1990) Proc. IEEE Int. Symp. Circuits Systems , pp. 865-868
    • Van Ginneken, L.P.P.P.1
  • 3
    • 0030110490 scopus 로고    scopus 로고
    • Optimal wire sizing and buffer insertion for low power and a generalized delay model
    • Mar.
    • 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 J. Solid-State Circuits, vol. 31, no. 3, pp. 437-447, Mar. 1996.
    • (1996) IEEE J. Solid-state Circuits , vol.31 , Issue.3 , pp. 437-447
    • Lillis, J.1    Cheng, C.K.2    Lin, T.-T.Y.3
  • 4
  • 5
    • 0030410359 scopus 로고    scopus 로고
    • Buffered steiner tree construction with wire sizing for interconnect layout optimization
    • San Jose, CA
    • T. Okamoto and J. Cong, "Buffered steiner tree construction with wire sizing for interconnect layout optimization," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, San Jose, CA, 1996, pp. 44-49.
    • (1996) Proc. IEEE/ACM Int. Conf. Computer-aided Design , pp. 44-49
    • Okamoto, T.1    Cong, J.2
  • 6
    • 0034229328 scopus 로고    scopus 로고
    • Simultaneous routing and buffer insertion with restrictions on buffer locations
    • Jul.
    • H. Zhou, D. F. Wong, I. M. Liu, and A. Aziz, "Simultaneous routing and buffer insertion with restrictions on buffer locations," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 19, no. 7, pp. 819-824, Jul. 2000.
    • (2000) IEEE Trans. Comput.-aided Des. Integr. Circuits Syst. , vol.19 , Issue.7 , pp. 819-824
    • Zhou, H.1    Wong, D.F.2    Liu, I.M.3    Aziz, A.4
  • 7
    • 0036048606 scopus 로고    scopus 로고
    • S-tree: A technique for buffered routing tree synthesis
    • New Orleans, LA
    • M. Hrkic and J. Lillis, "S-tree: A technique for buffered routing tree synthesis," in Proc. ACM/IEEE Design Automation Conf., New Orleans, LA, 2002, pp. 578-583.
    • (2002) Proc. ACM/IEEE Design Automation Conf. , pp. 578-583
    • Hrkic, M.1    Lillis, J.2
  • 8
    • 0036374274 scopus 로고    scopus 로고
    • Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost and blockages
    • Del Mar, CA
    • _, "Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost and blockages," in Int. Symp. Physical Design, Del Mar, CA, 2002, pp. 98-103.
    • (2002) Int. Symp. Physical Design , pp. 98-103
  • 10
    • 2442496236 scopus 로고    scopus 로고
    • Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
    • Yokohama, Japan
    • W. Shi, Z. Li, and C. J. Alpert, "Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost," in Proc. Conf. Asia South Pacific Design Automation, Yokohama, Japan, 2004, pp. 609-614.
    • (2004) Proc. Conf. Asia South Pacific Design Automation , pp. 609-614
    • Shi, W.1    Li, Z.2    Alpert, C.J.3
  • 12
    • 0030697661 scopus 로고    scopus 로고
    • Wire segmenting for improved buffer insertion
    • Anaheim, CA
    • C. Alpert and A. Devgan, "Wire segmenting for improved buffer insertion," in Proc. ACM/IEEE Design Automation Conf., Anaheim, CA, 1997, pp. 588-593.
    • (1997) Proc. ACM/IEEE Design Automation Conf. , pp. 588-593
    • Alpert, C.1    Devgan, A.2
  • 13
    • 49649136358 scopus 로고
    • An efficient algorithm for determining the convex hull of a finite planar set
    • R. L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set," Inf. Process. Lett., vol. 1, no. 4, pp. 132-133, 1972.
    • (1972) Inf. Process. Lett. , vol.1 , Issue.4 , pp. 132-133
    • Graham, R.L.1
  • 14
    • 0041633712 scopus 로고    scopus 로고
    • An O(nlogn) time algorithm for optimal buffer insertion
    • Anaheim, CA
    • W. Shi and Z. Li, "An O(nlogn) time algorithm for optimal buffer insertion," in Proc. ACM/IEEE Design Automation Conf., Anaheim, CA, 2003, pp. 580-585.
    • (2003) Proc. ACM/IEEE Design Automation Conf. , pp. 580-585
    • Shi, W.1    Li, Z.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.