Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Distributed Mean Field Genetic Algorithm for Channel Routing

채널배선 문제에 대한 분산 평균장 유전자 알고리즘

  • 홍철의 (상명대학교 컴퓨터과학부)
  • Received : 2009.12.09
  • Accepted : 2009.12.24
  • Published : 2010.02.27
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we introduce a novel approach to optimization algorithm which is a distributed Mean field Genetic algorithm (MGA) implemented in MPI(Message Passing Interface) environments. Distributed MGA is a hybrid algorithm of Mean Field Annealing(MFA) and Simulated annealing-like Genetic Algorithm(SGA). The proposed distributed MGA combines the benefit of rapid convergence property of MFA and the effective genetic operations of SGA. The proposed distributed MGA is applied to the channel routing problem, which is an important issue in the automatic layout design of VLSI circuits. Our experimental results show that the composition of heuristic methods improves the performance over GA alone in terms of mean execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential algorithm while it achieves almost linear speedup as the problem size increases.

본 논문에서는 MPI(Message Passing Interface) 환경 하에서 채널배선 문제에 대한 분산 평균장 유전자 알고리즘(MGA, Mean field Genetic Algorithm)이라는 새로운 최적화 알고리즘을 제안한다. 분산 MGA는 평균장 어닐링(MFA, Mean Field Annealing)과 시뮬레이티드 어닐링 형태의 유전자 알고리즘(SGA, Simulated annealing-like Genetic Algorithm)을 결합한 경험적 알고리즘이다. 평균장 어닐링의 빠른 평형상태 도달과 유전자 알고리즘의 다양하고 강력한 연산자를 합성하여 최적화 문제를 효율적으로 해결하였다. 제안된 분산 MGA를 VLSI 설계에서 중요한 주제인 채널 배선문제에 적용하여 실험한 결과 기존의 GA를 단독으로 사용하였을 때보다 최적해에 빠르게 도달하였다. 또한 분산 알고리즘은 순차 알고리즘에서의 최적해 수렴 특성을 해치지 않으면서 문제의 크기에 대하여 선형적인 수행시간 단축을 나타냈다.

Keywords

References

  1. Bultan, T. and C. Aykanat, "A New Mapping Heuristic Based on Mean Field Annealing," Journal of Parallel & Distributed Computing, 16, pp. 292-305, 1992. https://doi.org/10.1016/0743-7315(92)90013-D
  2. Salleh, S. and A. Y. Zomaya, "Multiprocessor Scheduling Using Mean-Field Annealing," Proc. of the First Workshop on Biologically Inspired Solutions to Parallel Processing Problems (BioSP3), pp. 288-296, March 30, Orlando, Florida, 1998.
  3. Yonghuai Liu, "A mean field annealing approach to accurate free form shape matching," Pattern Recognition, Volume 40, Issue 9, pp.2418-2436, September 2007. https://doi.org/10.1016/j.patcog.2006.11.025
  4. Pau Bofill, Roger Guimera, Carme Torras, "Comparison of simulated annealing and mean field annealing as applied to the generation of block designs," Neural Networks, Volume 16, Issue 10, pp. 1421-1428, December 2003. https://doi.org/10.1016/j.neunet.2003.07.003
  5. Zomaya, A.Y. and Teh Y.-W. "Observations on Using Genetic Algorithms for Dynamic Load-Balancing," IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 9, pp. 899-911, Sept. 2001. https://doi.org/10.1109/71.954620
  6. Metin Ozkan, Ahmet Yazici, Muzaffer Kapanoglu, Osman Parlaktuna, "Hierarchical oriented genetic algorithms for coverage path planning of multi-robot teams with load balancing," GEC '09: Proceedings of the ftrst ACM/SIGEVO Summit on Genetic and Evolutionary Computation June 2009.
  7. 홍철의, 박경모, "평균장 어닐링과 유전자 알고리즘을 결합한 부하균형 기법," 정보과학회 논문지:시스템 및 이론, 제33권, 제8호, pp. 486-494, 2006.
  8. Susmita, S. and Bhargab, S. and Bhattacharya, B., "Manhattan-diagonal routing in channels and switchboxes," ACM Trans on DABS, Vol. 09, No. 01. 2004.
  9. Yang, C. and Chen, S. and Ho, J. and Tsai, C., "Efficient routability check algorithms for segmented channel routing," ACM Trans on DABS, Vol. 05, No. 03, 2000.
  10. Ning, X.,"A Neural Network Optimization Algorithm For Channel Routing." Journal Of Computer Aided Design And Computer Graphics. Vol. 14, No. 1, 2002.
  11. Chen, S, "Bubble-Sort Approach to Channel Routing," IEE Proceedings Computer and Digital Techniques. Vol. 147, No. 6, 2000.
  12. W. Kim, C. Hong and Y. Kim, "Asynchronous Distributed Genetic Algorithm for Optimal Channel Routing," International Conference on Computational and Information Science, December, Shanghai, China, 2004.
  13. Funabiki, N. and Takefuji, Y., "A Parallel Algorithm for Channel Routing Problem." IEEE Trans. of CAD, Vol. 11, No. 4, pp.464-474, 1992. https://doi.org/10.1109/43.125094