| 000 | 02940nam a2200409 4500 | ||
|---|---|---|---|
| 005 | 20260817163102.0 | ||
| 008 | 080998 th eng | ||
| 035 | _a.b11607695 | ||
| 099 | 9 | _aAIT Thesis no. CS-96-27 | |
| 100 | 1 | _aHu, Wen | |
| 245 | 1 | 0 | _aApplying genetic algorithm in channel routing problem |
| 260 |
_aBangkok : _bAsian Institute of Technology, _c1996 |
||
| 300 |
_a44 leaves : _bill. |
||
| 490 | 1 |
_aThesis ; _vno. CS-96-27 |
|
| 502 | _aThesis (M.Sc.) - Asian Institute of Technology, 1996 | ||
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Science. | ||
| 520 | _aIn 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. | ||
| 650 | 1 | 0 | _aGenetic algorithms |
| 700 | 1 |
_aYulu, Qi, _eChairperson |
|
| 700 | 1 |
_aBatanov, Dentcho N., _eExamination Committee |
|
| 700 | 1 |
_aSadananda, Ramakoti, _eExamination Committee |
|
| 710 | 2 |
_aGovernment of China, _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. CS-96-27 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B14607 |
||
| 907 |
_a.b11607695 _bmnait _cx |
||
| 902 | _a240401 | ||
| 998 |
_b0 _c970513 _dm _ea _fx _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c20 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120675870 _bCREATED : 1997-05-13 _cRECORD # : i11940803 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120675987 _bCREATED : 1997-05-13 _cRECORD # : i11940815 _dLPATRON : 1016194 _eLCHKIN : 2003-10-11 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 7 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120355788 _bCREATED : 2016-06-15 _cRECORD # : i13037183 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c7341 _d7341 |
||