Rostam Joobbani
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.
- 1.Hightower D.H., The Interconnection Problem- A Tutorial IEEE Computer Society, 1980, pp. 252-272.Google Scholar
- 2.Breuer, M. A., Design Automation of Digital Systems, Prentice-Hall, Vol. 1, 1972.Google Scholar
- 3.Lee, C. Y., "An Algorithm for Path Connections and its Application", IRE Transactions on Electronic Computers, September 1961, pp. 346-365.Google ScholarCross Ref
- 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.Google Scholar
- 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.Google Scholar
- 6.Rivest, R. L., and C. M. Fiduccia, "A Greedy Channel Router", "/9th Design Automation Conference, Las Vegas1982, pp. 418.424. Google ScholarDigital Library
- 7.Hamachi, G. T., and J. K. Ou,=;terhout, "A Switchbox Router with Obstacle Avoidance", 21st Design Automation conterence1984, pp. 173-179. Google ScholarDigital Library
- 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.Google Scholar
- 9.Soukup, j., "Global Router", Journal of Digital Systems, VoI. iV, No. 1, Spring 1980, pp. 59-69.Google Scholar
- 10.Barr, A., and E.A. Feigenbaum (~.<litors.), The Handbook of Artificial Intelligence (vols 1, 2, 3), Los Altos, CA: Kaufmann, 1981,1982.Google Scholar
- 11.Hayes-Roth, F., D. Waterman, and D. Lenat (editors), Building Expert Systems, Addison-Wesley Publishing Company, 1983. Google ScholarDigital Library
- 12.Erman, L.D., F. Hayes-Roth, V.R. Lesser, and D.R. Reddy, "The Hearsay-II Speech Understanding System: integrating Knowledge to Resolve Uncertainty", Computing Surveys, Association for Computing Machinary (ACM), Vol. 12, No. 2, February 1980, pp. 213-253. Google ScholarDigital Library
- 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.Google Scholar
- 14.Kramer, A., "Senior mask designer, Intel Corporation, Private Conversation".Google Scholar
- 15.Wilde, D. K., "Senior Engineer, Intel Corporation, Private Conversation".Google Scholar
- 16.Forgy, C.L., "OPS5 User's Manual", Tech. report, Department of Computer Science, Carnegie:Mellon University, July 1981.Google Scholar
Index Terms
- WEAVER: a knowledge-based routing expert
Recommendations
WEAVER: A Knowledge-Based Routing Expert
WEAVER, a channel/switchbox knowledge-based routing program, simultaneously considers all the important routing metrics including100 percent routability, minimum routing area, minimum wire length, and the minimum number of vias. It allows prerouted ...
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...
Comments