Introduction to VLSI Systems
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
A min-cut placement algorithm for general cell assemblies based on a graph representation
DAC '79 Proceedings of the 16th Design Automation Conference
Lisp machine manual
Routing multiterminal nets around a rectangle
IEEE Transactions on Computers - The MIT Press scientific computation series
Fast heuristics for minimum length rectangular partitions of polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Optimal Rotation Problems in Channel Routing
IEEE Transactions on Computers
A preliminary investigation into parallel routing on a hypercube computer
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
On improving channel routability
ACM SIGDA Newsletter
A linear time algorithm for optimal routing around a rectangle
Journal of the ACM (JACM)
25 years of DAC Papers on Twenty-five years of electronic design automation
Channel routing of multiterminal nets
Journal of the ACM (JACM)
Nearly optimal algorithms and bounds for multilayer channel routing
Journal of the ACM (JACM)
Node-disjoint paths on the mesh and a new trade-off in VLSI layout
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SOLO: a generator of efficient layouts from optimized MOS circuit schematics
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Hierarchial global wiring for custom chip design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Global forced hierarchical router
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Bounds for partitioning rectilinear polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
Recent results in VLSI CAD at MIT
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Wire Ordering for Detailed Routing
IEEE Design & Test
CAF: A computer-assisted floorplanning tool
DAC '83 Proceedings of the 20th Design Automation Conference
A global routing algorithm for general cells
DAC '84 Proceedings of the 21st Design Automation Conference
A symbolic-interconnect router for custom IC design
DAC '84 Proceedings of the 21st Design Automation Conference
DAC '84 Proceedings of the 21st Design Automation Conference
A switchbox router with obstacle avoidance
DAC '84 Proceedings of the 21st Design Automation Conference
A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An approximation algorithm for manhattan routing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
DAC '82 Proceedings of the 19th Design Automation Conference
Iterative compaction: an improved approach to graph and circuit bisection
EURO-DAC '91 Proceedings of the conference on European design automation
On the number of rectangular partitions
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
“PI” is an advanced LISP-based placement and interconnect system for custom NMOS or CMOS (single-layer metal) designs. When fully implemented, PI will handle placement of arbitrarily-sized rectangular modules, routing of power and ground, signal routing, and compaction. In this paper we briefly review the structure of PI, and present details on the signal-routing heuristics, focusing on the definition of “channels”, the global router, the “crossing placer”, and the channel routers. The signal router is fully operational; the rest of PI is currently being coded and will be more fully described in later papers and theses.