ACM Home Page
Please provide us with feedback. Feedback
Geometrical compaction in one dimension for channel routing
Full text PdfPdf (1.91 MB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 24th ACM/IEEE Design Automation Conference table of contents
Miami Beach, Florida, United States
Pages: 140 - 145  
Year of Publication: 1987
ISBN:0-8186-0781-5
Authors
J. Royle  SDA Systems Inc., 555 River Oaks Parkway, San Jose, California
M. Palczewski  SDA Systems Inc., 555 River Oaks Parkway, San Jose, California
H. VerHeyen  SDA Systems Inc., 555 River Oaks Parkway, San Jose, California
N. Naccache  SDA Systems Inc., 555 River Oaks Parkway, San Jose, California
J. Soukup  SDA Systems Inc., 555 River Oaks Parkway, San Jose, California
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 7,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/37888.37909
What is a DOI?

ABSTRACT

A channel router which is to be effective for general-purpose automatic routing must be able to use different sets of routing criteria priorities, in a controllable manner. We present an approach to channel routing with compaction in which channel compaction is adaptable to several routing criteria priorities. We show how overall channel routing performance can be improved by taking advantage of this versatility in channel compaction. We indicate some routing capabilities which cannot be effectively achieved by simply post-processing the output of a traditional gridded channel router. Our solution to this problem is outlined and some results obtained from our router are compared with those of other published channel routers.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Bur83
 
Che85
ellen, H.H., and Kuh, E.S., "A Variable-width Gridless Channel Router", Proc. ICCAD-85, pp. 304-306, 1985.
 
Cie82
Deu76
 
Deu85
Dcutsch, D., "Compacted Channel Routing", Proc. ICCAD- 85, pp. 223-225, 1985.
 
Hsu83
 
Ked83
 
LaP80
LaPaugh, A., "Algorithms for Integrated Circuit Layout: an Analytic Approach", Ph.D. Thesis, MIT, 1980.
 
Pre85
 
Riv82
 
San84
Sangiovanni-Vincentelli, A.S., Santomauro, M., and Reed, J., "A New Gridless Channel Router: Yet Another Channel Router the Second (YACR-II)", Proc. ICCAD-84, pp. 72-75, 1984.
 
Sch83
 
Sou83
Soukup, J., "Routing on one layer - an algorithm and its implementation", Proceexlings 1983 IEEE International Conference on Computer Design, Port Chester, N.Y., pp 126-135, 1983.
 
Szy85
Szymanski, T.G., "Dogleg Channel Routing is N-P- complete", IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. CAD-4, No. 1, pp. 31.40, 1985.
 
Yos80
Yoshimum, T. and Kuh, E., "Efficient Algorithms for Channel Routing", U.C. Berkeley Electronics Research Laboratory Memo, No. M80/43, 1980.


Collaborative Colleagues:
J. Royle: colleagues
M. Palczewski: colleagues
H. VerHeyen: colleagues
N. Naccache: colleagues
J. Soukup: colleagues

Peer to Peer - Readers of this Article have also read: