Routing using a pyramid data structure

A general-purpose routing algorithm is proposed. Ideas behind both the maze-running algorithm and the hierarchical routing algorithm are combined into a hybrid routing algorithm. The new algorithm demonstrates a speed compatible to a hierarchical router and produces routings with quality equivalent to that by a maze router. Hybrid routing is based on the maze-running method with a third search dimension added. The extra search space is built by recursively constructing a hierarchy of coarser grid meshes. A user-given parameter can turn this algorithm into a pure maze router, a pure hierarchical router, or a wide spectrum of hybrid routers with different speed/quality characteristics between the extremes. With this approach, it is possible to handle easily a routing of large size, such as those encountered in the sea-of-gate layout.<<ETX>>

[1]  Jeffrey H. Hoel.  Some Variations of Lee's Algorithm , 1976, IEEE Transactions on Computers.

[2]  Jiri Soukup,et al.  Fast Maze Router , 1978, 15th Design Automation Conference.

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  A Detailed Router Based on Incremental Routing Modifications: Mighty , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[5]  Yu-Chin Hsu,et al.  A detailed router based on simulated evolution , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[6]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Trevor Mudge,et al.  WIRE ROUTING EXPERIMENTS ON A RASTER PIPELINE SUBARRAY MACHINE. , 1983 .

[8]  Alexander Iosupovici,et al.  A Class of Array Architectures for Hardware Grid Routers , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.