메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages

Efficient timing-driven incremental routing for VLSI circuits using DFS and localized slack-satisfaction computations

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; OPTIMIZATION; ROUTING PROTOCOLS; SOFTWARE ENGINEERING; VLSI CIRCUITS;

EID: 34047177514     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2006.244117     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 1
    • 34047125020 scopus 로고    scopus 로고
    • J.M. Emmert and D. Bhatia. Incremental Routing in FPGAs. Proc. IEEE Int. ASIC Conference and Exhibit,'98.
    • J.M. Emmert and D. Bhatia. "Incremental Routing in FPGAs". Proc. IEEE Int. ASIC Conference and Exhibit,'98.
  • 2
    • 0033726537 scopus 로고    scopus 로고
    • Incremental Physical Design
    • April
    • J. Cone and M. Sarrafzadeh. 'Incremental Physical Design". ISPD, April 2000, pp. 84-92.
    • (2000) ISPD , pp. 84-92
    • Cone, J.1    Sarrafzadeh, M.2
  • 3
    • 0036826706 scopus 로고    scopus 로고
    • A Search-Based Bump-and-Refit Approach to Incremental Routing for ECO Appl. in FPGAs
    • S. Dutt, V. Verma and H. Arslan, "A Search-Based Bump-and-Refit Approach to Incremental Routing for ECO Appl. in FPGAs", ACM TODAES, pp.664-693, 2002.
    • (2002) ACM TODAES , pp. 664-693
    • Dutt, S.1    Verma, V.2    Arslan, H.3
  • 5
    • 17644369352 scopus 로고    scopus 로고
    • A Depth-First Search Controlled Gridless incremental routing Algorithm for VLSI Circuits
    • H. Arslan and S. Dutt, "A Depth-First Search Controlled Gridless incremental routing Algorithm for VLSI Circuits", ICCD, 2004, pp. 86-92.
    • (2004) ICCD , pp. 86-92
    • Arslan, H.1    Dutt, S.2
  • 6
    • 0031678748 scopus 로고    scopus 로고
    • Routing Tree Topology Construction to Meet Interconnect Timing Constraints
    • H. Hou and S. S. Sapatnekar. "Routing Tree Topology Construction to Meet Interconnect Timing Constraints", ISPD, pp. 205-210, 1998.
    • (1998) ISPD , pp. 205-210
    • Hou, H.1    Sapatnekar, S.S.2
  • 7
    • 0027803156 scopus 로고
    • Fidelity and Near-Optimality of Elmore-Based Routing Constructions
    • K.D. Boese and A.B. Kahng and B.A. McCoy and G. Robins, "Fidelity and Near-Optimality of Elmore-Based Routing Constructions", ICCD, pp.81-84, 1993.
    • (1993) ICCD , pp. 81-84
    • Boese, K.D.1    Kahng, A.B.2    McCoy, B.A.3    Robins, G.4
  • 8
    • 0029520879 scopus 로고
    • Near-Optimal Critical Sink Routing Tree Constructions
    • K.D. Boese and A.B. Kahng and B.A. McCoy and G. Robins. "Near-Optimal Critical Sink Routing Tree Constructions", IEEE-TCAD, pp. 1417-1436, 1995.
    • (1995) IEEE-TCAD , pp. 1417-1436
    • Boese, K.D.1    Kahng, A.B.2    McCoy, B.A.3    Robins, G.4
  • 9
    • 0030729916 scopus 로고    scopus 로고
    • A New Timing-Driven Multilayer MCM/IC Routing Algorithm
    • D. Wang and E. S. Kuh. "A New Timing-Driven Multilayer MCM/IC Routing Algorithm", IEEE-MCMC, pp. 89-94, 1997.
    • (1997) IEEE-MCMC , pp. 89-94
    • Wang, D.1    Kuh, E.S.2
  • 10
    • 2942667853 scopus 로고    scopus 로고
    • An ECO Algorithm for Eliminating Crosstalk Violations
    • H. Xiang and K-Y. Chao and M. D. F. Wong. "An ECO Algorithm for Eliminating Crosstalk Violations", ISPD, 2004.
    • (2004) ISPD
    • Xiang, H.1    Chao, K.-Y.2    Wong, M.D.F.3


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