Abstract
We give algorithms to minimize density for VLSI channel-routing problems with terminals that are movable subject to certain constraints. The main cases considered are channels with linear-order constraints, channels with linear-order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case we improve previous results for running time and space by a factor ofL/lgn andL, respectively, whereL is the channel length andn is the number of terminals.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Cai and D. F. Wong. Minimizing channel density by shifting blocks and terminals.Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-91), pages 524–527. IEEE Computer Society Press, New York, 1991.
Y. Cai and D. F. Wong. Optimal channel pin assignment.IEEE Trans. Computer-Aided Design Integrated Circuits, 10(11):1413–1424, November 1991.
L.-F. Chao and A. S. LaPaugh. Finding all minimal shapes in a routing channel. Technical Report CSTR-384-92, Department of Computer Science, Princeton University, August 1992.
I. S. Gopal, D. Coppersmith, and C. K. Wong. Optimal wiring of movable terminals.IEEE Trans. Comput., 32(9):845–858, September 1983.
R. I. Greenberg, A. T. Ishii, and A. L. Sangiovanni-Vincentelli. Much: a multilayer channel router using one, two, and three layer partitions.Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-88), pages 88–91. IEEE Computer Society Press, New York, 1988.
D. S. Johnson, A. S. LaPaugh, and R. Y. Pinter. Minimizing channel density by lateral shifting of components.Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 122–131, 1994.
A. S. LaPaugh and R. Y. Pinter. On minimizing channel density by lateral shifting.Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-83), pages 123–124. IEEE Computer Society Press, New York, 1983.
J. Reed, A. Sangiovanni-Vincentelli, and M. Santomauro. A new symbolic channel router: YACR2.IEEE Trans. Computer-Aided Design Integrated Circuits, 4(3):208–219, July 1985.
T. G. Szymanski. Dogleg channel routing is NP-complete.IEEE Trans. Computer-Aided Design Integrated Circuits, 4(1):31–41, January 1985.
Author information
Authors and Affiliations
Additional information
Communicated by A. S. LaPaugh.
This work was supported in part by NSF Grants CCR-9109550 and CCR-9321388.
Rights and permissions
About this article
Cite this article
Greenberg, R.I., Shih, J.D. Minimizing channel density with movable terminals. Algorithmica 17, 89–99 (1997). https://doi.org/10.1007/BF02522820
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02522820