DocumentCode :
1594917
Title :
A Novel Parallel Genetic Algorithm for the Graph Coloring Problem in VLSI Channel Routing
Author :
Yu, Jiaqi ; Yu, Songnian
Author_Institution :
Shanghai Univ., Shanghai
Volume :
4
fYear :
2007
Firstpage :
101
Lastpage :
105
Abstract :
With the increasing popularization of very large scale integrated (VLSI) chips, the improvement of their performance and the reduction of their cost have become two of the most important problems. In this paper, a novel Parallel Genetic Algorithm (PGA) is successfully applied to the graph coloring problem (GCP) in VLSI channel routing problem (CRP). Five topological structures of parallel models are discussed and compared in detail. Finally, one theorem has been proposed to evaluate the parallel performance based on a large amount of experiments. By using the theorem, we could easily modify the parameters to get the better results. The purpose of the research is to promote the performance of VLSI channel routing and the parallel computing. Also, some ideas for quantity analysis of parallel computing are put forward.
Keywords :
VLSI; genetic algorithms; graph colouring; parallel processing; VLSI channel routing problem; graph coloring problem; parallel computing; parallel genetic algorithm; very large scale integrated chips; Algorithm design and analysis; Concurrent computing; Costs; Electronics packaging; Genetic algorithms; Genetic engineering; NP-hard problem; Parallel processing; Routing; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location :
Haikou
Print_ISBN :
978-0-7695-2875-5
Type :
conf
DOI :
10.1109/ICNC.2007.121
Filename :
4344651
Link To Document :
بازگشت