DocumentCode :
2825428
Title :
A hierarchical genetic algorithm for multi-layer channel routing
Author :
Cloyed, Mark P. ; Ali, Hesham H.
Author_Institution :
Dept. of Comput. Sci., Nebraska Univ., Omaha, NE, USA
Volume :
3
fYear :
2003
fDate :
27-30 Dec. 2003
Firstpage :
1536
Abstract :
In this paper, the authors presented an evolutionary approach to one of the most demanding phase in physical design that is channel routing. A genetic algorithm for multi-layer channel routing that employs advanced genetic operators is introduced. A multi-layer approach is used to evaluate the use of various layering schemes, and also to reduce the number of constraints involved. When multi-terminal nets or multi-nets are involved, a division parameter is introduced to determine if the best results are generated by treating the multi-net as a whole, or broken down into as small as two-terminal nets. A hierarchical genetic algorithm is used to generate a set of near-optimal solutions and a compaction algorithm is used to further improve the output. The algorithm provided solutions within at most one track from the optimal for the problem sets with acyclic vertical constraints.
Keywords :
VLSI; electronic design automation; genetic algorithms; hierarchical systems; integrated circuit interconnections; multilayers; network routing; compaction algorithm; hierarchical genetic algorithm; multilayer channel routing; near optimal solutions; physical design; Circuits; Compaction; Educational institutions; Genetic algorithms; Joining processes; Pins; Process design; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2003 IEEE 46th Midwest Symposium on
ISSN :
1548-3746
Print_ISBN :
0-7803-8294-3
Type :
conf
DOI :
10.1109/MWSCAS.2003.1562589
Filename :
1562589
Link To Document :
بازگشت