Clow, Gary W. (1984) A global routing algorithm for general cells. In: 21st Conference on Design Automation, 1984. IEEE , Piscataway, NJ, pp. 45-51. ISBN 0-8186-0542-1. https://resolver.caltech.edu/CaltechAUTHORS:20160913-164654807
![]() |
PDF
- Published Version
See Usage Policy. 554kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20160913-164654807
Abstract
An algorithm is presented which accomplishes the global routing for a building block or general cell routing problem. A line search technique is employed and therefore no grid is assumed either for the module placements or the pin locations. Instead of breaking the routing surface up into channels, a maze search finds acceptable global routes while avoiding the blocks. Both multi-pin terminals and multi-terminal nets are accomodated. It is shown that the Lee-Moore grid-based approach is actually a special case of the general search algorithm presented. This algorithm is borrowed from the field of artificial intelligence where it has been applied to many state-space search problems.
Item Type: | Book Section | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||||||||
Additional Information: | © 1984 IEEE. | ||||||||||||
DOI: | 10.1109/DAC.1984.1585771 | ||||||||||||
Record Number: | CaltechAUTHORS:20160913-164654807 | ||||||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20160913-164654807 | ||||||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||||||||
ID Code: | 70325 | ||||||||||||
Collection: | CaltechAUTHORS | ||||||||||||
Deposited By: | Kristin Buxton | ||||||||||||
Deposited On: | 29 Sep 2016 23:36 | ||||||||||||
Last Modified: | 11 Nov 2021 04:27 |
Repository Staff Only: item control page