메뉴 건너뛰기




Volumn , Issue , 2003, Pages 203-206

Clustering based acyclic multi-way partitioning

Author keywords

Acyclic; CAD; Clustering; Multi way; Partitioning

Indexed keywords

ALGORITHMS; GRAPH THEORY; LOGIC DESIGN; NETWORKS (CIRCUITS); SIGNAL PROCESSING; VLSI CIRCUITS;

EID: 0037699714     PISSN: 10661395     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/764856.764860     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 1
    • 0030646148 scopus 로고    scopus 로고
    • Multilevel circuit partitioning
    • C. J. Alpert, J. H. Huang, and A. B. Kahng. Multilevel circuit partitioning. DAC, pages 530-533, 1997.
    • (1997) DAC , pp. 530-533
    • Alpert, C.J.1    Huang, J.H.2    Kahng, A.B.3
  • 3
    • 84901784784 scopus 로고
    • A linear-time heuristic for improving network partitions
    • C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. Design Automation Conference, pages 241-247, 1982.
    • (1982) Design Automation Conference , pp. 241-247
    • Fiduccia, C.M.1    Mattheyses, R.M.2
  • 5
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291-307, 1970.
    • (1970) The Bell System Technical Journal , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 6
    • 0032306328 scopus 로고    scopus 로고
    • Network flow based circuit partitioning for time-multiplexed fpga
    • H. Liu and D. F. Wong. Network flow based circuit partitioning for time-multiplexed fpga. ICCAD, pages 497-504, 1998.
    • (1998) ICCAD , pp. 497-504
    • Liu, H.1    Wong, D.F.2
  • 7
    • 0028715183 scopus 로고
    • Efficient network flow based min-cut balanced partitioning
    • November
    • H. Yang and D. F. Wong. Efficient network flow based min-cut balanced partitioning. IEEE ICCAD, pages 50-55, November 1994.
    • (1994) IEEE ICCAD , pp. 50-55
    • Yang, H.1    Wong, D.F.2
  • 8
    • 0029516534 scopus 로고
    • New algorithms for min-cut replication in partitioned circuits
    • H. Yang and D. F. Wong. New algorithms for min-cut replication in partitioned circuits. ICCAD, pages 216-222, 1995.
    • (1995) ICCAD , pp. 216-222
    • Yang, H.1    Wong, D.F.2
  • 9


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