Skip to main content
SpringerLink
Log in

An Artificial Intelligence Approach to VLSI Routing

  • Book
  • © 1986

Overview

Authors:
  1. Rostam Joobbani

    1. Carnegie-Mellon University, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xxi
    Download chapter PDF

  2. Introduction

    • Rostam Joobbani
    Pages 1-4

  3. Detailed Routing

    • Rostam Joobbani
    Pages 5-20

  4. Weaver Approach

    • Rostam Joobbani
    Pages 21-41

  5. Knowledge-Based Expert Systems

    • Rostam Joobbani
    Pages 43-54

  6. WEAVER Implementation

    • Rostam Joobbani
    Pages 55-93

  7. Experiments and Results

    • Rostam Joobbani
    Pages 95-140

  8. Conclusions and Future Work

    • Rostam Joobbani
    Pages 141-145

  9. Back Matter

    Pages 147-159
    Download chapter PDF
Back to top

Keywords

About this book

Routing of VLSI chips is an important, time consuming, and difficult problem. The difficulty of the problem is attributed to the large number of often conflicting factors that affect the routing quality. Traditional techniques have approached routing by ignoring some of these factors and imposing unnecessary constraints in order to make routing tractable. In addition to the imposition of these restrictions, which simplify the problems to a degree but at the same time reduce the routing quality, traditional approaches use brute force. They often transform the problem into mathematical or graph problems and completely ignore the specific knowledge about the routing task that can greatly help the solution. This thesis overcomes some of the above problems and presents a system that performs routing close to what human designers do. In other words it heavily capitalizes on the knowledge of human expertise in this area, it does not impose unnecessary constraints, it considers all the different factors that affect the routing quality, and most importantly it allows constant user interaction throughout the routing process. To achieve the above, this thesis presents background about some representative techniques for routing and summarizes their characteristics. It then studies in detail the different factors (such as minimum area, number of vias, wire length, etc.) that affect the routing quality, and the different criteria (such as vertical/horizontal constraint graph, merging, minimal rectilinear Steiner tree, etc.) that can be used to optimize these factors.

Authors and Affiliations

  • Carnegie-Mellon University, USA

    Rostam Joobbani

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation