메뉴 건너뛰기




Volumn 28, Issue 4, 2009, Pages 528-540

Archer: A history-based global routing algorithm

Author keywords

Congestion optimization; Global routing; Lagrangian relaxation; Steiner tree optimization

Indexed keywords

LAGRANGE MULTIPLIERS; MARINE BIOLOGY; OPTIMIZATION; ROUTERS; TREES (MATHEMATICS);

EID: 62949084762     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2009.2013991     Document Type: Article
Times cited : (36)

References (25)
  • 1
    • 0033705083 scopus 로고    scopus 로고
    • Provably good global routing by a new approximation algorithm for multicommodity flow
    • C. Albrecht, "Provably good global routing by a new approximation algorithm for multicommodity flow," in Proc. Int. Symp. Phys. Des., 2000, pp. 19-25.
    • (2000) Proc. Int. Symp. Phys. Des , pp. 19-25
    • Albrecht, C.1
  • 2
    • 50249141934 scopus 로고    scopus 로고
    • Steiner tree construction based on congestion for the global routing problem
    • L. Behjat and A. Vanneli, "Steiner tree construction based on congestion for the global routing problem," in Proc. IEEE Int. Workshop Syst. Chip Real-Time Appl., 2003, pp. 28-31.
    • (2003) Proc. IEEE Int. Workshop Syst. Chip Real-Time Appl , pp. 28-31
    • Behjat, L.1    Vanneli, A.2
  • 4
    • 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. IEEE/ACM ICCAD, 2007, pp. 503-508.
    • (2007) Proc. IEEE/ACM ICCAD , pp. 503-508
    • Cho, M.1    Lu, K.2    Yuan, K.3    Pan, D.Z.4
  • 5
    • 36348965494 scopus 로고    scopus 로고
    • BoxRouter: A new global router based on box expansion and progressive ILP
    • Dec
    • M. Cho and D. Z. Pan, "BoxRouter: A new global router based on box expansion and progressive ILP," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 26, no. 12, pp. 2130-2143, Dec. 2007.
    • (2007) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.26 , Issue.12 , pp. 2130-2143
    • Cho, M.1    Pan, D.Z.2
  • 6
    • 29144520577 scopus 로고    scopus 로고
    • Fast and accurate rectilinear Steiner minimal tree algorithm for VLSI design
    • C. Chu and Y. Wong, "Fast and accurate rectilinear Steiner minimal tree algorithm for VLSI design," in Proc. Int. Symp. Phys. Des., 2005, pp. 28-35.
    • (2005) Proc. Int. Symp. Phys. Des , pp. 28-35
    • Chu, C.1    Wong, Y.2
  • 7
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • Jan
    • M. L. Fisher, "The Lagrangian relaxation method for solving integer programming problems," Manage. Sci., vol. 27, no. l.pp. 1- 18. Jan. 1981.
    • (1981) Manage. Sci , vol.27 , Issue.L , pp. 1-18
    • Fisher, M.L.1
  • 8
    • 43349104421 scopus 로고    scopus 로고
    • A new global router for modern designs
    • J.-R. Gao, P.-C. Wu, and T.-C. Wang, "A new global router for modern designs," in Proc. ASP-DAC, 2008, pp. 232-237.
    • (2008) Proc. ASP-DAC , pp. 232-237
    • Gao, J.-R.1    Wu, P.-C.2    Wang, T.-C.3
  • 9
    • 0002554041 scopus 로고
    • Lagrangian relaxation and its uses in integer programming
    • A. M. Geoffrion. "Lagrangian relaxation and its uses in integer programming," Math. Program., vol. 2, pp. 82-114, 1974.
    • (1974) Math. Program , vol.2 , pp. 82-114
    • Geoffrion, A.M.1
  • 10
    • 0043092229 scopus 로고    scopus 로고
    • Improved global routing through congestion estimation
    • R. T. Hadsell and P. H. Madden, "Improved global routing through congestion estimation," in Proc. Des. Autom. Conf., 2003. pp. 28-31.
    • (2003) Proc. Des. Autom. Conf , pp. 28-31
    • Hadsell, R.T.1    Madden, P.H.2
  • 11
    • 0000814769 scopus 로고
    • On Steiner's problem with rectilinear distance
    • M. Hanan, "On Steiner's problem with rectilinear distance," SI AM J. Appl. Math., vol. 14, no. 2, pp. 255-265, 1966.
    • (1966) SI AM J. Appl. Math , vol.14 , Issue.2 , pp. 255-265
    • Hanan, M.1
  • 12
    • 0016025814 scopus 로고
    • Validation of subgradient optimization
    • Dec
    • M. H. Held, P. Wolfe, and H. D. Crowder, "Validation of subgradient optimization," Math. Program., vol. 6, no. 1, pp. 62-88, Dec. 1974.
    • (1974) Math. Program , vol.6 , Issue.1 , pp. 62-88
    • Held, M.H.1    Wolfe, P.2    Crowder, H.D.3
  • 14
    • 0037389313 scopus 로고    scopus 로고
    • Timing-driven routing for FPGAs based on Lagrangian relaxation
    • Apr
    • S. Lee and M. D. F. Wong, "Timing-driven routing for FPGAs based on Lagrangian relaxation," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, no. 4, pp. 506-510, Apr. 2003.
    • (2003) IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst , vol.22 , Issue.4 , pp. 506-510
    • Lee, S.1    Wong, M.D.F.2
  • 16
    • 43349083037 scopus 로고    scopus 로고
    • MaizeRouter: Engineering an effective global router
    • M. D. Moffitt, "MaizeRouter: Engineering an effective global router," in Proc. ASP-DAC, 2008, pp. 226-231.
    • (2008) Proc. ASP-DAC , pp. 226-231
    • Moffitt, M.D.1
  • 19
    • 33845635280 scopus 로고    scopus 로고
    • A length-matching routing algorithm for high-performance printed circuit boards
    • Dec
    • M. M. Ozdal and M. D. F. Wong, "A length-matching routing algorithm for high-performance printed circuit boards," IEEE Trans. Comput. -Aided Design Integr. Circuits Syst., vol. 25, no. 12, pp. 2784-2794, Dec. 2006.
    • (2006) IEEE Trans. Comput. -Aided Design Integr. Circuits Syst , vol.25 , Issue.12 , pp. 2784-2794
    • Ozdal, M.M.1    Wong, M.D.F.2
  • 20
    • 43349087745 scopus 로고    scopus 로고
    • Archer: A history-driven global routing algorithm
    • M. M. Ozdal and M. D. F. Wong, "Archer: A history-driven global routing algorithm," in Proc. IEEE/ACM ICCAD, 2007, pp.488-195.
    • (2007) Proc. IEEE/ACM ICCAD , pp. 488-195
    • Ozdal, M.M.1    Wong, M.D.F.2
  • 21
    • 0347409193 scopus 로고    scopus 로고
    • Length matching routing for highspeed printed circuit boards
    • Nov
    • M. M. Ozdal and M. D. F. Wong, "Length matching routing for highspeed printed circuit boards," in Proc. IEEE/ACM ICCAD, Nov. 2003, pp. 394-100.
    • (2003) Proc. IEEE/ACM ICCAD , pp. 394-100
    • Ozdal, M.M.1    Wong, M.D.F.2
  • 22
    • 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
  • 23
    • 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. ASP-DAC, 2007, pp. 250-255.
    • (2007) Proc. ASP-DAC , pp. 250-255
    • Pan, M.1    Chu, C.2
  • 24
    • 62949226592 scopus 로고    scopus 로고
    • private communication with Igor Markov
    • Apr. 2008. private communication with Igor Markov.
    • (2008)
    • Apr1
  • 25
    • 43349099015 scopus 로고    scopus 로고
    • High-performance routing at the nanometer scale
    • J. A. Roy and I. L. Markov, "High-performance routing at the nanometer scale," in Proc. IEEE/ACM ICCAD, 2007, pp. 496-502.
    • (2007) Proc. IEEE/ACM ICCAD , pp. 496-502
    • Roy, J.A.1    Markov, I.L.2


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