Edge separability based circuit clustering with application to circuit partitioning

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2000, Pages 429-434

  Cong, Jason ^a   Lim, Sung Kyu ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT CLUSTERING; CIRCUIT PARTITIONING; CLUSTERING PROCESS; GLOBAL CONNECTIVITY; LOCAL CONNECTIVITY; MULTIWAY PARTITIONING; SIMPLE AND EFFICIENT ALGORITHMS; WEIGHTED UNDIRECTED GRAPH;

BENCHMARKING; COMPUTER AIDED DESIGN;

CLUSTERING ALGORITHMS;

EID: 0003132154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/368434.368728     Document Type: Conference Paper

References (19)

1. C. J. Alpert. The ISPD98 circuit benchmark suite. In Proc. Int. Symp. on Physical Design, pages 80-85, 1998.
2. C. J. Alpert and A. B. Kahng. A general framework for vertex ordering with applications to netlist clustering. In Proc. Int. Conf. on Computer-Aided Design, pages 652-657, 1994.
3. C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: a survey. Integration, the VLSI Journal, pages 1-81, 1995.
4. J. Cong and Y. Ding. On area/depth trade-off in LUT-based FPGA technology mapping. In Proc. Design Automation Conf., pages 213-218, 1993.
5. J. Cong, H. Li, and C. Wu. Simultaneous circuit partitioning/clustering with retiming for performance optimization. In Proc. Design Automation Conf., 1999.
6. J. Cong, H. P. Li, S. K. Lim, T. Shibuya, and D. Xu. Large scale circuit partitioning with loose/stable net removal and signal flow based clustering. In Proc. Int. Conf. on Computer-Aided Design, pages 441-446, 1997.
7. J. Cong and S. K. Lim. Multiway partitioning with pairwise movement. In Proc. Int. Conf. on Computer-Aided Design, pages 512-516, 1998.
8. J. Cong and S. K. Lim. Performance driven multiway partitioning. In Proc. Asia South Pacific Design Automation Conf., 2000.
9. J. Cong and M. Smith. A parellel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design. In Proc. Design Automation Conf., pages 755-760, 1993.
10. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of ACM, pages 921-940, 1988.
11. D. J. Huang and A. B. Kahng. When clusters meet partitions: new density-based methods for circuit decomposition. In Proc. European Design and Test Conf., pages 60-64, 1995.
12. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Application in VLSI domain. In Proc. Design Automation Conf., pages 526-529, 1997.
13. G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. In Proc. Design Automation Conf., 1999.
14. H. Nagamochi and T. Ibaraki. Computing edge connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Math., pages 54-66, 1992.
15. T. K. Ng, J. Oldfield, and V. Pitchumani. Improvements of a mincut partition algorithm. In Proc. Int. Conf. on Computer-Aided Design, pages 470-473, 1987.
16. D. M. Schuler and E. G. Ulrich. Clustering and linear placement. In Proc. Design Automation Conf., 1972.
17. H. Shin and C. Kim. A simple yet effective technique for partitioning. IEEE Trans. on VLSI Systems, pages 380-386, 1993.
18. W. Sun and C. Sechen. Efficient and effective placements for very large circuits. In Proc. Int. Conf. on Computer-Aided Design, pages 170-177, 1993.
19. Y. C. Wei and C. K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Trans. on Computer-Aided Design, pages 911-921, 1992.