An automated wire routing kernel

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator Starkey, Michael
Title An automated wire routing kernel
Date 1991-07
Description The kernel described here is based on using pattern matching techniques for describing algorithms. The use of patterns permits different physical constraints and properties to be considered. In addition, the abstraction provided by patterns allows the ability to transform oddly shaped routing areas to routable shapes enabling non-Manhattan routing. This pattern matching method leads to a simple interface between the routing kernel and the underlying design system. The interface places few requirements on the circuit design system providing motivation for a parallel implementation of the pattern matching process.
Type Text
Publisher University of Utah
Subject computers; kernel functions
Subject LCSH Electric circuits--Design--Data processing; Integrated circuits--Very large scale integration
Language eng
Bibliographic Citation Starkey, M. (1991). An automated wire routing kernel.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Format Medium application/pdf
Format Extent 317,191 Bytes
File Name Starkey-An_Automated_Wire.pdf
Conversion Specifications Original scanned with Kirtas 2400 and saved as 400 ppi uncompressed TIFF. PDF generated by Adobe Acrobat Pro X for CONTENTdm display
ARK ark:/87278/s6tj0mpw
Setname ir_computersa
Date Created 2015-11-02
Date Modified 2015-11-03
ID 92846
Reference URL
Back to Search Results