메뉴 건너뛰기




Volumn 23, Issue 4, 2004, Pages 527-536

Fine Granularity Clustering-Based Placement

Author keywords

Clustering method; Interconnect prediction; Placement

Indexed keywords

ALGORITHMS; GRAPH THEORY; ITERATIVE METHODS; LOGIC DESIGN; OPTIMIZATION; PROBLEM SOLVING; VLSI CIRCUITS;

EID: 2342433436     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2004.825868     Document Type: Conference Paper
Times cited : (24)

References (34)
  • 1
    • 0027247157 scopus 로고
    • Geometric embeddings for faster and better multi-way netlist partitioning
    • C. J. Alpert and A. B. Kahng, "Geometric embeddings for faster and better multi-way netlist partitioning," in Proc. ACM/IEEE Design Automation Conf., 1993, pp. 743-748.
    • (1993) Proc. ACM/IEEE Design Automation Conf. , pp. 743-748
    • Alpert, C.J.1    Kahng, A.B.2
  • 2
    • 0028713074 scopus 로고
    • A general framework for vertex ordering, with application to netlist clustering
    • _, "A general framework for vertex ordering, with application to netlist clustering," in Proc. IEEE Int. Conf. Computer-Aided Design, 1994, pp. 63-67.
    • (1994) Proc. IEEE Int. Conf. Computer-aided Design , pp. 63-67
  • 3
    • 0029354779 scopus 로고
    • Recent directions in netlist partitioning: A survey
    • _, "Recent directions in netlist partitioning: A survey," Integration, VLSI J., pp. 1-81, 1995.
    • (1995) Integration, VLSI J. , pp. 1-81
  • 4
    • 0017438317 scopus 로고
    • A class of min-cut placement algorithms
    • M. A. Breuer, "A class of min-cut placement algorithms," in Proc. Design Automation Conf, 1977, pp. 284-290.
    • (1977) Proc. Design Automation Conf , pp. 284-290
    • Breuer, M.A.1
  • 5
    • 51249170866 scopus 로고
    • Graph bisection algorithms with good average case behavior
    • T. Bui, S. Chaudhuri, F. Leighton, and M. Sipser, "Graph bisection algorithms with good average case behavior," Combinatorica, vol. 7, no. 2, pp. 171-191, 1987.
    • (1987) Combinatorica , vol.7 , Issue.2 , pp. 171-191
    • Bui, T.1    Chaudhuri, S.2    Leighton, F.3    Sipser, M.4
  • 6
    • 0024906287 scopus 로고
    • Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
    • T. Bui, C. Heigham, C. Jones, and T. Leighton, "Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms," in Proc. ACM/IEEE Design Automation Conf., 1989, pp. 775-778.
    • (1989) Proc. ACM/IEEE Design Automation Conf. , pp. 775-778
    • Bui, T.1    Heigham, C.2    Jones, C.3    Leighton, T.4
  • 9
    • 0027150132 scopus 로고
    • A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design
    • J. Cong and M. L. Smith, "A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design," in Proc. ACM/IEEE Design Automation. Conf., 1993, pp. 755-760.
    • (1993) Proc. ACM/IEEE Design Automation. Conf. , pp. 755-760
    • Cong, J.1    Smith, M.L.2
  • 10
    • 0003132154 scopus 로고    scopus 로고
    • Edge separability based circuit clustering with application to circuit partitioning
    • J. Cong and S. K. Lim, "Edge separability based circuit clustering with application to circuit partitioning," in Proc. Asia South Pacific Design Automation Conf., 2000, pp. 429-434.
    • (2000) Proc. Asia South Pacific Design Automation Conf. , pp. 429-434
    • Cong, J.1    Lim, S.K.2
  • 12
    • 0036375904 scopus 로고    scopus 로고
    • Physical hierarchy generation with routing congestion control
    • C. C. Chang, J. Cong, and Z. Pan, "Physical hierarchy generation with routing congestion control," in Proc. Int. Symp. Physical Design, 2002, pp. 36-41.
    • (2002) Proc. Int. Symp. Physical Design , pp. 36-41
    • Chang, C.C.1    Cong, J.2    Pan, Z.3
  • 15
    • 84901784784 scopus 로고
    • A linear time heuristic for improved network partitions
    • C. M. Fiduccia and R. M. Mattheyses, "A linear time heuristic for improved network partitions," in Proc. Design Automation Conf, 1982, pp. 241-247.
    • (1982) Proc. Design Automation Conf , pp. 241-247
    • Fiduccia, C.M.1    Mattheyses, R.M.2
  • 17
    • 0020908872 scopus 로고
    • Heuristic improvement technique for bisection of VLSI networks
    • M. Goldberg and M. Burstein, "Heuristic improvement technique for bisection of VLSI networks," in Proc. IEEE Int. Conf. Computer Design, 1983, pp. 122-125.
    • (1983) Proc. IEEE Int. Conf. Computer Design , pp. 122-125
    • Goldberg, M.1    Burstein, M.2
  • 19
    • 0036377280 scopus 로고    scopus 로고
    • FAR: Fixed point addition and relaxation based placement
    • B. Hu and M. Marek-Sadowska, "FAR: Fixed point addition and relaxation based placement," in Proc. Int. Symp. Physical Design, 2002, pp. 161-166.
    • (2002) Proc. Int. Symp. Physical Design , pp. 161-166
    • Hu, B.1    Marek-Sadowska, M.2
  • 20
    • 0038040222 scopus 로고    scopus 로고
    • Fine granularity clustering for large scale placement problems
    • _, "Fine granularity clustering for large scale placement problems," in Proc. Int. Symp. Physical Design, 2003, pp. 67-74.
    • (2003) Proc. Int. Symp. Physical Design , pp. 67-74
  • 21
    • 0042635590 scopus 로고    scopus 로고
    • Wire length prediction based clustering and its application in placement
    • _, "Wire length prediction based clustering and its application in placement," in ACM/IEEE Design Automation Conf, 2003, pp. 800-805.
    • (2003) ACM/IEEE Design Automation Conf , pp. 800-805
  • 22
    • 0031198780 scopus 로고    scopus 로고
    • An evaluation of bipartitioning techniques
    • Aug.
    • S. Hauck and G. Borriello, "An evaluation of bipartitioning techniques," IEEE Trans. Computer-Aided Design, vol. 16, pp. 849-866, Aug. 1997.
    • (1997) IEEE Trans. Computer-aided Design , vol.16 , pp. 849-866
    • Hauck, S.1    Borriello, G.2
  • 23
    • 84969784748 scopus 로고
    • When clusters meet partitions: New density-based methods for circuit decomposition
    • D. J. Huang and A. B. Kahng, "When clusters meet partitions: New density-based methods for circuit decomposition," in Proc. Eur. Design Test Conf, 1995, pp. 60-64.
    • (1995) Proc. Eur. Design Test Conf , pp. 60-64
    • Huang, D.J.1    Kahng, A.B.2
  • 28
    • 0027658937 scopus 로고
    • A simple yet effective technique for partitioning
    • H. Shin and C. Kim, "A simple yet effective technique for partitioning," IEEE Trans. VLSI Syst., pp. 380-386, 1993.
    • (1993) IEEE Trans. VLSI Syst. , pp. 380-386
    • Shin, H.1    Kim, C.2
  • 31
    • 0026191188 scopus 로고
    • Ratio cut partitioning for hierarchical designs
    • July
    • Y. C. Wei and C. K. Cheng, "Ratio cut partitioning for hierarchical designs," IEEE Trans. Computer-Aided Design, vol. 10, pp. 911-921, July, 1991.
    • (1991) IEEE Trans. Computer-aided Design , vol.10 , pp. 911-921
    • Wei, Y.C.1    Cheng, C.K.2
  • 32
    • 0029249381 scopus 로고
    • Circuit clustering using a stochastic flow injection method
    • Feb.
    • C. W. Yeh, C. K. Cheng, and T. T. Y. Lin, "Circuit clustering using a stochastic flow injection method," IEEE Trans. Computer-Aided Design, vol. 14, pp. 154-162, Feb. 1995.
    • (1995) IEEE Trans. Computer-aided Design , vol.14 , pp. 154-162
    • Yeh, C.W.1    Cheng, C.K.2    Lin, T.T.Y.3
  • 34
    • 2342421171 scopus 로고    scopus 로고
    • [Online]
    • Gigascale Systems Research Center [Online]. Available: http://gigascale.org/bookshelf/


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