메뉴 건너뛰기




Volumn , Issue , 2007, Pages 95-102

Fast dual-vdd buffering based on interconnect prediction and sampling

Author keywords

Buffer insertion; Dual V(dd); Interconnect; Low power; Routing

Indexed keywords

ALGORITHMS; DATA STRUCTURES; NETWORK ROUTING;

EID: 34748845673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1231956.1231976     Document Type: Conference Paper
Times cited : (2)

References (19)
  • 1
    • 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 ISCAS, pp. 865-868, 1990.
    • (1990) ISCAS , pp. 865-868
    • van Ginneken, L.P.P.P.1
  • 2
    • 0029516536 scopus 로고
    • Optimal wire sizing and buffer insertion for low power and a generalized delay model
    • Nov
    • J. Lillis, C. Cheng, and T. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model," in ICCAD, Nov. 1995.
    • (1995) ICCAD
    • Lillis, J.1    Cheng, C.2    Lin, T.3
  • 3
    • 29144449933 scopus 로고    scopus 로고
    • An efficient surface-based low-power buffer insertion algorithm
    • Apr
    • R. Rao, D. Blaauw, D. Sylvester, C. Alpert, and S. Nassif, "An efficient surface-based low-power buffer insertion algorithm," in ISPD, Apr 2005.
    • (2005) ISPD
    • Rao, R.1    Blaauw, D.2    Sylvester, D.3    Alpert, C.4    Nassif, S.5
  • 4
    • 27944470532 scopus 로고    scopus 로고
    • K. Tam and L. He, Power optimal dual-vdd buffered tree considering buffer stations and blockages, in DAC, Jun 2005.
    • K. Tam and L. He, "Power optimal dual-vdd buffered tree considering buffer stations and blockages," in DAC, Jun 2005.
  • 5
    • 0030410359 scopus 로고    scopus 로고
    • Buffered Steiner tree construction with wire sizing for interconnect layout optimization
    • Nov
    • T Okamoto and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization," in ICCAD, Nov. 1996.
    • (1996) ICCAD
    • Okamoto, T.1    Cong, J.2
  • 6
    • 0029716943 scopus 로고    scopus 로고
    • Simultaneous routing and buffer insertion for high performance interconnect
    • J. Lillis, C. Cheng, and T Lin, "Simultaneous routing and buffer insertion for high performance interconnect," in GLVLSI Symp., 1996.
    • (1996) GLVLSI Symp
    • Lillis, J.1    Cheng, C.2    Lin, T.3
  • 8
    • 0037387845 scopus 로고    scopus 로고
    • Buffer insertion with adaptive blockage avoidance
    • J. Hu, C. Alpert, S. Quay, and G. Gandham, "Buffer insertion with adaptive blockage avoidance," TCAD, vol. 22, no. 4, pp. 492-498, 2003.
    • (2003) TCAD , vol.22 , Issue.4 , pp. 492-498
    • Hu, J.1    Alpert, C.2    Quay, S.3    Gandham, G.4
  • 9
    • 0033699071 scopus 로고    scopus 로고
    • J. Cong and X. Yuan, Routing tree construction under fixed buffer locations, in DAC, Jun 2000.
    • J. Cong and X. Yuan, "Routing tree construction under fixed buffer locations," in DAC, Jun 2000.
  • 10
    • 84962221785 scopus 로고    scopus 로고
    • Buffered routing tree construction under buffer placement blockages
    • Jan
    • W. Chen, M. Pedram, and P. Buch, "Buffered routing tree construction under buffer placement blockages," in ASP-DAC, Jan 2002.
    • (2002) ASP-DAC
    • Chen, W.1    Pedram, M.2    Buch, P.3
  • 11
    • 16444367164 scopus 로고    scopus 로고
    • An efficient routing tree construction algorithm with buffer insertio n, wire sizing and obstacle considerations
    • S. Dechu, Z. C. Shen, and C. Chu, "An efficient routing tree construction algorithm with buffer insertio n, wire sizing and obstacle considerations," TCAD, vol. 24, no. 4, pp. 600-608, 2005.
    • (2005) TCAD , vol.24 , Issue.4 , pp. 600-608
    • Dechu, S.1    Shen, Z.C.2    Chu, C.3
  • 12
    • 0041633712 scopus 로고    scopus 로고
    • W. Shi and Z. Li, An o(nlogn) time algorithm for optimal buffer insertion, in DAC, Jun 2003.
    • W. Shi and Z. Li, "An o(nlogn) time algorithm for optimal buffer insertion," in DAC, Jun 2003.
  • 13
    • 79952149496 scopus 로고    scopus 로고
    • Making fast buffer insertion even faster via approximation techniques
    • Jan
    • Z. Li, C. Sze, C. Alpert, J. Hu, and W. Shi, "Making fast buffer insertion even faster via approximation techniques," in ASP-DAC, Jan 2005.
    • (2005) ASP-DAC
    • Li, Z.1    Sze, C.2    Alpert, C.3    Hu, J.4    Shi, W.5
  • 16
    • 34748813768 scopus 로고    scopus 로고
    • Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
    • Jan
    • W. Shi, Z. Li, and C. Alpert, "Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost," in ASP-DAC, Jan 2005.
    • (2005) ASP-DAC
    • Shi, W.1    Li, Z.2    Alpert, C.3
  • 17
    • 0036866915 scopus 로고    scopus 로고
    • A power-optimal repeater insertion methodology for global interconnects in nanometer designs
    • K. Banerjee and A. Mehrotra, "A power-optimal repeater insertion methodology for global interconnects in nanometer designs," TCAD, vol. 49, no. 11, pp. 2001-2007, 2002.
    • (2002) TCAD , vol.49 , Issue.11 , pp. 2001-2007
    • Banerjee, K.1    Mehrotra, A.2
  • 18
    • 34748886163 scopus 로고    scopus 로고
    • Semiconductor Industry Association
    • Semiconductor Industry Association, ITRS, 2003.
    • (2003) ITRS
  • 19
    • 0036180537 scopus 로고    scopus 로고
    • C. J. A. et al, Buffered steiner trees for difficult instances, TCAD, 21, no. 1, pp. 3-14, 2002.
    • C. J. A. et al, "Buffered steiner trees for difficult instances," TCAD, vol. 21, no. 1, pp. 3-14, 2002.


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