메뉴 건너뛰기




Volumn 25, Issue 10, 2006, Pages 2076-2087

Force-directed methods for generic placement

Author keywords

Design automation; Force directed placement; Integrated circuit layout; Quadratic placement

Indexed keywords

AUTOMATION; DATABASE SYSTEMS; INTEGRATED CIRCUIT LAYOUT; METRIC SYSTEM; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

EID: 33748320975     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.862748     Document Type: Article
Times cited : (19)

References (31)
  • 1
    • 0029226969 scopus 로고
    • Timing driven placement for large standard cell circuits
    • San Jose, CA
    • W. Swartz and C. Sechen, "Timing driven placement for large standard cell circuits," in Proc. Design Automation Conf., San Jose, CA, 1995, pp. 211-215.
    • (1995) Proc. Design Automation Conf. , pp. 211-215
    • Swartz, W.1    Sechen, C.2
  • 2
    • 0034477836 scopus 로고    scopus 로고
    • Dragon2000: Standard-cell placement tool for large industry circuits
    • San Jose, CA, Nov.
    • M. Wang, X. Yang, and M. Sarrafzadeh, "Dragon2000: Standard-cell placement tool for large industry circuits," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 2000, pp. 260-263.
    • (2000) Proc. Int. Conf. Computer-aided Design , pp. 260-263
    • Wang, M.1    Yang, X.2    Sarrafzadeh, M.3
  • 3
    • 0033697586 scopus 로고    scopus 로고
    • Can recursive bisection alone produce routable placements?
    • Los Angeles, CA, Jun.
    • A. E. Caldwell, A. B. Kahng, and I. L. Markov, "Can recursive bisection alone produce routable placements?" in Proc. Design Automation Conf., Los Angeles, CA, Jun. 2000, pp. 477-482.
    • (2000) Proc. Design Automation Conf. , pp. 477-482
    • Caldwell, A.E.1    Kahng, A.B.2    Markov, I.L.3
  • 7
    • 0026174925 scopus 로고
    • Analytical placement: A linear or a quadratic objective function?
    • San Francisco, CA, Jun.
    • G. Sigl, K. Doll, and F. M. Johannes, "Analytical placement: A linear or a quadratic objective function?" in Proc. Design Automation Conf., San Francisco, CA, Jun. 1991, pp. 427-432.
    • (1991) Proc. Design Automation Conf. , pp. 427-432
    • Sigl, G.1    Doll, K.2    Johannes, F.M.3
  • 8
    • 0030718152 scopus 로고    scopus 로고
    • Algorithms for large-scale flat placement
    • Anaheim, CA, Jun.
    • J. Vygen, "Algorithms for large-scale flat placement," in Proc. Design Automation Conf., Anaheim, CA, Jun. 1997, pp. 746-751.
    • (1997) Proc. Design Automation Conf. , pp. 746-751
    • Vygen, J.1
  • 9
    • 2942682815 scopus 로고    scopus 로고
    • Implementation and extensibility of an analytic placer
    • Phoenix, AZ, Apr.
    • A. B. Kahng and Q. Wang, "Implementation and extensibility of an analytic placer," in Proc. ISPD, Phoenix, AZ, Apr. 2004, pp. 18-25.
    • (2004) Proc. ISPD , pp. 18-25
    • Kahng, A.B.1    Wang, Q.2
  • 10
    • 0031632293 scopus 로고    scopus 로고
    • Generic global placement and floorplanning
    • San Francisco, CA, Jun.
    • H. Eisenmann and F. M. Johannes, "Generic global placement and floorplanning," in Proc. Design Automation Conf., San Francisco, CA, Jun. 1998, pp. 269-274.
    • (1998) Proc. Design Automation Conf. , pp. 269-274
    • Eisenmann, H.1    Johannes, F.M.2
  • 13
    • 0036377280 scopus 로고    scopus 로고
    • FAR: Fixed-points addition and relaxation based placement
    • Del Mar, CA
    • B. Hu and M. Marek-Sadowska, "FAR: Fixed-points addition and relaxation based placement," in Proc. ISPD, Del Mar, CA, 2002, pp. 161-166.
    • (2002) Proc. ISPD , pp. 161-166
    • Hu, B.1    Marek-Sadowska, M.2
  • 14
    • 2942639682 scopus 로고    scopus 로고
    • Fastplace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model
    • Phoenix, AZ, Apr.
    • N. Viswanathan and C. C.-N. Chu, "Fastplace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model," in Proc. ISPD, Phoenix, AZ, Apr. 2004, pp. 26-33.
    • (2004) Proc. ISPD , pp. 26-33
    • Viswanathan, N.1    Chu, C.C.-N.2
  • 15
    • 0035178749 scopus 로고    scopus 로고
    • A timing-driven macro-cell placement algorithm
    • Austin, TX, Sep.
    • F. Mo, A. Tabbara, and R. K. Brayton, "A timing-driven macro-cell placement algorithm," in Proc. Int. Conf. Computer Design, Austin, TX, Sep. 2001, pp. 322-327.
    • (2001) Proc. Int. Conf. Computer Design , pp. 322-327
    • Mo, F.1    Tabbara, A.2    Brayton, R.K.3
  • 16
    • 0035007653 scopus 로고    scopus 로고
    • Runtime and quality tradeoffs in FPGA placement and routing
    • Monterey, CA, Feb.
    • C. Mulpuri and S. Hauck, "Runtime and quality tradeoffs in FPGA placement and routing," in Proc. FPGA, Monterey, CA, Feb. 2001, pp. 29-36.
    • (2001) Proc. FPGA , pp. 29-36
    • Mulpuri, C.1    Hauck, S.2
  • 17
    • 0347409236 scopus 로고    scopus 로고
    • Efficient thermal placement of standard cells in 3D ICs using a force directed approach
    • San Jose, CA, Nov.
    • B. Goplen and S. S. Sapatnekar, "Efficient thermal placement of standard cells in 3D ICs using a force directed approach," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 2003, pp. 86-89.
    • (2003) Proc. Int. Conf. Computer-aided Design , pp. 86-89
    • Goplen, B.1    Sapatnekar, S.S.2
  • 18
    • 33846349887 scopus 로고
    • A hierarchical O (n log n) force calculation algorithm
    • Dec.
    • J. Barnes and P. Hut, "A hierarchical O (n log n) force calculation algorithm," Nature, vol. 324, no. 4, pp. 446-149, Dec. 1986.
    • (1986) Nature , vol.324 , Issue.4 , pp. 446-1149
    • Barnes, J.1    Hut, P.2
  • 20
    • 0026406169 scopus 로고
    • New upper bounds in Klee's measure problem
    • Dec.
    • M. H. Overmars and C.-K. Yap, "New upper bounds in Klee's measure problem," SIAM J. Comput., vol. 20, no. 6, pp. 1034-1045, Dec. 1991.
    • (1991) SIAM J. Comput. , vol.20 , Issue.6 , pp. 1034-1045
    • Overmars, M.H.1    Yap, C.-K.2
  • 21
    • 0003428927 scopus 로고
    • Algorithms for Klee's rectangle problems
    • Comput. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh
    • J. L. Bentley, "Algorithms for Klee's rectangle problems," Comput. Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, Tech. Rep., 1977.
    • (1977) Tech. Rep.
    • Bentley, J.L.1
  • 22
  • 23
    • 84978955301 scopus 로고    scopus 로고
    • Design and implementation of the Fiduccia-Mattheyses heuristic for VLSI netlist partitioning
    • Proc. ALENEX. Baltimore, MD
    • A. E. Caldwell, A. B. Kahng, and I. L. Markov, "Design and implementation of the Fiduccia-Mattheyses heuristic for VLSI netlist partitioning," in Proc. ALENEX, vol. 1619, Lecture Notes in Computer Science. Baltimore, MD, 1999, pp. 177-193.
    • (1999) Lecture Notes in Computer Science , vol.1619 , pp. 177-193
    • Caldwell, A.E.1    Kahng, A.B.2    Markov, I.L.3
  • 28
    • 33748297385 scopus 로고    scopus 로고
    • ISPD02 mixed-size placement benchmarks
    • [Online]
    • S. N. Adya and I. L. Markov. "ISPD02 mixed-size placement benchmarks," in GSRC Bookshelf. [Online]. Available: http://vlsicad.eecs. umich.edu/BK/ISPD02bench
    • GSRC Bookshelf
    • Adya, S.N.1    Markov, I.L.2
  • 29
    • 0742321357 scopus 로고    scopus 로고
    • Fixed-outline floorplanning: Enabling hierarchical design
    • Dec.
    • _, "Fixed-outline floorplanning: Enabling hierarchical design," IEEE Trans. Very Large Scale Integr. Syst., vol. 11, no. 6, pp. 1120-1135, Dec. 2003.
    • (2003) IEEE Trans. Very Large Scale Integr. Syst. , vol.11 , Issue.6 , pp. 1120-1135
  • 31
    • 84858890727 scopus 로고    scopus 로고
    • ICCAD04 mixed-size placement benchmarks
    • [Online]
    • S. N. Adya, S. Chaturvedi, and I. L. Markov. "ICCAD04 Mixed-Size Placement Benchmarks," in GSRC Bookshelf. [Online]. Available: http://vlsicad.eecs.umich.edu/BK/ICCAD04bench
    • GSRC Bookshelf
    • Adya, S.N.1    Chaturvedi, S.2    Markov, I.L.3


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