Abstract
The construction of buffered Steiner trees becomes more and more important in the physical design process of modern chips. In this paper we focus on delay optimization of timing-critical buffered Steiner tree instances in the presence of obstacles. As a secondary goal, we are interested in minimizing power consumption.
Since the problem is NP-hard, we first study an efficient method to compute upper bounds on the achievable slack. This leads to the interesting subproblem to find shortest weighted paths under special length restrictions on routing over obstacles. We prove that the latter problem can be solved efficiently by Dijkstra’s method. In the main part we describe a new approach for the buffered Steiner tree problem. The core step is an iterative clustering method to build up the tree topology.
We provide a case study for the effectiveness of the proposed method to construct buffered Steiner trees. Our computational experiments on four different chip designs demonstrate that the proposed method yields results which are relatively close to the slack bounds. Moreover, we improve significantly upon a standard industry tool: we simultaneously improve the slack and largely reduce power consumption.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alpert, C.J., Devgan, A.: Wire segmenting for improved buffer insertion. In: Proceedings of the 34th Design Automation Conference, pp. 588–593 (1995)
Alpert, C.J., Gandham, G., Hrkic, M., Hu, J., Kahng, A.B., Lillis, J., Liu, B., Quay, S.T., Sapatnekar, S.S., Sullivan, A.J.: Buffered Steiner trees for difficult instances. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21, 3–13 (2002)
Alpert, C.J., Hu, T.C., Huang, J.H., Kahng, A.B., Karger, D.: Prim-Dijkstra tradeoffs for improved performance-driven routing tree design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14, 890–896 (1995)
Chu, C.C.N., Wong, D.F.: Closed form solutions to simultaneous buffer insertion/ sizing and wire sizing, In: Proceedings of ISPD, pp. 192–197 (1997)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph drawing: Algorithms for the visualization of graphs. Prentice Hall, Englewood Cliffs (1999)
Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NPcomplete. SIAM Journal on Applied Mathematics 32, 826–834 (1977)
Hanan, M.: On Steiner’s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14, 255–265 (1966)
Huang, L.-D., Lai, M., Wong, D.F., Gao, Y.: Maze routing with buffer insertion under transition time constraints. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 22, 91–96 (2003)
Klick, I.: Das Inverterbaum-Problem im VLSI-Design. In: Diplomarbeit. Research Institute for Discrete Mathematics, Bonn (2001)
Lai, M., Wong, D.F.: Maze routing with buffer insertion and wiresizing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21, 1205–1209 (2002)
Lillis, J., Cheng, C.K., Lin, T.Y.: Optimal wire sizing and buffer insertion for low and a generalized delay model. IEEE Journal of Solid-State Circuits 31, 437–447 (1996)
Tang, X., Tian, R., Xiang, H., Wong, D.F.: A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints. In: Proceedings of ICCAD 2001, pp. 49–56 (2001)
van Ginneken, L.P.P.P.: Buffer placement in distributed RC-trees networks for minimal Elmore delay. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 865–868 (1990)
Zachariasen, M.: A catalog of Hanan grid problems. Networks 38, 76–83 (2001)
Zhou, H., Wong, D.F., Liu, I.-M., Aziz, A.: Simultaneous routing and buffer insertion with restrictions on buffer locations. IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems 19, 819–824 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller-Hannemann, M., Zimmermann, U. (2003). Slack Optimization of Timing-Critical Nets. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive