Abstract
The paper considers one of the most important problem in the design field – VLSI fragments placement within restricted construction area. The VLSI fragments placement problem is NP-hard and complex problem. In the work there are presented a description of the placement problem and transition from a circuit diagram to a graph model. To reduce dimension of the problem the authors suggest a hybrid approach based on two fractals aggregation and genetic search methods. As well as there is developed a genetic algorithm that allows to obtain sets quazi-optimal solutions during polynomial time. To confirm the effectiveness of the suggested approach there is shown an example of the VLSI fragments placement solution, developed software and computational experiment. Conducted tests and experiments approve promising of the suggested approach, a time complexity of developed algorithms is represented in the best case as ≈O(nlogn), in the worst case - O(n3).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kureichik Jr., V., Kureichik, V., Bova, V.: Placement of VLSI fragments based on a multilayered approach. Adv. Intell. Syst. Comput. 464, 181–190 (2016)
Alpert, C.J., Mehta, D.P., Sapatnekar, S.S.: Handbook of Algorithms for Physical Design (2009)
Zaporozhets, D.U., Zaruba, D.V., Kureichik, V.V.: Representation of solutions in genetic VLSI placement algorithms. In: Proceedings of IEEE East-West Design and Test Symposium, EWDTS 2014, art. no. 7027053 (2014)
Zaporozhets, D., Zaruba, D.V., Kureichik, V.V.: Hierarchical approach for VLSI components placement. Adv. Intell. Syst. Comput. 347, 79–87 (2015)
Yurevich Zaporozhets, D., Victorovna Zaruba, D., Kureichik, V.V.: Hybrid bionic algorithms for solving problems of parametric optimization. World Appl. Sci. J. 23(8), 1032–1036 (2013)
Orlov, A., Glushchenko, A., Kureichik Jr., V.: Hybrid genetic algorithm for cutting stock and packaging problems. In: Proceedings of 2016 IEEE East-West Design and Test Symposium, EWDTS 2016, art. no. 7807680 (2016)
Kureichik, V., Kureichik Jr., V., Zaruba, D.V.: Combined approach to place electronic computing equipment circuit elements. In: Proceedings of 2015 IEEE East-West Design and Test Symposium, EWDTS 2015, art. no. 7493134 (2015)
Zaruba, D., Zaporozhets, D., Kureichik, V.: VLSI placement problem based on ant colony optimization algorithm. Adv. Intell. Syst. Comput. 464, 127–133 (2016)
Kureichik, V.V., Kureichik, V.M.: A fractal algorithm for graph partitioning. J. Comput. Syst. Sci. Int. 41(4), 568–578 (2002)
Zhao, H., Destech Publicat, I.: VLSI placement design using genetic algorithms. In: 2014 International Conference on Mechanical Engineering and Automation (ICMEA), pp. 436–439 (2014)
Kurejchik, V.V., Kurejchik, V.M.: On genetic-based control. Avtomatika i Telemekhanika 10, 174–187 (2001)
IBM-PLACE 2.0 benchmark suits. http://er.cs.ucla.edu/benchmarks/ibm-place2/bookshelf/ibm-place2-all-bookshelf-nopad.tar.gz
Caldwell, A.E., Kahng, A.B., Markov, I.L.: Can recursive bisection alone produce routable placements? In: DAC 2000, pp. 477–482 (2000)
Wang, M., Yang, X., Sarrafzadeh, M.: Dragon2000: standard-cell placement tool for large industry circuits. In: ICCAD 2000, pp. 260–263 (2000)
Acknowledgements
This research is supported by internal grants of the Southern Federal University, the project #2.6432.2017.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Kureichik, L., Kureichik, V., Kureichik, V., Leschanov, D., Zaruba, D. (2018). Hybrid Approach for VLSI Fragments Placement. In: Abraham, A., Kovalev, S., Tarassov, V., Snasel, V., Vasileva, M., Sukhanov, A. (eds) Proceedings of the Second International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’17). IITI 2017. Advances in Intelligent Systems and Computing, vol 679. Springer, Cham. https://doi.org/10.1007/978-3-319-68321-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-68321-8_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68320-1
Online ISBN: 978-3-319-68321-8
eBook Packages: EngineeringEngineering (R0)