메뉴 건너뛰기




Volumn 27, Issue 9, 2008, Pages 1643-1656

Congestion-constrained layer assignment for via minimization in global routing

Author keywords

Global routing; Layer assignment; Physical design; Via minimization

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; MATHEMATICAL PROGRAMMING; MULTILAYERS; SYSTEMS ENGINEERING;

EID: 50549090491     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2008.927733     Document Type: Article
Times cited : (76)

References (23)
  • 2
    • 46149111721 scopus 로고    scopus 로고
    • FastRoute: A step to integrate global routing into placement
    • M. Pan and C. Chu, "FastRoute: A step to integrate global routing into placement," in Proc. Int. Conf. Comput.-Aided Des., 2006, pp. 464-471.
    • (2006) Proc. Int. Conf. Comput.-Aided Des , pp. 464-471
    • Pan, M.1    Chu, C.2
  • 3
    • 46649104482 scopus 로고    scopus 로고
    • FastRoute 2.0: A high-quality and efficient global router
    • M. Pan and C. Chu, "FastRoute 2.0: A high-quality and efficient global router," in Proc. Asia South Pacific. Des. Autom. Conf., 2007, pp. 250-255.
    • (2007) Proc. Asia South Pacific. Des. Autom. Conf , pp. 250-255
    • Pan, M.1    Chu, C.2
  • 4
    • 34547230815 scopus 로고    scopus 로고
    • BoxRouter: A new global router based on box expansion and progressive ILP
    • M. Cho and D. Z. Pan, "BoxRouter: A new global router based on box expansion and progressive ILP," in Proc. Des. Autom. Conf., 2006, pp. 373-378.
    • (2006) Proc. Des. Autom. Conf , pp. 373-378
    • Cho, M.1    Pan, D.Z.2
  • 5
    • 0021404023 scopus 로고
    • The TimberWolf placement and routing package
    • Apr
    • C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf placement and routing package," IEEE J. Solid-State Circuits, vol. SSC-20, no. 2, pp. 510-522, Apr. 1985.
    • (1985) IEEE J. Solid-State Circuits , vol.SSC-20 , Issue.2 , pp. 510-522
    • Sechen, C.1    Sangiovanni-Vincentelli, A.2
  • 7
    • 0033355612 scopus 로고    scopus 로고
    • Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic
    • Oct
    • L. E. Liu and C. Sechen, "Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 18, no. 10, pp. 1442-1451, Oct. 1997.
    • (1997) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.18 , Issue.10 , pp. 1442-1451
    • Liu, L.E.1    Sechen, C.2
  • 8
  • 9
    • 43349093583 scopus 로고    scopus 로고
    • BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router
    • M. Cho, K. Lu, K. Yuan, and D. Z. Pan, "BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router," in Proc. Int. Conf. Comput-Aided Des., 2007, pp. 503-508.
    • (2007) Proc. Int. Conf. Comput-Aided Des , pp. 503-508
    • Cho, M.1    Lu, K.2    Yuan, K.3    Pan, D.Z.4
  • 10
  • 12
    • 0024681081 scopus 로고
    • Layer assignment for VLSI interconnect delay minimization
    • Jun
    • M. J. Ciesielski, "Layer assignment for VLSI interconnect delay minimization," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 8, no. 6, pp. 702-707, Jun. 1989.
    • (1989) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.8 , Issue.6 , pp. 702-707
    • Ciesielski, M.J.1
  • 13
    • 0027206842 scopus 로고    scopus 로고
    • J. D. Cho, S. Raje, M. Sarrafzadeh, M. Sriram, and S. M. Kang, Crosstalk-minimum, layer assignment, in Proc. Custom Integr. Circuits Conf., 1993, pp. 29.7.1-29.7.4.
    • J. D. Cho, S. Raje, M. Sarrafzadeh, M. Sriram, and S. M. Kang, "Crosstalk-minimum, layer assignment," in Proc. Custom Integr. Circuits Conf., 1993, pp. 29.7.1-29.7.4.
  • 15
    • 50249160679 scopus 로고    scopus 로고
    • Online, Available
    • ISPD 2007 Global Routing Contest. [Online]. Available: http://www. sigda.org/ispd2007/co.ntest.html
    • ISPD 2007 Global Routing Contest
  • 17
    • 50549101805 scopus 로고    scopus 로고
    • FGR 1.1. [Online]. Available: http://vlsicad.eecs.um.ich.edu/BK/FGR
    • FGR 1.1. [Online]. Available: http://vlsicad.eecs.um.ich.edu/BK/FGR
  • 19
    • 0032638880 scopus 로고    scopus 로고
    • An efficient approach to multilayer layer assignment with an application to via minimization
    • May
    • C. C. Chang and J. Cong, "An efficient approach to multilayer layer assignment with an application to via minimization," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 18, no. 5, pp. 608-620, May 1999.
    • (1999) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.18 , Issue.5 , pp. 608-620
    • Chang, C.C.1    Cong, J.2
  • 20
    • 0024770040 scopus 로고    scopus 로고
    • N. J. Naclerio, S. Masuda, and K. Nakajima, 'The via minimization, problem is NP-complete, IEEE Trans. Comput., 38, no. 11, pp. 1604-1608, Nov. 1989.
    • N. J. Naclerio, S. Masuda, and K. Nakajima, 'The via minimization, problem is NP-complete," IEEE Trans. Comput., vol. 38, no. 11, pp. 1604-1608, Nov. 1989.
  • 21
    • 0024013817 scopus 로고
    • Layer assignment problem for three-layer routing
    • May
    • K. C. Chang and H. C. Du, "Layer assignment problem for three-layer routing," IEEE Trans. Comput., vol. 37, no. 5, pp. 625-632, May 1988.
    • (1988) IEEE Trans. Comput , vol.37 , Issue.5 , pp. 625-632
    • Chang, K.C.1    Du, H.C.2
  • 22
    • 50549098408 scopus 로고    scopus 로고
    • private communication
    • J. A. Roy, 2008. private communication.
    • (2008)
    • Roy, J.A.1


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