Genetic multiway partitioning

This research investigates a new software tool for Genetic Partitioning. The Genetic Algorithm is used to perform the partitioning with a significant improvement in result quality. Furthermore, it can optimize a cost function with multiple objectives and constraints. Separate algorithms have been developed, fine-tuned for bipartitioning and multiway partitioning. The bipartitioning problem is represented as a binary chromosome. Efficient bit-mask operations perform crossover, mutation, and net cut evaluation 32 bits at a time, without unpacking. The multiway partitioning algorithm has a global view of the problem, and generates/optimizes all the necessary partitions simultaneously. The algorithms were tested on the MCNC benchmark circuits, and the cut size obtained was lower than that for the conventional Fiduccia-Mattheyses algorithm.

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

[2]  Pinaki Mazumder,et al.  A Neural Network Design for Circuit Partitioning , 1989, 26th ACM/IEEE Design Automation Conference.

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

[4]  Pinaki Mazumder,et al.  Macro-cell and module placement by genetic adaptive search with bitmap-represented chromosome , 1991, Integr..

[5]  Kenneth J. Supowit,et al.  Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Henrik Esbensen,et al.  A genetic algorithm for macro cell placement , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[7]  Pinaki Mazumder,et al.  SAGA : a unification of the genetic algorithm with simulated annealing and its application to macro-cell placement , 1994, Proceedings of 7th International Conference on VLSI Design.

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

[9]  Pinaki Mazumder,et al.  A genetic approach to standard cell placement using meta-genetic parameter optimization , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Youssef Saab,et al.  An Evolution-Based Approach to Partitioning ASIC Systems , 1989, 26th ACM/IEEE Design Automation Conference.

[14]  Sudhakar M. Reddy,et al.  Genetic Beam Search For Gate Matrix Layout , 1993, The Sixth International Conference on VLSI Design.