论文信息 - The "PI" (Placement And Interconnect) System

The "PI" (Placement And Interconnect) System

"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.

Ronald L. Rivest

[1] James Joseph Koschella. A placement/interconnect channel router : cutting your PI into slices , 1981 .

[2] Akihiro Hashimoto,et al. Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[3] J. Soukup. Circuit layout , 1981, Proceedings of the IEEE.

[4] David A. Moon,et al. The Lisp Machine manual , 1981, SGAR.

[5] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[6] Ronald L. Rivest,et al. A "Greedy" Channel Router , 1982, DAC 1982.

[7] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[8] C. Y. Lee. An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[9] Ulrich Lauther,et al. A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.

[10] Dave Hightower,et al. The interconnection problem: A tutorial , 1973, Computer.