메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 320-325

An O(mn) time algorithm for optimal buffer insertion of nets with m sinks

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; COMPUTER TESTING; DATA STRUCTURES; ELECTRIC WIRE; HEAT LOSSES; INTERCONNECTION NETWORKS;

EID: 33748598684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1118299.1118379     Document Type: Conference Paper
Times cited : (16)

References (13)
  • 2
    • 0025594311 scopus 로고
    • Buffer placement in distributed RC-tree network for minimal Elmore delay
    • L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," in Proc. IEEE Int. Symp. Circuits Syst. 1990, pp. 865-868.
    • (1990) Proc. IEEE Int. Symp. Circuits Syst. , 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
    • 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, 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
    • 20444462290 scopus 로고    scopus 로고
    • A fast algorithm for opitmal buffer insertion
    • W. Shi and Z. Li, "A fast algorithm for opitmal buffer insertion," IEEE Trans. Computer-Aided Design, vol. 24, no. 6, pp. 879-891, 2005.
    • (2005) IEEE Trans. Computer-aided Design , vol.24 , Issue.6 , pp. 879-891
    • Shi, W.1    Li, Z.2
  • 6
    • 17644386915 scopus 로고    scopus 로고
    • A flexible data structure for efficient buffer insertion
    • R. Chen and H. Zhou, "A flexible data structure for efficient buffer insertion," in Proc. IEEE Int. Conf. Computer Design 2004, pp. 216-221.
    • (2004) Proc. IEEE Int. Conf. Computer Design , pp. 216-221
    • Chen, R.1    Zhou, H.2
  • 7
    • 0030410359 scopus 로고    scopus 로고
    • Buffered steiner tree construction with wire sizing for interconnect layout optimization
    • 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 1996, pp. 44-49.
    • (1996) Proc. IEEE/ACM Int. Conf. Computer-aided Design , pp. 44-49
    • Okamoto, T.1    Cong, J.2
  • 8
    • 0036048606 scopus 로고    scopus 로고
    • S-tree: A technique for buffered routing tree synthesis
    • M. Hrkic and J. Lillis, "S-tree: a technique for buffered routing tree synthesis," in Proc. ACM/IEEE Design Automation Conf. 2002, pp. 578-583.
    • (2002) Proc. ACM/IEEE Design Automation Conf. , pp. 578-583
    • Hrkic, M.1    Lillis, J.2
  • 10
    • 2442496236 scopus 로고    scopus 로고
    • Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
    • W. Shi, Z. Li, and C. J. Alpert, "Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost," in Proc. Asia South Pacific Design Automation Conf. 2004, pp. 609-614.
    • (2004) Proc. Asia South Pacific Design Automation Conf. , pp. 609-614
    • Shi, W.1    Li, Z.2    Alpert, C.J.3
  • 11
    • 0025953236 scopus 로고
    • Optimum buffer circuits for driving long uniform lines
    • S. Dhar and M. A. Franklin, "Optimum buffer circuits for driving long uniform lines," IEEE J. Solid-State Circuits, vol. 26, no. 1, pp. 32-40, 1991.
    • (1991) IEEE J. Solid-state Circuits , vol.26 , Issue.1 , pp. 32-40
    • Dhar, S.1    Franklin, M.A.2
  • 12
    • 0032652489 scopus 로고    scopus 로고
    • A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing
    • C. C. N. Chu and D. F. Wong, "A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing," IEEE Trans. Computer-Aided Design, vol. 18, no. 6, pp. 787-798, 1999.
    • (1999) IEEE Trans. Computer-aided Design , vol.18 , Issue.6 , pp. 787-798
    • Chu, C.C.N.1    Wong, D.F.2


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