Genetic Algorithm Based Approach To Circuit Partitioning

In this paper multiway circuit partitioning of circuits using Genetic Algorithms has been attempted. Due to the random search, inherent parallelism, and robustness of genetic algorithms, the solution of a circuit partitioning problem is global optimum. Results obtained show the versatility of the proposed method in solving NP hard problems like circuit partitioning. Results obtained show an improvement over the results of UCLA Branch and Bound partitioner (27). Information of the circuit has been given in accordance with circuit netlist files used in ISPD'98 circuit benchmark suite.

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

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  Maurizio Palesi,et al.  Multi-objective design space exploration using genetic algorithms , 2002, Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627).

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

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

[6]  K. Bazargan,et al.  Multi-objective circuit partitioning for cutsize and path-based delay minimization , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

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

[8]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[9]  Eugene L. Lawler,et al.  Module Clustering to Minimize Delay in Digital Networks , 1969, IEEE Transactions on Computers.

[10]  Theodore W. Manikas,et al.  Genetic Algorithms vs. Simulated Annealing: A Comparison of Approaches for Solving the Circuit Partitioning Problem , 1996 .

[11]  Gang Wang,et al.  Application partitioning on programmable platforms using the ant colony optimization , 2006, J. Embed. Comput..

[12]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[13]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[14]  Fabrizio Lombardi,et al.  An efficient multi-way algorithm for balanced partitioning of VLSI circuits , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[15]  Brian W. Kernighan,et al.  A proper model for the partitioning of electrical circuits , 1972, DAC '72.

[16]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[17]  Kia Bazargan,et al.  Multi-objective circuit partitioning for cutsize and path-based delay minimization , 2002, ICCAD 2002.

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

[19]  Frank Vahid,et al.  Dynamic hardware/software partitioning: a first approach , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[20]  Shawki Areibi,et al.  Circuit partitioning using a Tabu search approach , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[21]  Pinaki Mazumder,et al.  Genetic multiway partitioning , 1995, Proceedings of the 8th International Conference on VLSI Design.

[22]  Naveed A. Sherwani.  VLSI Physical Design Automation , 1995 .

[23]  Mohamed I. Elmasry,et al.  A low-power partitioning methodology by maximizing sleep time and minimizing cut nets , 2005, Fifth International Workshop on System-on-Chip for Real-Time Applications (IWSOC'05).