어댑티드 회로 배치 유전자 알고리즘의 설계와 구현
Design and Implementation of a Adapted Genetic Algorithm for Circuit Placement
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (17)
- S. M. Sait, "Youssef, VLSI Physical Design Automation Theory and Practice" (2001), World Scientific Publishing
- Naveed A., "Sherwani, Algorithms for VLSI Physical Design Automation" (2001), Kluwer Academic Publishers
- F.Y. Young, "ON Extending Slicing Floorplan to Handle L", T-Shaped Modules and Abutment constraints, 2001, 800~807
- Y.Saab, "Stochastic evolution: A fast effective heuristic for some generic layout problems", 17th ACM, 1990, 26~31
- S. M. Sait, "Iterative Computer Algorithms with Applications in Engineering" (1999), Computer Society
- S. kirkpatrick, "Optimization by Simulated Annealing", Science, 220(4598), pp.671~680 (1983)
- K.Shahookar, "VLSI cell placement techniques", ACM Computing Surveys, 23(2), pp.143~220 (1991)
- S. M. Sait, "Iterative Computer Algorithms with Applications in Engineering" (1999), Computer Society
- Bäck, T., "Evolutionary Algorithms in Theory and Practice" (1996), Oxford University Press
- Z. Michalewicz, "Genetic Algorithm + Data Structures = Evolution Programs" (1992), Springer
- M. Gen, "Genetic Algorithms and Engineering Design" (1997), Wiley
- M. Gen, "Genetic Algorithms and Engineering Optimization" (2000), Wiley-Interscience publication
- 김현기, "4-레이어 채널 배선 유전자 알고리즘", 전자공학회논문지 - IE, 42(1), pp.1~6 (2005), 대한전자공학회
- D.F.Wong, "A new algorithm for floorplanning design", Proc. of the 23rd DAC, pp.101~107 (1986)
- H. Murata, "VLSI module placement based on rectangle-packing by the sequence-pair", IEEE Transactions on CAD, 15, pp.1996~
- G.Vijayan, "A new method for floorplanning using topological constraint reduction", IEEE Transactions on CAD, 10(12), pp.1494~1501 (1991)
- C.Sechen, "Timberwolf3.2: A new standard cell placement and global routing package", Proceedings of 23rd Design Automation Conference, pp.432~439 (1986)