Abstract
We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.
Similar content being viewed by others
References
Curatelli, C, Bisio, G., Heusitic Strategies for Switchbox Routing in VLSI Design,Proceedings of ISCAS'89, pp. 913–916.
Cohoon, J., Heck, P., BEAVER; A Computational-Geometry-Based Tool for Switchbox Routing,IEEE Transactions on Computer-Aided Design, vol. 7, no. 6, June 1988, pp. 684–697.
Gabow, H. N., Tarjan, R. E., A Linear-Time Algorithm for a Special Case of Disjoint Set Union,Proceedings of the 15th Symposium on Theory of Computing, April 1983, pp. 246-251.
Hamachi, G., Ousterhout, A., A Switchbox Router with Obstacle Avoidance,21st Design Automation Conference Proceedings, 1984, pp. 173–179.
Luk, W. K., A Greedy Switchbox Router, CMU-CS-84-148 Technical Report, Carnegie Mellon University, Pittsburgh, PA.
Mehlhorn, M., Preparata, F. P., Routing Through a Rectangle,Journal of the Association for Computing Machinery, vol. 33, no. 1, January 1986, pp. 60–85.
Ohtsuki, T. ed.,Advances in CAD for VLSI, Elsevier, Amsterdam, 1986.
Pinter, R., River Routing: Methodology and Analysis,Proceedings of the Third CalTech Conference on Very Large Scale Integration, March 1983, pp. 141–163.
Preparata, F. P., Lipski, W. Jr., Optimal Three-Layer Channel Routing,IEEE Transactions on Computers, vol. 33, no. 5, May 1984, pp. 427–437.
Shin, H., Sangiovanni-Vincentelli, A., A Detailed Router Based on Incremental Routing Modifications: Mighty,IEEE Transactions on Computer-Aided Design, vol. no. 6, November 1987, pp. 942–955.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
This research was supported in part by NSA Contract No. MDA-904-85H-0015, NSF Grant No. DCR-86-00378, and by NSF Engineering Research Centers Program NSFD CDR 88003012.
Rights and permissions
About this article
Cite this article
Wu, S.A., JáJá, J. Optimal algorithms for adjacent side routing. Algorithmica 6, 565–578 (1991). https://doi.org/10.1007/BF01759060
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01759060