ACM Home Page
Please provide us with feedback. Feedback
WEAVER: a knowledge-based routing expert
Full text PdfPdf (686 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 22nd ACM/IEEE Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 266 - 272  
Year of Publication: 1985
ISBN:0-8186-0635-5
Authors
Rostam Joobbani  Department of Electrical and Computer Engineering, Carnegie-Mellon University, Schenley Park, Pittsburgh, PA
Daniel P. Siewiorek  Department of Electrical and Computer Engineering, Carnegie-Mellon University, Schenley Park, Pittsburgh, PA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 18,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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/317825.317869
What is a DOI?

ABSTRACT

In this paper we describe WEAVER, a channel/switch-box knowledge-based routing program. WEAVER considers all the important routing metrics such as 100% routability, minimum routing area, minimum wire length, and minimum number of vias simultaneously. It allows pre-routed nets, and user interaction throughout the entire routing process. It also relaxes unnecessary constraint of assigning different layers to different directions, the constraint imposed by all of the current channel and switch-box routers. WEAVER is a grid-based router that utilizes two interconnection layers and can be easily expanded to route any shape routing area such as 'T' or '+'. Implemented in OPS5, a production system language, WEAVER routinely produces routings requiring less area than routers that focus on a single routing metric.


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.

 
1
Hightower D.H., The Interconnection Problem- A Tutorial IEEE Computer Society, 1980, pp. 252-272.
 
2
Breuer, M. A., Design Automation of Digital Systems, Prentice-Hall, Vol. 1, 1972.
 
3
Lee, C. Y., "An Algorithm for Path Connections and its Application", IRE Transactions on Electronic Computers, September 1961, pp. 346-365.
 
4
Persky, G., D. N. Oeutsch, and D. G. Schweikert, "LTX- A minicomputer-based System for Automatic LSI Layout", Journal of Design Automation and Fault- Tolerant Computing, VOJ. 1, No. 3, May 19;'7, pp. 217.255.
 
5
Yoshimura, T., and E. S. Kuh, "Efficient Algorithms for Channel Routing", IEEE Transactions on Computer- Aided Design of integrated Circuits and Systems, Vol, CAD. 1, No. 1, January 1982, pp. ;!5-35.
 
6
 
7
 
8
Burstein, M., and R. Pelavin, "Hierarchical Wire Routing" IEEE Transactions on Computer-Aided Design of Integrated Circuits and systems, Vol. CAD-2, No. 4, October 1983, pp. 223.234.
 
9
Soukup, j., "Global Router", Journal of Digital Systems, VoI. iV, No. 1, Spring 1980, pp. 59-69.
 
10
Barr, A., and E.A. Feigenbaum (~.<litors.), The Handbook of Artificial Intelligence (vols 1, 2, 3), Los Altos, CA: Kaufmann, 1981,1982.
 
11
12
 
13
Balzer, R., L.D. Erman, P. London, and C. William, "Hearsay-Ill: A Domain Independent Framework for Expert Systems", First Annual National Conference on Artificial Intelligence1980, pp. 108-110.
 
14
Kramer, A., "Senior mask designer, Intel Corporation, Private Conversation".
 
15
Wilde, D. K., "Senior Engineer, Intel Corporation, Private Conversation".
 
16
Forgy, C.L., "OPS5 User's Manual", Tech. report, Department of Computer Science, Carnegie:Mellon University, July 1981.

CITED BY  11

Collaborative Colleagues:
Rostam Joobbani: colleagues
Daniel P. Siewiorek: colleagues