Asynchronous distributed genetic algorithm for optimal channel routing

Authors:
Wonil Kim;Chuleui Hong;Yeongjoon Kim
Affiliations:
Dept. of Digital Contents, College of Electronics and Information Engineering, Sejong University, Seoul, Korea;Software School, Sangmyung University, Seoul, Korea;Software School, Sangmyung University, Seoul, Korea
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 2
Cited 0

Efficient routability check algorithms for segmented channel routing

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Manhattan-diagonal routing in channels and switchboxes

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

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.