|Listed in category:
Have one to sell?

An Artificial Intelligence Approach to VLSI Routing

Condition:
Brand New
3 available
Price:
US $168.08
ApproximatelyS$ 226.83
Postage:
Free Economy Postage. See detailsfor shipping
Located in: NY, United States
Delivery:
Estimated between Mon, 13 May and Fri, 17 May to 43230
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the postage service selected, the seller's postage history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. See details- for more information about returns
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)

Shop with confidence

eBay Premium Service
Trusted seller, fast shipping, and easy returns. 

Seller information

Registered as a Business Seller
Seller assumes all responsibility for this listing.
eBay item number:335217334205
Last updated on Apr 24, 2024 17:08:05 SGTView all revisionsView all revisions

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
PublishedOn
2013-10-04
Title
An Artificial Intelligence Approach to VLSI Routing
ISBN
9781461296065
Publication Year
2011
Series
The Springer International Series in Engineering and Computer Science Ser.
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
Artificial Intelligence Approach to Vlsi Routing
Author
R. Joobbani
Item Length
10in
Publisher
Springer
Item Width
7in
Item Weight
12.7 Oz
Number of Pages
Xxii, 160 Pages

About this product

Product Information

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.

Product Identifiers

Publisher
Springer
ISBN-10
1461296064
ISBN-13
9781461296065
eBay Product ID (ePID)
175734446

Product Key Features

Author
R. Joobbani
Publication Name
Artificial Intelligence Approach to Vlsi Routing
Format
Trade Paperback
Language
English
Publication Year
2011
Series
The Springer International Series in Engineering and Computer Science Ser.
Type
Textbook
Number of Pages
Xxii, 160 Pages

Dimensions

Item Length
10in
Item Width
7in
Item Weight
12.7 Oz

Additional Product Features

Series Volume Number
9
Number of Volumes
1 Vol.
Lc Classification Number
Tk7867-7867.5
Table of Content
1. Introduction.- 1.1. Motivation.- 1.2. Outline.- 2. Detailed Routing.- 2.1. Problem Statement.- 2.2. Important Factors in Routing.- 2.3. Previous Approaches.- 2.3.1. Lee Algorithm.- 2.3.2. Line Routing Algorithms.- 2.3.3. Efficient Algorithms for Channel Routing.- 2.3.4. A "Greedy" Channel Router.- 2.3.5. Hierarchical Wire Routing.- 2.4. Characteristics of Previous Approaches.- 3. WEAVER Approach.- 3.1. Congestion.- 3.2. Wire Length.- 3.3. Rectilinear Steiner Tree.- 3.3.1. Steiner Tree.- 3.3.2. Minimal Rectilinear Steiner Tree for a 2xn Grid.- 3.3.3. Minimal Rectilinear Steiner Tree for A mxn Grid.- 3.4. Merging.- 3.5. Vertical/Horizontal Constraint Graph.- 3.6. Intersection.- 3.7. Conflicting Effects.- 4. Knowledge-Based Expert Systems.- 4.1. Productions Systems.- 4.2. OPS5.- 4.2.1. Working Memory.- 4.2.2. Production Memory.- 4.2.3. Interpreter.- 4.3. Applicability of Knowledge-Based Expert Systems to VLSI Design.- 4.3.1. Detailed Routing of VLSI Chips is Amenable to the Techniques of Applied AI.- 4.3.2. Detailed Routing of VLSI Chips is Important, Difficult and a High-Value Problem.- 4.4. Advantages and Disadvantages of Knowledge-Based Expert Systems.- 5. WEAVER Implementation.- 5.1. Problem State Representation.- 5.2. WEAVER Architecture.- 5.3. Blackboard Organization.- 5.4. WEAVER Experts.- 5.4.1. Wire Length Expert.- 5.4.2. Merging Expert.- 5.4.3. Congestion Expert.- 5.4.4. Vertical/Horizontal Constraint Expert.- 5.4.5. Via Expert.- 5.4.6. Common Sense Expert.- 5.4.7. Pattern Router Expert.- 5.4.8. Constraint Propagation Expert.- 5.4.9. User Expert.- 5.4.10. Minimal Rectilinear Steiner Tree Expert.- 5.5. WEAVER Control Structure.- 5.5.1. Nature of WEAVER Expertise.- 5.5.2. Generality of WEAVER Knowledge.- 5.6. Program Organization.- 6. Experiments and Results.- 6.1. Input/Output.- 6.1.1. Input.- 6.1.2. Output.- 6.2. Step by Step Trace of Routing a Channel.- 6.3. Experiments.- 6.3.1. Comparison with Efficient Algorithms for Channel Routing.- 6.3.2. Comparison with the Greedy Algorithm When Both can Route the Channel.- 6.3.3. WEAVER's Routing of a Channel Unroutable by the Greedy Algorithm.- 6.3.4. WEAVER's Solution to Provably Unroutable Channel and Switch-Box by Traditional Algorithms.- 6.3.5. Comparison with Aker's and Lee Algorithms.- 6.3.6. Comparison with the Minimum-Impact Routing Algorithm.- 6.3.7. Burstein's Difficult Switch-Box.- 6.3.8. Terminal Intensive Example.- 6.3.9. Dense Switch-Box Example.- 6.3.10. Conclusion to the Experiments.- 6.4. WEAVER's Performance Under Conditions of Disabled Experts.- 6.4.1. Merging Expert Disabled.- 6.4.2. Congestion and Merging Experts Disabled.- 6.4.3. Via Expert Disabled.- 6.4.4. Vertical/Horizontal Constraint Expert Partially Disabled.- 6.4.5. Rectilinear Steiner Tree Expert Disabled.- 6.4.6. Summary of the Results of Disabling the Experts.- 6.5. Efficiency Issues.- 6.5.1. Possible Execution Time Improvement.- 6.5.2. Writing Efficient OPS5 Programs.- 7. Conclusions and Future Work.- References.
Copyright Date
1986
Target Audience
Scholarly & Professional
Topic
Intelligence (Ai) & Semantics, Electronics / Circuits / General, Electrical
Illustrated
Yes
Genre
Computers, Technology & Engineering

Item description from the seller

Business seller information

Value Added Tax Number:
  • GB 724498118
Awesomebooksusa

Awesomebooksusa

97.9% positive feedback
1.2M items sold

Detailed Seller Ratings

Average for the last 12 months

Accurate description
4.8
Reasonable shipping cost
5.0
Shipping speed
4.9
Communication
4.9

Popular categories from this store

Seller feedback (511,672)

l***n (282)- Feedback left by buyer.
Past month
Verified purchase
Item in good condition, as described. Soundly packed and shipped. Excellent result!
c***h (281)- Feedback left by buyer.
Past month
Verified purchase
Sound, clean copy. Used with some entries made. New User thinks entries from '80's add interest.
g***n (11)- Feedback left by buyer.
Past month
Verified purchase
Book was in excellent condition for a 25 yo book. Looks like no one ever read it. Thank you