论文信息 - Genetic Algorithms based Partitioning of VLSI Circuit Systems

Genetic Algorithms based Partitioning of VLSI Circuit Systems

Circuit partitioning problem is a well known NP hard problem. The potential of Genetic Algorithm has been used to solve many computationally intensive problems (NP hard problems) because existing conventional methods are unable to perform the required breakthrough in terms of complexity, time and cost. The presented work deals with the problem of partitioning of a circuit using Genetic Algorithm. The program inputs the adjacency matrix, generates graph of the circuit and partitions the circuit based on crossover operator. The program produces a set of vertices that are highly connected to each other but highly disconnected from the other partitions.

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

[2] Majid Sarrafzadeh,et al. An Introduction To VLSI Physical Design , 1996 .

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

[4] Rajeevan Chandel,et al. Genetic Algorithm Based Approach To Circuit Partitioning , 2010 .

[5] Wolfgang Henseler,et al. Digital Design , 2003 .

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

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

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

[9] Elizabeth M. Rudnick,et al. Genetic algorithms for VLSI design, layout & test automation , 1999 .

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

[11] Baljit Singh,et al. A Simple Efficient Circuit Partitioning by Genetic Algorithm , 2009 .