Abstract
This paper presents a distributed genetic algorithm for the channel routing problem in MPI environments. This system is implemented on a network of personal computers running Linux operating system connected via 10Mbps Ethernet. Each slave processor generates its own sub-population using genetic operations and communicates with the master processor in an asynchronous manner to form the global population. The experimental results show that the proposed algorithm maintains the convergence properties of sequential genetic algorithm while it achieves linear speedup as the nets of the channel routing and the number of computing processors increase.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Susmita, S., Bhargab, S., Bhattacharya, B.: Manhattan-diagonal routing in channels and switchboxes. ACM Trans. on DAES 9(1) (2004)
Yang, C., Chen, S., Ho, J., Tsai, C.: Efficient routability check algorithms for segmented channel routing. ACM Trans. on DAES 5(3) (2000)
Ning, X.: A Neural Network Optimization Algorithm For Channel Routing. Journal of Computer Aided Design And Computer Graphics 14(1) (2002)
Chen, S.: Bubble-Sort Approach to Channel Routing. IEE Proceedings Computer and Digital Techniques 147(6) (2000)
Holland, J.: Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann Arbor (1988)
Funabiki, N., Takefuji, Y.: A Parallel Algorithm for Channel Routing Problem. IEEE Trans. of CAD 11(4), 464–474 (1992)
Lienig, J., Thulasiraman, K.: A New Genetic Algorithm for the Channel Routing Problem. In: ACM Proc. of the 7th International Conference on VLSI Design (1994)
Yoshimura, T., Kuh, E.S.: Efficient Algorithms for Channel Routing. IEEE Trans. of CAD CAD-1(1), 25–35 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, W., Hong, C., Kim, Y. (2004). Asynchronous Distributed Genetic Algorithm for Optimal Channel Routing. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30497-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24127-0
Online ISBN: 978-3-540-30497-5
eBook Packages: Computer ScienceComputer Science (R0)