메뉴 건너뛰기




Volumn 31, Issue 3, 2012, Pages 437-441

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

Author keywords

Buffer insertion; data structure; Elmore delay; interconnect; routing

Indexed keywords

BUFFER INSERTION; COST MINIMIZATION; ELMORE DELAY; INDUSTRIAL TEST CASE; INTERCONNECT; INTERCONNECT DELAY; ROUTING; TIME ALGORITHMS;

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

References (18)
  • 2
    • 0025594311 scopus 로고
    • Buffer placement in distributed RC-tree network for minimal Elmore delay
    • May
    • L. P. P. P. van Ginneken, "Buffer placement in distributed RC-tree network for minimal Elmore delay," in Proc. IEEE Int. Symp. Circuits Syst., May 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
    • 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
    • 20444462290 scopus 로고    scopus 로고
    • A fast algorithm for optimal buffer insertion
    • Jun.
    • W. Shi and Z. Li, "A fast algorithm for optimal buffer insertion," IEEE Trans. Comput.-Aided Des., vol. 24, no. 6, pp. 879-891, Jun. 2005.
    • (2005) IEEE Trans. Comput.-Aided Des. , vol.24 , Issue.6 , pp. 879-891
    • Shi, W.1    Li, Z.2
  • 5
    • 17644386915 scopus 로고    scopus 로고
    • A flexible data structure for efficient buffer insertion
    • Oct.
    • R. Chen and H. Zhou, "A flexible data structure for efficient buffer insertion," in Proc. IEEE Int. Conf. Comput. Des., Oct. 2004, pp. 216-221.
    • (2004) Proc. IEEE Int. Conf. Comput. Des. , pp. 216-221
    • Chen, R.1    Zhou, H.2
  • 6
    • 33244457847 scopus 로고    scopus 로고
    • 2) time algorithm for optimal buffer insertion with b buffer types
    • Mar.
    • 2) time algorithm for optimal buffer insertion with b buffer types," IEEE Trans. Comput.-Aided Des., vol. 25, no. 3, pp. 484-489, Mar. 2006.
    • (2006) IEEE Trans. Comput.-Aided Des. , vol.25 , Issue.3 , pp. 484-489
    • Li, Z.1    Shi, W.2
  • 8
    • 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. Conf. Asia South Pacific Des. Automat., 2004, pp. 609-614.
    • (2004) Proc. Conf. Asia South Pacific Des. Automat. , pp. 609-614
    • Shi, W.1    Li, Z.2    Alpert, C.J.3
  • 9
    • 70350712438 scopus 로고    scopus 로고
    • A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
    • Jul.
    • S. Hu, Z. Li, and C. J. Alpert, "A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion," in Proc. ACM/IEEE Des. Automat. Conf., Jul. 2009, pp. 424-429.
    • (2009) Proc. ACM/IEEE Des. Automat. Conf. , pp. 424-429
    • Hu, S.1    Li, Z.2    Alpert, C.J.3
  • 12
    • 4444327013 scopus 로고    scopus 로고
    • Fast and flexible buffer trees that navigate the physical layout environment
    • C. J. Alpert, M. Hrkic, J. Hu, and S. T. Quay, "Fast and flexible buffer trees that navigate the physical layout environment," in Proc. DAC, 2004, pp. 24-29.
    • (2004) Proc. DAC , pp. 24-29
    • Alpert, C.J.1    Hrkic, M.2    Hu, J.3    Quay, S.T.4
  • 14
    • 77952286035 scopus 로고    scopus 로고
    • Ultra-fast interconnect driven cell cloning for minimizing critical path delay
    • Z. Li, D. A. Papa, C. J. Alpert, S. Hu,W. Shi, C. C. N. Sze, Y. Zhou, "Ultra-fast interconnect driven cell cloning for minimizing critical path delay," in Proc. ISPD, 2010, pp. 75-82.
    • (2010) Proc. ISPD , pp. 75-82
    • Li, Z.1    Papa, D.A.2    Alpert, C.J.3    Hu, S.4    Shi, W.5    Sze, C.C.N.6    Zhou, Y.7
  • 15
    • 3142742282 scopus 로고    scopus 로고
    • Fitted Elmore delay: A simple and accurate interconnect delay model
    • Jul.
    • A. I. Abou-Seido, B. Nowak, and C. Chu, "Fitted Elmore delay: A simple and accurate interconnect delay model," IEEE Trans. Very Large Scale Integr. Syst., vol. 12, no. 7, pp. 691-696, Jul. 2004.
    • (2004) IEEE Trans. Very Large Scale Integr. Syst. , vol.12 , Issue.7 , pp. 691-696
    • Abou-Seido, A.I.1    Nowak, B.2    Chu, C.3
  • 16
    • 79952138060 scopus 로고    scopus 로고
    • Shedding physical synthesis area bloat
    • 503025, [Online]
    • Y. Zhou, C. J. Alpert, Z. Li, C. N. Sze, and L. Trevillyan, "Shedding physical synthesis area bloat," Very Large Scale Integr. Des., vol. 2011, no. 503025, pp. 1-10, 2011 [Online]. Available: http://www.hindawi.com/journals/vlsi/2011/503025/cta
    • (2011) Very Large Scale Integr. Des. , vol.2011 , pp. 1-10
    • Zhou, Y.1    Alpert, C.J.2    Li, Z.3    Sze, C.N.4    Trevillyan, L.5
  • 17
    • 33748598684 scopus 로고    scopus 로고
    • An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
    • Z. Li and W. Shi, "An O(mn) time algorithm for optimal buffer insertion of nets with m sinks," in Proc. Conf. Asia South Pacific Des. Automat., 2006, pp. 320-325.
    • (2006) Proc. Conf. Asia South Pacific Des. Automat. , pp. 320-325
    • Li, Z.1    Shi, W.2


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