Efficient k-way partitioning of very-large-scale integration circuits with evolutionary computation algorithms

Abstract

The standardization of very-large-scale integration (VLSI) physical architecture for VLSI chips and multichip platforms is now in its early stages of development. The purpose of VLSI partitioning is to divide the circuit into numerous smaller circuits with few connections in between. Partitioning is the fundamental problem in circuit design and division. The efficient method of evolutionary computation may be used to tackle the partitioning problem in VLSI circuit design. It provides a heuristic approach to solve this problem by exploring the solution space and incrementally improving the quality of the solutions. In order to obtain the shortest wire length (WL), area, and connections, an evolutionary optimized simulated annealing memetic algorithm (OSAMA) that incorporates one or more local search phases inside its evolutionary cycle was developed.