Routing algorithms in the physical design of VLSI circuits

In this thesis, we solve several important routing problems in the physical design of VLSI circuits. We successfully apply combinatorial optimization techniques to these problems and obtain very effective and efficient algorithms. The experimental results presented in this thesis show that these algorithms produce high quality routing solutions on a wide range of test circuits using reasonable amount of computation time.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Cong, Jingsheng

Contributors dc:contributor

• Liu, C.L.

• Engineering, Electronics and Electrical
• Physics, Electricity and Magnetism
• Computer Science

Statement dc:rights

• Copyright 1990 Cong, Jingsheng

Language dc:language

eng

Identifier

AAI9114210
(UMI)AAI9114210

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/19656