VLSI floorplanning based on the integration of adaptive search models

  • Authors:
  • V. M. Kureichik;B. K. Lebedev;V. B. Lebedev

  • Affiliations:
  • Taganrog Institute of Technology, Southern Federal University, Taganrog, Russia 347928;Taganrog Institute of Technology, Southern Federal University, Taganrog, Russia 347928;Taganrog Institute of Technology, Southern Federal University, Taganrog, Russia 347928

  • Venue:
  • Journal of Computer and Systems Sciences International
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

A hybrid approach and methods for representing the VLSI floorplanning problem in the form of evolutionary processes based on the integration of adaptive behavior models of biological systems and on composite architectures of solution algorithms are described. This makes it possible to deal with large-scale problems and obtain high-quality results in reasonable time. The floorplan synthesis includes two phases. In the first phase, the cut tree is produced using the genetic techniques; in the second phase, the floorplan is formed using the convolution by the methods of collective adaptation of the tree cut. Variants of circuits with the variable module orientation of fixed or stochastic size are considered. The probability of obtaining an optimal solution is 0.9, and the average deviation of the solutions from the optimal ones is 1%.