A New Symbolic Channel Router: YACR2

@article{Reed1985ANS,
  title={A New Symbolic Channel Router: YACR2},
  author={James Reed and Alberto L. Sangiovanni-Vincentelli and Mauro Santomauro},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  year={1985},
  volume={4},
  pages={208-219}
}
YACR2 is a channel router that minimizes the number of through vias in addition to the area used to complete the routing in a two-layer channel. It can route channels with cyclic constraints and uses a virtual grid. YACR2 uses preferably one layer for the horizontal segments of the nets and the other for the vertical ones but it may require the routing of a few horizontal segments in the second layer. Experimentally YACR2 performs better than any of the channel routers proposed thus far both in… 
A Revisit to YACRIT: Yet Another Channel Router with Interchangeable Terminals
TLDR
New algorithms for routing two rows of interchangeable terminals across a two-layer channel are presented, and with the help of each of the algorithms developed in this paper at least one feasible solution is always computed without doglegging.
Techniques for multilayer channel routing
TLDR
The techniques described have been implemented in a multilayer channel router called Chameleon, which has produced optimal results on a wide range of industrial and academic examples for a variety of layer and pitch combinations, and can handle a range of technology constraints.
A robust channel router
  • Uzi Yoeli
  • Environmental Science
    IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1991
TLDR
A robust channel router with simple heuristics that is robust in the sense that small changes in the input or in the algorithm do not have a major effect on the results, which is a key feature of its ability to support the wide variety of routing models.
Codar: a congestion-directed general area router
  • Ping-San Tzeng, C. Séquin
  • Computer Science
    [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers
  • 1988
TLDR
A general area router that integrates the phases of global routing and detailed routing has been developed, resulting in a router that can solve difficult problems not solvable by other programs while exhibiting runtimes that grow only moderately with the size of the routing problem.
A gridless multilayer channel router
  • R. Yazdani, M. Zargham
  • Computer Science
    Proceedings., Fourteenth Annual International Computer Software and Applications Conference
  • 1990
TLDR
Having no restriction on the direction of each layer was important in achieving a more efficient solution for a channel, and this feature helped minimize the channel with the wire length, and the number of contacts.
Net characterization based channel router: FT router
  • H. Zhu, R. Fujii
  • Computer Science
    [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers
  • 1988
TLDR
The authors' track-assignment type routing algorithm makes use of an extensive set of net characteristics/relationships to perform a more sophisticated search for an optimal routing layout than the less other channel routers.
An efficient two-layer irregular-channel router
  • Y.-T. Chen, P. Fisher
  • Business
    Proceedings of the 33rd Midwest Symposium on Circuits and Systems
  • 1990
TLDR
An efficient two-layer irregular-channel router is presented which is suitable for both regular and irregular channels and can be used in conjunction with the CF mask generator to generate masks.
A new over-the-cell channel router
  • P. Huang, X. Hong, E. Wang
  • Computer Science, Physics
    [Proceedings] 1992 IEEE International Symposium on Circuits and Systems
  • 1992
TLDR
A new over-the-cell channel router is presented that reduces the channel density as far as possible by routing some critical nets over the cells, and routing within the channel.
A multiple layer contour-based gridless channel router
  • P. Groeneveld
  • Computer Science
    IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1990
TLDR
An n-layer gridless channel router is presented that uses a set of contours as a routing framework and is shown that this router is also versatile enough to handle the classic vertical constraint problem.
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
A "Greedy" Channel Router
TLDR
A new, “greedy”, channel-router that always succeeds, usually using no more than one track more than required by channel density, and may be forced in rare cases to make a few connections "off the end” of the channel.
Efficient Algorithms for Channel Routing
  • T. Yoshimura, E. Kuh
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1982
TLDR
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.
A “DOGLEG” channel router
TLDR
The routing algorithm presented here was developed as part of LTX, a computer-aided design system for integrated circuit layout and was implemented on an HP-2100 minicomputer.
Dogleg Channel Routing is NP-Complete
  • T. G. Szymanski
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1985
TLDR
It is shown that an efficient optimal algorithm for interconnecting two rows of points across an intervening channel is unlikely to exist by establishing that this problem is NP-complete.
The Minimum Width Routing of a 2-Row 2-Layer Polycell-Layout
TLDR
A new routing principle is presented that leads to an algorithm to realize the minimum width of the 2-layer channel area between two rows of terminals to be interconnected and practically applicable routing algorithms based on this principle are developed.
The TimberWolf placement and routing package
TLDR
TimberWolf is an integrated set of placement and routing optimization programs for standard cell, macro/custom cell, and gate-array placement, as well as standard cell global routing.