Abstract
The paper discusses a modified algorithm based on the bees’ behavior in nature. We suggest to apply this algorithm for solving the element placement problem—one of the most difficult problem in the VLSI design. This problem belongs to the NP-class problem that is there are no precise methods to solve this problem. Also we formulate the placement problem and choose an optimization criterion. The developed artificial bee colony optimization (ABC) algorithm obtains optimal and quasi-optimal solutions during polynomial time. The distinguish feature of the algorithm is to split search space into subareas. After, we activate optimization process for each subarea parallel. To compare obtained results with known analogous algorithms we developed software which allows to carry out experiments on the basis of IBM benchmarks. Conducted experiments shown that the ABC algorithm is better than the other algorithms an average of 8 %.
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
Alpert, C., Mehta, D., Sapatnekar, S.: Handbook of Algorithms for Physical Design Automation. Auerbach Publications, New York, USA (2009)
Kureichik, V.V., Kureichik, V.M., Malioukov, S.P., Malioukov, A.S.: Algorithms for Applied CAD Problems. Springer, Heidelberg (2009)
Markov, I.L., Hu, J., Kim, M.-C.: Progress and Challenges in VLSI Placement Research. Proc. IEEE 103, 1985–2003 (2015)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)
Kureichik, V.V., Zaruba, D.V.: The bioinspired algorithm of electronic computing equipment schemes elements placement. In: Silhavy, R., Senkerik, R., Oplatkova, Z. K., Prokopova, Z., Silhavy, P. (eds.) 4th Computer Science On-line Conference, CSOC 2015б, vol. 347, pp. 51–58. Springer (2015)
Caldwell, A.E., Kahng, A.B., Markov, I.L.: Can recursive bisection alone produce routable placements? DAC 2000, 477–482 (2000)
Wang, M., Yang, X., Sarrafzadeh, M. Dragon2000: Standard-cell Placement Tool for Large Industry Circuits, ICCAD2000, pp. 260–263 (2000)
Yang, X., Choi, B.-K., Sarrafzadeh, M.: Routability driven white space allocation for fixed-die standard-cell placement. ISPD 2002, 42–50 (2002)
IBM-PLACE 2.0 benchmark suits. http://er.cs.ucla.edu/-benchmarks/-ibm-place2/bookshelf/-ibm-place2-all-bookshelf-nopad.tar.gz
Acknowledgements
This research is supported by grants of the Ministry of Education and Science of the Russian Federation, the project # 8.823.2014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Zaruba, D., Zaporozhets, D., Kureichik, V. (2016). Artificial Bee Colony Algorithm—A Novel Tool for VLSI Placement. In: Abraham, A., Kovalev, S., Tarassov, V., Snášel, V. (eds) Proceedings of the First International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’16). Advances in Intelligent Systems and Computing, vol 450. Springer, Cham. https://doi.org/10.1007/978-3-319-33609-1_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-33609-1_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33608-4
Online ISBN: 978-3-319-33609-1
eBook Packages: EngineeringEngineering (R0)