Browse > Article
http://dx.doi.org/10.17662/ksdim.2021.17.2.013

Design and Implementation of a Adapted Genetic Algorithm for Circuit Placement  

Song, Ho-Jeong (충북대학교 컴퓨터공학과)
Kim, Hyun-Gi (강동대학교 소방안전과)
Publication Information
Journal of Korea Society of Digital Industry and Information Management / v.17, no.2, 2021 , pp. 13-20 More about this Journal
Abstract
Placement is a very important step in the VLSI physical design process. It is the problem of placing circuit modules to optimize the circuit performance and reliability of the circuit. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for circuit placement include the cluster growth, simulated annealing, integer linear programming and genetic algorithm. In this paper we propose a adapted genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of each implementation. As a result, it was found that the adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.
Keywords
Simulated Annealing; Genetic Algorithm; Placement; Adapted Genetic Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Gen, M. Cheng, Genetic Algorithms and Engineering Design, Wiley, New Your, 1997.
2 Back, T., Evolutionary Algorithms in Theory and Practice, Oxford University Press, New Your, 1996
3 Z. Michalewicz, Genetic Algorithm + Data Structures = Evolution Programs, Third, Revised and Extended Edition, Springer, 1992.
4 M. Gen, R. Cheng, Genetic Algorithms and Engineering Optimization, Wiley-Interscience publication, 2000.
5 김현기, 송호정, 이범근, "4-레이어 채널 배선 유전자 알고리즘," 전자공학회논문지IE, Vol.42, No.1, 2005, pp.1-6.
6 H.Murata, K.Fujiyoshi, S.Nakatake, and Y.Kajitani. "VLSI module placement based on rectangle-packing by the sequence-pair," IEEE Transactions on CAD, Vol.15, 1996, pp.1518-1524.   DOI
7 G.Vijayan and R.Tsay. "A new method for floorplanning using topological constraint reduction," IEEE Transactions on CAD, Vol.10, No.12, 1991, pp.1494-1501.   DOI
8 K.Shahookar and P.Mazumder. "VLSI cell placement techniques," ACM Computing Surveys, Vol.23, No.2, 1991, pp.143-220.   DOI
9 S. M. Sait, H. Youssef, VLSI Physical Design Automation Theory and Practice, World Scientific Publishing, 2001.
10 F.Y. Young, D.F. Wong, Hannah H. Yang, "ON Extending Slicing Floorplan to Handle L/T-Shaped Modules and Abutment constraints," IEEE Transaction on Computer-Aided Design, 2001, pp. 800-807.
11 Y.Saab and V.Rao. "Stochastic evolution: A fast effective heuristic for some generic layout problems," 17th ACM/IEEE Design Automation Conference, 1990, pp. 26-31.
12 S. M. Sait, H. Youssef, Iterative Computer Algorithms with Applications in Engineering, Computer Society, 1999.
13 S. kirkpatrick, C. D. Gelatt and M. P. Vecchi. "Optimization by Simulated Annealing," Science, Vol.220, No.4598, 1983, pp.671-680.   DOI
14 Naveed A. Sherwani, Algorithms for VLSI Physical Design Automation. 3rd Edition, Kluwer Academic Publishers, 2001.
15 S. M. Sait, H. Youssef, Iterative Computer Algorithms with Applications in Engineering, Computer Society, 1999.
16 D.F.Wong and C.L.Liu. "A new algorithm for floorplanning design," Proc. of the 23rd DAC, 1986. pp.101-107.
17 C.Sechen and A.L.Sangiovanni-Vincentelli. Timberwolf3.2: "A new standard cell placement and global routing package," Proceedings of 23rd Design Automation Conference, 1986, pp.432-439.