Hierarchical Approach for VLSI Components Placement

  • D. Yu. Zaporozhets
  • D. V. Zaruba
  • Vl. Vl. Kureichik
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 347)


To solve the problem of VLSI components’ placement a modified hierarchical approach is proposed. This approach consists of three levels. At the first level a preliminary decomposition of search space with the use of evolutionary algorithms is performed. Geometric parameters of each group are determined by the total area of its constituent components. At the second level VLSI components are placed within decomposition groups on the basis of the modified genetic algorithm. At the third level decomposition groups are placed within a connection field using genetic search methods. The suggested methods of the encoding and decoding of alternative solutions enable the authors to perform genetic procedures. These methods consist in using the reverse Polish notation. A computational experiment, which confirmed the theoretical estimates of the performance and efficiency of the developed algorithms, was carried out. The hierarchical algorithm was compared with classical methods and the bioinspired search. The time complexity of the algorithm is represented as O (n log n).


VLSI Computer-aided design Placement layout Multi-level optimization Genetic algorithm Bioinspired search 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sherwani, N.A.: Algorithms for VLSI Physical Design Automation, 3rd edn. Kluwer Academic Publisher, USA (2013)Google Scholar
  2. 2.
    Kureichik, V.M., Malioukov, S.P., Kureichik, V.V., Malioukov, A.S.: General Questions of automated design and engineering. In: Kureichik, V.M., Malioukov, S.P., Kureichik, V.V., Malioukov, A.S. (eds.) Genetic Algorithms for Applied CAD Problems. SCI, vol. 212, pp. 1–22. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Alpert, C.J., Dinesh, P.M., Sachin, S.S.: Handbook of Algorithms for Physical design Automation. Auerbach Publications Taylor & Francis Group, USA (2009)Google Scholar
  4. 4.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, USA (1989)zbMATHGoogle Scholar
  5. 5.
    Kureichik, V.V., Kureichik, V.M.: Genetic search-based control. Automation and Remote Control 62(10), 1698–1710Google Scholar
  6. 6.
    Kureichik, V.V., Zaporozhets, D.Y.: Modern problems of placing VLSI elements. Izvestiya SFedU. Engineering Sciences 120, 68–73 (2011)Google Scholar
  7. 7.
    Cong, J., Shinnerl, J.R., Xie, M., Kong, T., Yuan, X.: Large-scale circuit placement. ACM Transactions on Design Automation of Electronic Systems, 389–430 (2005)Google Scholar
  8. 8.
    Kureichik, V.M., Kureichik, V.V.: Genetic Algorithm for the Graph Placement. International Journal of Computer and Systems Sciences 39(5), 733–740 (2000)Google Scholar
  9. 9.
    Zaporozhets, D.Y., Zaruba, D.V., Lezhebokov, A.A.: A method of coding solutions for solving problems placement. Izvestiya SFedU. Engineering Sciences 136, 183–188 (2012)Google Scholar
  10. 10.
    Bova, V.V., Kureichik, V.V.: Integrated hybrid and combined search in the problems of design and management. Izvestiya SFedU. Engineering Sciences 113, 37–42 (2010)Google Scholar
  11. 11.
    Kureichik, V.V., Kureichik, Vl.Vl.: Hybrid search in design. Izvestiya SFedU. Engineering Sciences 132, 22–27 (2012) Google Scholar
  12. 12.
    Zaporozhets, D.Y., Zaruba, D.V., Kureichik, V.V.: Representation of solutions in genetic VLSI placement algorithms. In: 2014 East-West Design & Test Symposium (EWDTS), pp. 1–4 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • D. Yu. Zaporozhets
    • 1
  • D. V. Zaruba
    • 1
  • Vl. Vl. Kureichik
    • 1
  1. 1.Southern Federal UniversityTaganrogRussia

Personalised recommendations