A Switchbox Router with Obstacle Avoidance

  title={A Switchbox Router with Obstacle Avoidance},
  author={Gordon T. Hamachi and John K. Ousterhout},
  journal={21st Design Automation Conference Proceedings},
Detour is the channel router used by the Magic layout system. Based on Rivest and Fiduccia's "greedy" channel router, Detour is capable of routing switchboxes and channels containing obstacles such as preexisting wiring. It jogs nets around multi-layer obstacles such as contacts, and routes over single-layer obstacles. If there are no obstacles, results are comparable to other good channel routers. Detour thus combines the effectiveness of traditional channel routers with the flexibility of net… 

Figures and Tables from this paper

Computational-Geometry-Based Tool for Switchbox Routing

Its solution qual- ity with respect to wire length was better than or comparable to the best previous solutions and its via usage was consistently the minimum, which makes it appropriate for its intended use as the initial router invoked to solve a switchbox.

An efficient VLSI switch-box router

A divide-and-conquer algorithm is used to explore the greedy channel routing idea, using techniques such as routing area partitioning, dynamic routing strategies, and sweeping concurrent bidirectional columns.

A Tile-Expansion Router

A router based on a tile-expansion algorithm and corner stitching data structure is presented. This program finds connections with a minimum number of jogs and it ensures that a possible solution

A new 3-layer rectilinear area router with obstacle avoidance

WEAVER: A Knowledge-Based Routing Expert

WEAVER, a channel/switchbox knowledge-based routing program, simultaneously considers all the important routing metrics including 100 percent routability, minimum routing area, minimum wire length,

A general and flexible switchbox router: CARIOCA

A switchbox router utilizing layers is presented, including Burstein's difficult switchbox, which has been implemented in the LISP programming language with a blackboard architecture.

Interactive optimal channel router for critical nets

Router is implemented in five modules, basic interactive module, net partitioning module, automatic and interactive initial routers, and the modification router, which shows that a net can have more than one minimum wiring length routing.

BEAVER: a computational-geometry-based tool for switchbox routing

  • J. CohoonP.L. Heck
  • Computer Science
    IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1988
BEAVER combines a delayed layering scheme with computational geometry techniques to heuristically produce a switchbox solution that minimizes both via and usage and wire length, and maximizes the use

Glitter: A Gridless Variable-Width Channel Router

  • Howard H. ChenE. Kuh
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1986
The objective is to minimize the routing area, while keeping the constraints of wire widths and spacing satisfied, in a gridless router capable of handling channels with irregular boundaries, and cyclic constraints.



A "Greedy" Channel Router

A new, "greedy", channel-router that always succeeds, usually using no more than one track more than required by channel density, and may occasionally add a new track to the channel to avoid "getting stuck".

Efficient Algorithms for Channel Routing

  • T. YoshimuraE. Kuh
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1982
Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.

The "PI" (Placement And Interconnect) System

  • R. Rivest
  • Computer Science
    19th Design Automation Conference
  • 1982
The structure of PI is reviewed, and details on the signal-routing heuristics are presented, focusing on the definition of "channels", the global router, the "crossing placer", and the channel routers.

Hierarchical Wire Routing

  • M. BursteinR. Pelavin
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1983
A new approach to automatic wire routing of VLSI chips which is applicable to interconnection problem in uniform structures such as gate arrays, switchboxes, channels and is inherently fast, usually by an order of magnitude faster than the routers based on wave propagation (maze running) technique.

An Algorithm for Path Connections and Its Applications

  • C. Y. Lee
  • Computer Science, Mathematics
    IRE Trans. Electron. Comput.
  • 1961
The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently

Magic: A VLSI Layout System

The Magic layout system incorporates expertise about design rules and connectivity directly into the layout system in order to implement powerful new operations, including: a continuous design-rule checker that operates in background to maintain an up-to-date picture of violations.

Circuit layout

A general overview of circuit layout, taking a unified approach to various styles of integrated circuits, printed circuit boards, and hybrid circuits, and problems associated with the implementation of a hierarchical system are discussed.

A solution to line-routing problems on the continuous plane

A new line-routing algorithm based on the continuous plane, which is much faster than the conventional method and has given good results when applied to many line- routing problems such as mazes, printed circuit boards, substrates, and PERT diagrams.

The Berkeley Building-Block Layout System for VLSI Design

  • ERL memo UCB/ERL M83/10
  • 1983