A new fuzzy-clustering-based approach for two-way circuit partitioning

In this paper, a new fuzzy-clustering-based approach is proposed for two-way circuit partitioning. First, a circuit netlist is represented as an undirected edge-weighted graph by a tree net model. Furthermore, the fuzzy memberships and the clustering distance are introduced into the graph. Based on fuzzy c-means clustering, two groups of the fuzzy memberships will be assigned onto all of the vertices in the graph. Finally, according to these fuzzy memberships and the area information of the circuit netlist, the circuit netlist will be partitioned into two smaller netlists with area-balanced constraints. As a result, the proposed fuzzy clustering-based approach is implemented to obtain a better two-way partitioning with area-balanced constraints on circuit benchmarks.

[1]  Ernst G. Ulrich,et al.  Clustering and linear placement , 1972, DAC '72.

[2]  Youssef Saab,et al.  Fast effective heuristics for the graph bisectioning problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Hyunchul Shin,et al.  A simple yet effective technique for partitioning , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[4]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[6]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[7]  Frank Thomson Leighton,et al.  Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms , 1989, 26th ACM/IEEE Design Automation Conference.

[8]  Carl Sechen,et al.  An improved objective function for mincut circuit partitioning , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[9]  James C. Bezdek,et al.  Efficient Implementation of the Fuzzy c-Means Clustering Algorithms , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[11]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  Howard R. Charney,et al.  Efficient partitioning of components , 1968, DAC.

[14]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[15]  James C. Bezdek,et al.  Optimality tests for fixed points of the fuzzy c-means algorithm , 1988, Pattern Recognit..

[16]  Laura A. Sanchis,et al.  Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.

[17]  Chung-Kuan Cheng,et al.  An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..