메뉴 건너뛰기




Volumn , Issue , 2005, Pages 585-590

Timing-driven placement by grid-warping

Author keywords

Algorithms; Placement

Indexed keywords

MATHEMATICAL MODELS; MICROPROCESSOR CHIPS; OPTIMIZATION;

EID: 27944435301     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065579.1065732     Document Type: Conference Paper
Times cited : (13)

References (23)
  • 1
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • 13 May
    • S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, 13 May 1983.
    • (1983) Science , vol.220 , Issue.4598
    • Kirkpatrick, S.1    Gelatt Jr., C.D.2    Vecchi, M.P.3
  • 3
    • 0026131224 scopus 로고
    • Gordian: VLSI placement by quadratic programming and slicing optimization
    • March
    • Kleinhans, G. Sigl, F. Johannes, and K. Antreich, "Gordian: VLSI placement by quadratic programming and slicing optimization," IEEE Trans. CAD, vol. 10, no.3, March 1991.
    • (1991) IEEE Trans. CAD , vol.10 , Issue.3
    • Kleinhans, G.S.1    Johannes, F.2    Antreich, K.3
  • 4
    • 0028516550 scopus 로고
    • Iterative placement improvement by network flow methods
    • Oct
    • K. Doll, F. M. Johannes, K. J. Antreich, "Iterative placement improvement by network flow methods," Proc. IEEE Trans. CAD, vol. 13, no. 10, Oct 1994.
    • (1994) Proc. IEEE Trans. CAD , vol.13 , Issue.10
    • Doll, K.1    Johannes, F.M.2    Antreich, K.J.3
  • 6
    • 0030718152 scopus 로고    scopus 로고
    • Algorithms for large-scale flat placement
    • June
    • J. Vygen, "Algorithms for large-scale flat placement," Proc ACM/IEEE DAC, June 1997.
    • (1997) Proc ACM/IEEE DAC
    • Vygen, J.1
  • 10
    • 0026174925 scopus 로고
    • Analytical placement: A linear or a quadratic objective function?
    • June
    • G. Sigl, K. Doll, F. M. Johannes, "Analytical placement: A linear or a quadratic objective function?" Proc. ACM/IEEE DAC, June 1991.
    • (1991) Proc. ACM/IEEE DAC
    • Sigl, G.1    Doll, K.2    Johannes, F.M.3
  • 11
    • 0033697586 scopus 로고    scopus 로고
    • Can recursive bisection alone produce routable placements?
    • June
    • A. Caldwell, A. Kahng, I. Markov, "Can recursive bisection alone produce routable placements?" Proc. ACM/IEEE DAC, June 2000.
    • (2000) Proc. ACM/IEEE DAC
    • Caldwell, A.1    Kahng, A.2    Markov, I.3
  • 12
    • 84954460028 scopus 로고    scopus 로고
    • Optimality and scalability study of existing placement algorithms
    • C. Chang, J. Cong, M. Xie, "Optimality and scalability study of existing placement algorithms," Proc. ASP-DAC, 2003.
    • (2003) Proc. ASP-DAC
    • Chang, C.1    Cong, J.2    Xie, M.3
  • 13
    • 2942639682 scopus 로고    scopus 로고
    • FastPlace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model
    • April
    • N. Viswanathan, C. C.-N. Chu, "FastPlace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model," Proc. ACM ISPD, April 2004.
    • (2004) Proc. ACM ISPD
    • Viswanathan, N.1    Chu, C.C.-N.2
  • 15
    • 27944488837 scopus 로고    scopus 로고
    • Important considerations for modern VLSI chips
    • April
    • P. Villarrubia, "Important considerations for modern VLSI chips," Proc. ACM ISPD, April 2003.
    • (2003) Proc. ACM ISPD
    • Villarrubia, P.1
  • 16
    • 0002049779 scopus 로고    scopus 로고
    • The ISPD98 circuit benchmark suite
    • April
    • C. J. Alpert, "The ISPD98 circuit benchmark suite," Proc. ACM ISPD, April 1998.
    • (1998) Proc. ACM ISPD
    • Alpert, C.J.1
  • 17
    • 4444325329 scopus 로고    scopus 로고
    • Dragon 2000: Fast standard-cell placement for large circuits
    • Nov.
    • M. Wang, X. Yang, M. Sarrafzadeh, "Dragon 2000: Fast standard-cell placement for large circuits," Proc. ACM/IEEE ICCAD, Nov. 2000.
    • (2000) Proc. ACM/IEEE ICCAD
    • Wang, M.1    Yang, X.2    Sarrafzadeh, M.3
  • 18
    • 0033712214 scopus 로고    scopus 로고
    • Timing-driven placement based on partitioning with dynamic cut-net control
    • June
    • S. Ou, M. Pedram, "Timing-driven placement based on partitioning with dynamic cut-net control," Proc. ACM/IEEE DAC, June 2000.
    • (2000) Proc. ACM/IEEE DAC
    • Ou, S.1    Pedram, M.2
  • 20
    • 2942676658 scopus 로고    scopus 로고
    • Sensitivity guided net weighting for placement driven synthesis
    • April
    • H. Ren, D. Z. Pan, D. S. Kung, "Sensitivity guided net weighting for placement driven synthesis," Proc. ACM ISPD, April 2004.
    • (2004) Proc. ACM ISPD
    • Ren, H.1    Pan, D.Z.2    Kung, D.S.3
  • 21
    • 27944464166 scopus 로고    scopus 로고
    • http://openeda.si2.org/.
  • 22
  • 23
    • 27944488838 scopus 로고    scopus 로고
    • OA Gear homepage: http://openedatools.si2.org/oagear/.
    • OA Gear Homepage


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