Name
Abstract | ||
|---|---|---|
Layer assignment is an important post-layout optimization technique in very large scale integrated circuit (VLSI) layout automation. It re-assigns wire segments in a routing solution to appropriate layers to achieve certain optimization objectives. The paper focuses on investigating the layer assignment problem with application to via minimization, which is known to be NP-complete. A knowledge based genetic algorithm for the layer assignment problem is proposed, with the aim of utilizing domain specific knowledge to speed up the process of evolution and to improve the quality of solutions. Experimental results show that this knowledge based genetic algorithm can consistently produce the same or better results than a heuristic algorithm and a traditional genetic algorithm |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ACSC.2001.906641 | ACSC |
Keywords | DocType | Volume |
computational complexity,heuristic algorithm,vlsi,network routing,minimisation,routing,topology,software engineering,genetic algorithms,automation,very large scale integration,mathematics,np complete | Conference | 23 |
Issue | ISSN | ISBN |
1 | 1530-0900 | 0-7695-0963-0 |
Citations | PageRank | References |
1 | 0.37 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maolin Tang | 1 | 76 | 4.83 |
| Kamran Eshraghian | 2 | 101 | 27.54 |
| Daryoush Habibi | 3 | 82 | 20.85 |