Abstract
We present some fundamental flexibility properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edge segments are restricted to λ uniformly oriented directions. These networks are referred to as λ-SMTs. They promise to play an increasingly important role in the future of optimal wire routing in VLSI physical design, particularly for the next generation of VLSI circuits. In this paper we develop the concept of a flexibility polygon for a λ-SMT, which is a region representing the union of all (minimum length) λ-SMTs with the same topology on a given set of points. We show that this polygon can be constructed, for a given point set and given topology, in linear time. We discuss some of the future applications of this polygon, which can be thought of as a geometric representation of the amount of flexibility inherent in a given λ-SMT.
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
Bozorgzadeh, E., Kastner, R., Sarrafzadeh, M.: Creating and exploiting flexibility in Steiner trees. IEEE Trans. on Computer-Aided Design 22, 605–615 (2003)
Brazil, M., Thomas, D.A., Weng, J.F.: Minimum networks in uniform orientation metrics. SIAM J. Comput 30, 1579–1593 (2000)
Brazil, M., Thomas, D.A., Weng, J.F., Zachariasen, M.: Canonical forms and algorithms for Steiner trees in uniform orientation metrics. Tech. Rep. 02-22, Department of Computer Science, University of Copenhagen (2002)
Chen, H., Cheng, C.K., Kahng, A.B., Mandoiu, I., Wang, Q., Yao, B.: The Y-architecture for on-chip interconnect: Analysis and methodology. In: Proc. IEEE/ACM Intl. Conf. Computer-Aided Design, pp. 13–19 (2003)
Nielsen, B.K., Winter, P., Zachariasen, M.: An exact algorithm for the uniformly-oriented steiner tree problem. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 760–772. Springer, Heidelberg (2002)
Paluszewski, M., Winter, P., Zachariasen, M.: A new paradigm for general architecture routing. In: ACM Great Lakes Symp. on VLSI, pp. 202–207 (2004)
Peyer, S., Zachariasen, M., Jørgensen, D.G.: Delay-related secondary objectives for rectilinear Steiner minimum trees. Discrete Applied Mathematics 136, 271–298 (2004)
Sarrafzadeh, M., Wong, C.K.: Hierarchical Steiner tree construction in uniform orientations. IEEE Trans. on Computer-Aided Design 11, 1095–1103 (1992)
Teig, S.: The X Architecture. In: Proc. ACM/IEEE Workshop on System Level Interconnect Prediction, pp. 33–37 (2002)
Widmayer, P., Wu, Y.F., Wong, C.K.: On some distance problems in fixed orientations. SIAM J. Comput. 16, 728–746 (1987)
The X Initiative, http://www.xinititive.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brazil, M., Winter, P., Zachariasen, M. (2004). Flexibility of Steiner Trees in Uniform Orientation Metrics. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)