1 AIT Asian Institute of Technology

Applying genetic algorithm in channel routing problem

AuthorHu, Wen
Call NumberAIT Thesis no. CS-96-27
Subject(s)Genetic algorithms
NoteA thesis submitted in partial fulfillment of the requirements for the degree of Master of Science.
PublisherAsian Institute of Technology
Series StatementThesis ; no. CS-96-27
AbstractIn 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.
Year1996
Corresponding Series Added EntryAsian Institute of Technology. Thesis ; no. CS-96-27
TypeThesis
SchoolSchool of Engineering and Technology (SET)
DepartmentDepartment of Information and Communications Technologies (DICT)
Academic Program/FoSComputer Science (CS)
Chairperson(s)Yulu, Qi
Examination Committee(s)Batanov, D. N.;Sadananda, R.
Scholarship Donor(s)Government of China.
DegreeThesis (M.Sc.) - Asian Institute of Technology, 1996


Usage Metrics
View Detail0
Read PDF0
Download PDF0