Abstract
Known as an NP-Complete problem, the channel routing problem is very important in the automatic layout design of VLSI circuit and printed circuit boards. In this paper, a distributed genetic algorithm for this channel routing problem is presented in MPI environments. Each node executes genetic operations to own sub-population and communicates synchronously with other nodes to form the global population. The experimental results show that the proposed algorithm maintains the convergence properties of sequential genetic algorithm.
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Â 09(01) (2004)
Ning, X.: A Neural Network Optimization Algorithm For Channel Routing. Journal Of Computer Aided Design And Computer Graphics 14(1) (2002)
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)
Goni, B.M., Arslan, T., Turton, B.: A genetic algorithm for over-the-cell and channel area optimization. In: Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), vol. 1, pp. 586–592 (2000)
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
Hong, C., Kim, W., Kim, Y. (2004). Distributed Channel Routing Using Genetic Algorithm. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-30501-9_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24013-6
Online ISBN: 978-3-540-30501-9
eBook Packages: Computer ScienceComputer Science (R0)