An evaluation of bipartitioning techniques

Logic partitioning is an important issue in VLSI CAD, and has been an active area of research for at least the last 25 years. Numerous approaches have been developed and many different techniques have been combined for a wide range of applications. In this paper, we examine many of the existing techniques for logic bipartitioning and present a methodology for determining the best mix of approaches. The result is a novel bipartitioning algorithm that includes both new and pre-existing techniques. Our algorithm produces results that are at least 17% better than the state-of-the-art while also being efficient in run time.

[1]  Andrew B. Kahng,et al.  On implementation choices for iterative improvement partitioning algorithms , 1995, EURO-DAC '95/EURO-VHDL '95.

[2]  Martin D. F. Wong,et al.  Efficient Network Flow Based Min-cut Balanced Partitioning , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[3]  C. Yeh,et al.  A probabilistic multicommodity-flow solution to circuit clustering problems , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[4]  Charles J. Alpert,et al.  Spectral Partitioning: The More Eigenvectors, The Better , 1995, 32nd Design Automation Conference.

[5]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[6]  A. J. Stone,et al.  Logic partitioning , 1966, DAC.

[7]  Hans Jürgen Prömel,et al.  Finding clusters in VLSI circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[8]  Carl Sechen,et al.  A timing driven N-way chip and multi-chip partitioner , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[9]  Gaetano Borriello,et al.  Logic Partition Orderings for Multi-FPGA Systems , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[10]  Martin D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD.

[11]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[12]  Of references. , 1966, JAMA.

[13]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[14]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[15]  Chingwei Yeh,et al.  A probabilistic multicommodity-flow solution to circuit clustering problems , 1992, ICCAD.

[16]  Konrad Doll,et al.  Partitioning Very Large Circuits Using Analytical Placement Techniques , 1994, 31st Design Automation Conference.

[17]  E. G. Ulrich,et al.  Clustering and linear placement , 1988, 25 years of DAC.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Chingwei Yeh,et al.  Optimization by iterative improvement: an experimental evaluation on two-way partitioning , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Jason Cong,et al.  Net partitions yield better module partitions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[21]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

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

[23]  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.

[24]  Baldomir Zajc,et al.  Multi-way Netlist Partitioning into Heterogeneous FPGAs and Minimization of Total Device Cost and Interconnect , 1994, 31st Design Automation Conference.

[25]  Ulrich Weinmann.  FPGA partitioning under timing constraints , 1994 .

[26]  Chingwei Yeh,et al.  A general purpose multiple way partitioning algorithm , 1991, DAC '91.

[27]  GalilZvi.  Efficient algorithms for finding maximum matching in graphs , 1986 .

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

[29]  Chung-Kuan Cheng,et al.  Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

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

[32]  Jason Cong,et al.  A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design , 1993, 30th ACM/IEEE Design Automation Conference.

[33]  Baldomir Zajc,et al.  A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions , 1994, EURO-DAC '94.