AI SearchApplying genetic algorithm in channel routing problem
Call Number: AIT Thesis no. CS-96-27 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. CS-96-27Publication details: Bangkok : Asian Institute of Technology, 1996Description: 44 leaves : illSubject(s): Online resources: Dissertation note: Thesis (M.Sc.) - Asian Institute of Technology, 1996 Summary: In VLSI layout design, a significant portion of chip area is used for channel routing. Compaction is the last step in the VLSI physical design. The objective of channel routing compaction is to minimize the channel height so to reduce the chip area. The two techniques used in channel routing compaction are track permutation and local re-routing, both of them are NP hard problem. In this study, we developed a Genetic Algorithm-based system for the channel routing compaction stage. The channel routing solution patterns were represented by twodimensional chromosomes. The powerful GA operators are applied to get a new pattern of channel routing compaction solution. We design the evaluation function considering both the track height and total via confliction. The system can easily accommodate the user requirements by adjusting the GA parameters accordingly. We have conducted experiment on six well-known benchmark problems. The effects of different GA parameters are discussed, also convergence of GA is discussed. The result shows that our system can produce compacted solutions to the channel routing patterns.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. CS-96-27 (Browse shelf(Opens below)) | 1 | Available | 30050120675870 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. CS-96-27 (Browse shelf(Opens below)) | 2 | Available | 30050120675987 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. CS-96-27 (Browse shelf(Opens below)) | Available | 30050120355788 |
Thesis (M.Sc.) - Asian Institute of Technology, 1996
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science.
In VLSI layout design, a significant portion of chip area is used for channel routing. Compaction is the last step in the VLSI physical design. The objective of channel routing compaction is to minimize the channel height so to reduce the chip area. The two techniques used in channel routing compaction are track permutation and local re-routing, both of them are NP hard problem. In this study, we developed a Genetic Algorithm-based system for the channel routing compaction stage. The channel routing solution patterns were represented by twodimensional chromosomes. The powerful GA operators are applied to get a new pattern of channel routing compaction solution. We design the evaluation function considering both the track height and total via confliction. The system can easily accommodate the user requirements by adjusting the GA parameters accordingly. We have conducted experiment on six well-known benchmark problems. The effects of different GA parameters are discussed, also convergence of GA is discussed. The result shows that our system can produce compacted solutions to the channel routing patterns.
There are no comments on this title.