메뉴 건너뛰기




Volumn , Issue , 2005, Pages 509-514

Path based buffer insertion

Author keywords

Buffer Insertion; Global Routing; Interconnect Synthesis; Layout; Physical Design; Power Minimization

Indexed keywords

ALGORITHMS; COSTS; ESTIMATION;

EID: 27944511471     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dac.2005.193862     Document Type: Conference Paper
Times cited : (20)

References (23)
  • 1
    • 0347761312 scopus 로고    scopus 로고
    • Simultaneous driver sizing and buffer insertion using delay penalty estimation technique
    • January
    • C. J. Alpert, C. Chu, G. Gandham, M. Hrkic, J. Hu, C. Kashyap, and S. T. Quay. Simultaneous driver sizing and buffer insertion using delay penalty estimation technique. IEEE Trans. on CAD, 23(1):136-141, January 2004.
    • (2004) IEEE Trans. on CAD , vol.23 , Issue.1 , pp. 136-141
    • Alpert, C.J.1    Chu, C.2    Gandham, G.3    Hrkic, M.4    Hu, J.5    Kashyap, C.6    Quay, S.T.7
  • 2
    • 0030697661 scopus 로고    scopus 로고
    • Wire segmenting for improved buffer insertion
    • C. J. Alpert and A. Devgan. Wire segmenting for improved buffer insertion. In Proc. of DAC, pages 588-593, 1997.
    • (1997) Proc. of DAC , pp. 588-593
    • Alpert, C.J.1    Devgan, A.2
  • 3
    • 0031619501 scopus 로고    scopus 로고
    • Buffer insertion for noise and delay optimization
    • C. J. Alpert, A. Devgan, and S. T. Quay. Buffer insertion for noise and delay optimization. In Proc. of DAC, pages 362-367, 1998.
    • (1998) Proc. of DAC , pp. 362-367
    • Alpert, C.J.1    Devgan, A.2    Quay, S.T.3
  • 4
    • 0032650596 scopus 로고    scopus 로고
    • Buffer insertion with accurate gate and interconnect delay computation
    • C. J. Alpert, A. Devgan, and S. T. Quay. Buffer insertion with accurate gate and interconnect delay computation. In Proc. of DAC, pages 479-484, 1999.
    • (1999) Proc. of DAC , pp. 479-484
    • Alpert, C.J.1    Devgan, A.2    Quay, S.T.3
  • 5
    • 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. of DAC, pages 24-29, 2004.
    • (2004) Proc. of DAC , pp. 24-29
    • Alpert, C.J.1    Hrkic, M.2    Hu, J.3    Quay, S.T.4
  • 6
    • 16244382538 scopus 로고    scopus 로고
    • Accurate estimation of global buffer delay within a floorplan
    • C. J. Alpert, J. Hu, S. S. Sapatnekar, and C. N. Sze. Accurate Estimation of Global Buffer Delay within a Floorplan. In Proc. of ICCAD, pages 706-711, 2004.
    • (2004) Proc. of ICCAD , pp. 706-711
    • Alpert, C.J.1    Hu, J.2    Sapatnekar, S.S.3    Sze, C.N.4
  • 8
    • 0032652489 scopus 로고    scopus 로고
    • A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing
    • June
    • C. C. N. Chu and D. F. Wong. A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing. IEEE Trans. on CAD, 18(6):787-798, June 1999.
    • (1999) IEEE Trans. on CAD , vol.18 , Issue.6 , pp. 787-798
    • Chu, C.C.N.1    Wong, D.F.2
  • 9
    • 23044525393 scopus 로고    scopus 로고
    • Closed form solution to simultaneous buffer insertion/sizing and wire sizing
    • July
    • C. C. N. Chu and D. F. Wong. Closed form solution to simultaneous buffer insertion/sizing and wire sizing. ACM Trans. on Design Automation of Electronic Systems, 6(3):343-371, July 2001.
    • (2001) ACM Trans. on Design Automation of Electronic Systems , vol.6 , Issue.3 , pp. 343-371
    • Chu, C.C.N.1    Wong, D.F.2
  • 11
    • 0025953236 scopus 로고
    • Optimum buffer circuits for driving long uniform lines
    • January
    • S. Dhar and M. A. Franklin. Optimum buffer circuits for driving long uniform lines. IEEE Journal of Solid-State Circuits, 26(1):32-38, January 1991.
    • (1991) IEEE Journal of Solid-state Circuits , vol.26 , Issue.1 , pp. 32-38
    • Dhar, S.1    Franklin, M.A.2
  • 12
    • 0025594311 scopus 로고
    • Buffer placement in distributed RC-tree networks for minimal Elmore delay
    • L. P. P P. van Ginneken. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In Proc. of ISCAS, pages 865-868, 1990.
    • (1990) Proc. of ISCAS , pp. 865-868
    • Van Ginneken, L.P.P.P.1
  • 13
    • 2342420714 scopus 로고    scopus 로고
    • Closed-form expressions for extending step delay and slew metrics to ramp inputs for RC trees
    • April
    • C. V. Kashyap, C. J. Alpert, F. Liu, and A. Devgan. Closed-form expressions for extending step delay and slew metrics to ramp inputs for RC trees IEEE Trans. on CAD, 23(4):509-516, April 2004.
    • (2004) IEEE Trans. on CAD , vol.23 , Issue.4 , pp. 509-516
    • Kashyap, C.V.1    Alpert, C.J.2    Liu, F.3    Devgan, A.4
  • 14
    • 0032303080 scopus 로고    scopus 로고
    • Interleaving buffer insertion and transistor sizing into a single optimization
    • December
    • Y. Jiang, S. S. Sapatnekar, C. Bamji, and J. Kim. Interleaving buffer insertion and transistor sizing into a single optimization. IEEE Trans. on VLSI Systems, 6(4):625-633, December 1998.
    • (1998) IEEE Trans. on VLSI Systems , vol.6 , Issue.4 , pp. 625-633
    • Jiang, Y.1    Sapatnekar, S.S.2    Bamji, C.3    Kim, J.4
  • 15
    • 0026175373 scopus 로고
    • Incremental techniques for the identification of statically sensitizable critical paths
    • Y.-C. Ju, and R. A. Saleh. Incremental techniques for the identification of statically sensitizable critical paths. In Proc. of DAC, pages 541-546, 1991.
    • (1991) Proc. of DAC , pp. 541-546
    • Ju, Y.-C.1    Saleh, R.A.2
  • 16
    • 79952149496 scopus 로고    scopus 로고
    • Making fast buffer insertion even faster via approximation techniques
    • Z. Li, C. N. Sze, C. J. Alpert, J. Hu, and W. Shi. Making fast buffer insertion even faster via approximation techniques. In Proc. of ASPDAC, pages 13-18, 2005.
    • (2005) Proc. of ASPDAC , pp. 13-18
    • Li, Z.1    Sze, C.N.2    Alpert, C.J.3    Hu, J.4    Shi, W.5
  • 18
    • 0030110490 scopus 로고    scopus 로고
    • Optimal wire sizing and buffer insertion for low power and a generalized delay model
    • March
    • J. Lillis, C. K. Cheng, and T. Y. Lin. Optimal wire sizing and buffer insertion for low power and a generalized delay model. IEEE Journal of Solid-State Circuits, 31(3):437-447, March 1996.
    • (1996) IEEE Journal of Solid-state Circuits , vol.31 , Issue.3 , pp. 437-447
    • Lillis, J.1    Cheng, C.K.2    Lin, T.Y.3
  • 19
    • 84893706459 scopus 로고    scopus 로고
    • Meeting delay constraints in DSM by minimal repeater insertion
    • I.-M. Liu, A. Aziz, and D. F. Wong. Meeting delay constraints in DSM by minimal repeater insertion. In Proc. of DATE, pages 436-441, 2000.
    • (2000) Proc. of DATE , pp. 436-441
    • Liu, I.-M.1    Aziz, A.2    Wong, D.F.3
  • 20
    • 27944507861 scopus 로고    scopus 로고
    • An efficient buffer insertion algorithm for large networks based on Lagrangian relaxation
    • I.-M. Liu, A. Aziz, D. F. Wong, and H. Zhou. An efficient buffer insertion algorithm for large networks based on Lagrangian relaxation. In Proc. of ICCD, pages 614-621, 1999.
    • (1999) Proc. of ICCD , pp. 614-621
    • Liu, I.-M.1    Aziz, A.2    Wong, D.F.3    Zhou, H.4
  • 23
    • 0041633712 scopus 로고    scopus 로고
    • An O(n log n) time algorithm for optimal buffer insertion
    • W. Shi and Z. Li. An O(n log n) time algorithm for optimal buffer insertion. In Proc. of DAC, pages 580-585, 2003.
    • (2003) Proc. of DAC , pp. 580-585
    • Shi, W.1    Li, Z.2


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