Browse > Article
http://dx.doi.org/10.6109/jkiice.2010.14.2.287

Distributed Mean Field Genetic Algorithm for Channel Routing  

Hong, Chul-Eui (상명대학교 컴퓨터과학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.14, no.2, 2010 , pp. 287-295 More about this Journal
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.
Keywords
parallel/distributed processing; mean field annealing; simulated annealing; genetic algorithm; channel routing;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 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.   DOI   ScienceOn
2 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.   DOI   ScienceOn
3 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.
4 Yonghuai Liu, "A mean field annealing approach to accurate free form shape matching," Pattern Recognition, Volume 40, Issue 9, pp.2418-2436, September 2007.   DOI   ScienceOn
5 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.
6 Funabiki, N. and Takefuji, Y., "A Parallel Algorithm for Channel Routing Problem." IEEE Trans. of CAD, Vol. 11, No. 4, pp.464-474, 1992.   DOI   ScienceOn
7 Chen, S, "Bubble-Sort Approach to Channel Routing," IEE Proceedings Computer and Digital Techniques. Vol. 147, No. 6, 2000.
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 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.
12 홍철의, 박경모, "평균장 어닐링과 유전자 알고리즘을 결합한 부하균형 기법," 정보과학회 논문지:시스템 및 이론, 제33권, 제8호, pp. 486-494, 2006.   과학기술학회마을
13 Bultan, T. and C. Aykanat, "A New Mapping Heuristic Based on Mean Field Annealing," Journal of Parallel & Distributed Computing, 16, pp. 292-305, 1992.   DOI   ScienceOn