Abstract
River routing is the problem of connecting a set of terminals a 1,…,a n on a line to another set b 1,…,b n in order across a rectangular channel. When the terminals are located on modules, the modules must be placed relative to one another before routing. This placement problem arises frequently in design systems like bristle-blocks where stretch lines through a module can effectively break it into several chunks, each of which must be placed separately. This paper gives concise necessary and sufficient conditions for wirability which are applied to reduce the optimal placement problem to the graph-theoretic single-source-longest-paths problem. By exploiting the special structure of graphs that arise from the placement problem for rectilinear wiring, an optimal solution may be determined in linear time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baratz, A. E., private communication, June 1981.
Batali, J., N. Mayle, H. Shrobe, G. Sussman and D. Weise, “The DPL/ Daedalus design environment,” Proceedings of the International Conference on VLSI, Univ. of Edinburgh, August 1981, pp. 183–192.
Dolev, D., K. Karplus, A. Siegel, A. Strong and J. D. Ullman, “Optimal wiring between rectangles,” Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, May 1981, pp. 312–317.
Dolev, D. and A. Siegel, “The separation required for arbitrary wiring barriers,” unpublished manuscript, April 1981.
Hsueh, M.-Y., Symbolic Layout and Compaction of Integrated Circuits, Memorandum No. UCB/ERL-M79/80 (Ph.D. dissertation), Electronics Research Laboratory, Univ. of California, Berkeley, December 1979.
Johannsen, D., “Bristle blocks: a silicon compiler,” Proceedings of the Caltech Conference on VLSI, January 1979, pp. 303–310. Also appears in the Proceedings of the Sixteenth Design Automation Conference, June 1979, pp. 310–313.
Lawler, E. L., Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
Tompa, M., “An optimal solution to a wire-routing problem,” Proceedings of the Twelfth Annual Symposium on Theory of Computing, April-May 1980, pp. 161–176.
Yen, J. Y., “An algorithm for finding shortest routes from all source nodes to a given destination in general networks,” Quarterly of Applied Mathematics, Vol. 27, No. 4, July 1970, pp. 526–530.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Carnegie-Mellon University
About this chapter
Cite this chapter
Leiserson, C.E., Pinter, R.Y. (1981). Optimal Placement for River Routing. In: Kung, H.T., Sproull, B., Steele, G. (eds) VLSI Systems and Computations. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68402-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-68402-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-68404-3
Online ISBN: 978-3-642-68402-9
eBook Packages: Springer Book Archive