- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- A heuristic algorithm for automated routing in integrated...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
A heuristic algorithm for automated routing in integrated circuits Sepasi, Amir Hossein
Abstract
In recent years artificial intelligence techniques have been extensively applied to. real world problems. Two common characteristics of the problems amenable to heuristics are: their large search space that makes exhaustive search practically impossible; and for most applications the need to find a near-optimal solution - instead of exact - in a reasonable and cost effective time frame. Most of the problems throughout the design of Very Large Scale Integration (VLSI) circuits are combinatorial, which implies a huge search space. Furthermore the sheer number of components makes exhaustive search impossible. One of the common problems in this area is routing the terminals in the layout in a reasonable amount of time. Until very recently, manual routing was the most reliable way of doing routing. As the scale of integration grows, manual routing becomes practically impossible. There has been lots of research and studies on how automated routing can successfully replace manual routing. The purpose of this thesis is a to find an automated method that helps find a good solution to this problem in a reasonable amount of time.
Item Metadata
Title |
A heuristic algorithm for automated routing in integrated circuits
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2003
|
Description |
In recent years artificial intelligence techniques have been extensively applied to. real world
problems. Two common characteristics of the problems amenable to heuristics are: their large
search space that makes exhaustive search practically impossible; and for most applications the
need to find a near-optimal solution - instead of exact - in a reasonable and cost effective time
frame.
Most of the problems throughout the design of Very Large Scale Integration (VLSI) circuits are
combinatorial, which implies a huge search space. Furthermore the sheer number of components
makes exhaustive search impossible. One of the common problems in this area is routing the
terminals in the layout in a reasonable amount of time. Until very recently, manual routing was
the most reliable way of doing routing. As the scale of integration grows, manual routing
becomes practically impossible. There has been lots of research and studies on how automated
routing can successfully replace manual routing. The purpose of this thesis is a to find an
automated method that helps find a good solution to this problem in a reasonable amount of time.
|
Extent |
3670362 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-11-16
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0091218
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2004-05
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.