Distributed channel routing using genetic algorithm

Authors:
Chuleui Hong;Wonil Kim;Yeongjoon Kim
Affiliations:
Software School, Sangmyung University, Seoul, Korea;Dept. of Digital Contents, College of Electronics and Information Engineering, Sejong University, Seoul, Korea;Software School, Sangmyung University, Seoul, Korea
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 0
Cited 1

Model driven scheduling framework for multiprocessor soc design

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.