메뉴 건너뛰기




Volumn 27, Issue 8, 2008, Pages 1349-1362

A robust mixed-size legalization and detailed placement algorithm

Author keywords

Optimization; Physical design; Placement

Indexed keywords

ACCESS CONTROL; BOOLEAN FUNCTIONS; CANNING; CONTRACTS; ELECTRIC BATTERIES; EXPERIMENTS; GRAPH THEORY; LINEAR PROGRAMMING; LINEARIZATION; MACROS; STANDARDS;

EID: 47849111205     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2008.925792     Document Type: Article
Times cited : (31)

References (60)
  • 3
    • 29144468974 scopus 로고    scopus 로고
    • Multilevel generalized force-directed method for circuit placement
    • Apr
    • T. Chan, J. Cong, and K. Sze, "Multilevel generalized force-directed method for circuit placement," in Proc. Int. Symp. Phys. Des., Apr. 2005, pp. 185-192.
    • (2005) Proc. Int. Symp. Phys. Des , pp. 185-192
    • Chan, T.1    Cong, J.2    Sze, K.3
  • 4
    • 29144488370 scopus 로고    scopus 로고
    • APlace: A general analytic placement framework
    • A. B. Kahng, S. Reda, and Q. Wang, "APlace: A general analytic placement framework," in Proc. Int. Symp. Phys. Des., 2005, pp. 233-235.
    • (2005) Proc. Int. Symp. Phys. Des , pp. 233-235
    • Kahng, A.B.1    Reda, S.2    Wang, Q.3
  • 5
    • 29144534646 scopus 로고    scopus 로고
    • Recursive bisection placement: Feng shui 5.0 implementation details
    • Apr
    • A. Agnihotri, S. Ono, and P. H. Madden, "Recursive bisection placement: Feng shui 5.0 implementation details," in Proc. Int. Symp. Phys. Des., Apr. 2005, pp. 230-232.
    • (2005) Proc. Int. Symp. Phys. Des , pp. 230-232
    • Agnihotri, A.1    Ono, S.2    Madden, P.H.3
  • 10
    • 0030718152 scopus 로고    scopus 로고
    • Algorithms for large-scale flat placement
    • J. Vygen, "Algorithms for large-scale flat placement," in Proc. Des. Autom. Conf., 1997, pp. 746-751.
    • (1997) Proc. Des. Autom. Conf , pp. 746-751
    • Vygen, J.1
  • 11
    • 2942630783 scopus 로고    scopus 로고
    • Almost optimum placement legalization by minimum cost flow and dynamic programming
    • Apr
    • U. Brenner, A. Pauli, and J. Vygen, "Almost optimum placement legalization by minimum cost flow and dynamic programming," in Proc. Int. Symp. Phys. Des., Apr. 2004, pp. 2-9.
    • (2004) Proc. Int. Symp. Phys. Des , pp. 2-9
    • Brenner, U.1    Pauli, A.2    Vygen, J.3
  • 13
    • 0034478056 scopus 로고    scopus 로고
    • Mongrel: Hybrid techniques for standard-cell placement
    • San Jose, CA, Nov
    • S.-W. Hur and J. Lillis, "Mongrel: Hybrid techniques for standard-cell placement," in Proc. Int. Conf. Comput. Aided Des., San Jose, CA, Nov. 2000, pp. 165-170.
    • (2000) Proc. Int. Conf. Comput. Aided Des , pp. 165-170
    • Hur, S.-W.1    Lillis, J.2
  • 14
    • 0043136765 scopus 로고    scopus 로고
    • Timing optimization of FPGA placements by logic replication
    • Jun
    • G. Beraudo and J. Lillis, "Timing optimization of FPGA placements by logic replication," in Proc. Des. Autom. Conf., Jun. 2003, pp. 196-201.
    • (2003) Proc. Des. Autom. Conf , pp. 196-201
    • Beraudo, G.1    Lillis, J.2
  • 18
    • 2942660384 scopus 로고    scopus 로고
    • Method and system, for high, speed detailed placement of cells within an integrated circuit design,
    • U.S. Patent 6 370 673, Apr. 9
    • D. Hill, "Method and system, for high, speed detailed placement of cells within an integrated circuit design," U.S. Patent 6 370 673, Apr. 9, 2002.
    • (2002)
    • Hill, D.1
  • 20
    • 0036377317 scopus 로고    scopus 로고
    • Consistent placement of macro-blocks using floorplanning and standard-cell placement
    • Apr
    • S. N. Adya and I. L. Markov, "Consistent placement of macro-blocks using floorplanning and standard-cell placement," in Proc. Int. Symp. Phys. Des., Apr. 2002, pp. 12-17.
    • (2002) Proc. Int. Symp. Phys. Des , pp. 12-17
    • Adya, S.N.1    Markov, I.L.2
  • 21
    • 33745968360 scopus 로고    scopus 로고
    • A robust detailed placement for mixed-size IC designs
    • J. Cong and M. Xie, "A robust detailed placement for mixed-size IC designs," in Proc. Asia South Pacific Des. Autom. Conf., 2006, pp. 188-194.
    • (2006) Proc. Asia South Pacific Des. Autom. Conf , pp. 188-194
    • Cong, J.1    Xie, M.2
  • 23
    • 0006685403 scopus 로고    scopus 로고
    • Post-placement residual-overlap removal with minimal movement
    • S. Nag and K. Chaudhary, "Post-placement residual-overlap removal with minimal movement," in Proc. Des., Autom. Test Eur. Conf., 1999, pp. 581-586.
    • (1999) Proc. Des., Autom. Test Eur. Conf , pp. 581-586
    • Nag, S.1    Chaudhary, K.2
  • 25
    • 2942682815 scopus 로고    scopus 로고
    • Implementation and extensibility of an analytic placer
    • A. Kahng and Q. Wang, "Implementation and extensibility of an analytic placer," in Proc. Int. Symp. Phys. Des., 2004, pp. 18-25.
    • (2004) Proc. Int. Symp. Phys. Des , pp. 18-25
    • Kahng, A.1    Wang, Q.2
  • 30
    • 29144477613 scopus 로고    scopus 로고
    • Dragon 2005: Large-scale mixed-size placement tool
    • Apr
    • T. Taghavi, X. Yang, and B.-K. Choi, "Dragon 2005: Large-scale mixed-size placement tool," in Proc. Int. Symp. Phys. Des., Apr. 2005, pp. 245-247.
    • (2005) Proc. Int. Symp. Phys. Des , pp. 245-247
    • Taghavi, T.1    Yang, X.2    Choi, B.-K.3
  • 35
    • 47849095581 scopus 로고    scopus 로고
    • C. Li and C.-K. Koh, On improving recursive bipartitioning-based placement, Purdue Univ., West Lafayette, IN, Tech. Rep. TR-ECE 03-14, 2003.
    • C. Li and C.-K. Koh, "On improving recursive bipartitioning-based placement," Purdue Univ., West Lafayette, IN, Tech. Rep. TR-ECE 03-14, 2003.
  • 37
    • 0019478261 scopus 로고
    • An efficient algorithm for the two-dimensional placement problem in electrical circuit layout
    • Jan
    • S. Goto, "An efficient algorithm for the two-dimensional placement problem in electrical circuit layout," IEEE Trans. Circuits Syst., vol. CAS-28, no. 1, pp. 12-18, Jan. 1981.
    • (1981) IEEE Trans. Circuits Syst , vol.CAS-28 , Issue.1 , pp. 12-18
    • Goto, S.1
  • 40
    • 47849095302 scopus 로고    scopus 로고
    • Personal Communication
    • K. Sze, 2006. Personal Communication.
    • (2006)
    • Sze, K.1
  • 41
    • 2942639682 scopus 로고    scopus 로고
    • FastPlace: Efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model
    • Apr
    • C. Chu and N. Viswanathan, "FastPlace: Efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model," in Proc. Int. Symp. Phys. Des., Apr. 2004, pp. 26-33.
    • (2004) Proc. Int. Symp. Phys. Des , pp. 26-33
    • Chu, C.1    Viswanathan, N.2
  • 43
    • 33745944475 scopus 로고    scopus 로고
    • ISPD 2006 placement contest: Benchmark suite and results
    • G.-J. Nam, "ISPD 2006 placement contest: Benchmark suite and results," in Proc. Int. Symp. Phys. Des., 2006, p. 167.
    • (2006) Proc. Int. Symp. Phys. Des , pp. 167
    • Nam, G.-J.1
  • 45
    • 0742321357 scopus 로고    scopus 로고
    • Fixed-outline floorplanning: Enabling hierarchical design
    • Dec
    • S. N. Adya and I. L. Markov, "Fixed-outline floorplanning: Enabling hierarchical design," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 11, no. 6, pp. 1120-1135, Dec. 2003.
    • (2003) IEEE Trans. Very Large Scale Integr. (VLSI) Syst , vol.11 , Issue.6 , pp. 1120-1135
    • Adya, S.N.1    Markov, I.L.2
  • 46
    • 0001893927 scopus 로고
    • Performance-oriented synthesis of large-scale domino CMOS circuits
    • Sep
    • G. De Micheli, "Performance-oriented synthesis of large-scale domino CMOS circuits," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. CAD-6, no. 5, pp. 751-765, Sep. 1987.
    • (1987) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.CAD-6 , Issue.5 , pp. 751-765
    • De Micheli, G.1
  • 48
    • 0004035722 scopus 로고
    • Performance optimization for digital circuits,
    • Ph.D. dissertation, Dept. Comput. Sci, Univ. California Berkeley, Berkeley, CA
    • K. J. Singh, "Performance optimization for digital circuits," Ph.D. dissertation, Dept. Comput. Sci., Univ. California Berkeley, Berkeley, CA, 1992.
    • (1992)
    • Singh, K.J.1
  • 49
    • 33748605490 scopus 로고    scopus 로고
    • Synthesis for high-density and high-performance FPGA,
    • Ph.D. dissertation, Dept. Comput. Sci, Univ. California Los Angeles, Los Angeles, CA
    • S. Xu, "Synthesis for high-density and high-performance FPGA," Ph.D. dissertation, Dept. Comput. Sci., Univ. California Los Angeles, Los Angeles, CA, 2000.
    • (2000)
    • Xu, S.1
  • 51
    • 0000891810 scopus 로고
    • Algorithm for solution of a problem, of maximum flow in networks with power estimation
    • E. A. Dinic, "Algorithm for solution of a problem, of maximum flow in networks with power estimation," Sov. Math., Dokl., vol. 11, no. 8, pp. 1277-1280, 1970.
    • (1970) Sov. Math., Dokl , vol.11 , Issue.8 , pp. 1277-1280
    • Dinic, E.A.1
  • 52
    • 0024090156 scopus 로고
    • A new approach to the maximum-flow problem
    • A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem," J. Assoc. Comput. Mach., vol. 35, no. 4, pp. 921-940, 1988.
    • (1988) J. Assoc. Comput. Mach , vol.35 , Issue.4 , pp. 921-940
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 53
    • 4344598245 scopus 로고    scopus 로고
    • An experimental comparison of mincut/max-flow algorithms for energy minimization in vision
    • Sep
    • Y. Boykov and V. Kolmogorov, "An experimental comparison of mincut/max-flow algorithms for energy minimization in vision," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 9, pp. 1124-1137, Sep. 2004.
    • (2004) IEEE Trans. Pattern Anal. Mach. Intell , vol.26 , Issue.9 , pp. 1124-1137
    • Boykov, Y.1    Kolmogorov, V.2
  • 54
    • 0024902637 scopus 로고
    • An efficient algorithm for layout compaction problem, with symmetry constraints
    • Nov
    • R. Okuda, T. Sato, H. Onodera, and K. Tamara, "An efficient algorithm for layout compaction problem, with symmetry constraints," in Proc. Int. Conf. Comput. Aided Des., Nov. 1989, pp. 148-153.
    • (1989) Proc. Int. Conf. Comput. Aided Des , pp. 148-153
    • Okuda, R.1    Sato, T.2    Onodera, H.3    Tamara, K.4
  • 55
    • 54549110399 scopus 로고    scopus 로고
    • Optimal redistribution of white space for wire length minimization
    • Jan
    • X. Tang, R. Tian, and M. D. F. Wong, "Optimal redistribution of white space for wire length minimization," in Proc. Asia South Pacific Des. Autom. Conf., Jan. 2005, pp. 412-417.
    • (2005) Proc. Asia South Pacific Des. Autom. Conf , pp. 412-417
    • Tang, X.1    Tian, R.2    Wong, M.D.F.3
  • 56
    • 0030080729 scopus 로고    scopus 로고
    • Fast Cholesky factorization for interior point methods of linear programming
    • C. Meszaros, "Fast Cholesky factorization for interior point methods of linear programming," Comput. Math. Appl., vol. 31, no. 4/5, pp. 49-54, 1996.
    • (1996) Comput. Math. Appl , vol.31 , Issue.4-5 , pp. 49-54
    • Meszaros, C.1
  • 58
    • 0029710584 scopus 로고    scopus 로고
    • A performance-driven placement technique based on a new net budgeting criterion
    • G. E. Tellez, D. A. Knol, and M. Sarrafzadeh, "A performance-driven placement technique based on a new net budgeting criterion," in Proc. Int. Symp. Circuits Syst., 1996, pp. 504-507.
    • (1996) Proc. Int. Symp. Circuits Syst , pp. 504-507
    • Tellez, G.E.1    Knol, D.A.2    Sarrafzadeh, M.3
  • 59
    • 0032681035 scopus 로고    scopus 로고
    • Multilevel k-way hypergraph partitioning
    • G. Karypis and V. Kumar, "Multilevel k-way hypergraph partitioning," in Proc. Des. Autom. Conf., 1998, pp. 343-348.
    • (1998) Proc. Des. Autom. Conf , pp. 343-348
    • Karypis, G.1    Kumar, V.2


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