Charles J. Alpert
Andrew B. Kahng
C. N. Sze
Qinke Wang
ABSTRACT
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimizes wirelength, an RSMT may take a "non-direct" route to a sink, which may give the designer an unnecessarily pessimistic view of the delay to the sink.Previous works have addressed this issue through performance-driven constructions, minimum Steiner arborescence, and critical sink based Steiner constructions. Physical synthesis and routing flows have been reticent to adapt universal timing-driven Steiner constructions out of fear that they are too expensive (in terms of routing resource and capacitance). This paper studies several different performance-driven Steiner tree constructions in order to show which ones have superior performance.A key result is that they add at most 2%-4% extra capacitance, and are thus a promising avenue for today's increasingly aggressive performance-driven P&R flows.We demonstrate using a production P&R flow that timing-driven Steiner topologies can be easily embedded into an incremental routing subflow to obtain significantly improved timing (3.6% and 5.1% improvements in cycle time for two industry testcases) at practically no cost of wirelength or routability.
- Personal communication with Dr. Weiping Shi.Google Scholar
- C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng, and D. Karger. Prim-dijkstra tradeoffs for improved performance-driven routing tree design. IEEE TCAD, 14(7):890--896, July 1995. Google ScholarDigital Library
- K. D. Boese, A. B. Kahng, B. A. McCoy, and G. Robins. Near-optimal critical sink routing tree constructions. IEEE TCAD, 14(12):1417--36, Dec. 1995. Google ScholarDigital Library
- M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE TCAD, 13(12):1563--1568, Dec. 1994.Google ScholarDigital Library
- M. Borah, R. M. Owens, and M. J. Irwin. A fast and simple Steiner routing heuristic. Discrete Applied Mathematics, 90:51--67, 1999. Google ScholarDigital Library
- C. Chu and Y.-C. Wong. Fast and accurate rectilinear steiner minimal tree algorithm for vlsi design. In ISPD, pp. 28--35, 2005. Google ScholarDigital Library
- J. Cong, A. B. Kahng, and K.-S. Leung. Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to vlsi physical design. IEEE TCAD, 17(1):24--39, Jan. 1999. Google ScholarDigital Library
- J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong. Provably good performance-driven global routing. IEEE TCAD, 11(6):739--752, June 1992.Google ScholarDigital Library
- J. Cordova and Y. H. Lee. A heuristic algorithm for the rectilinear Steiner arborescence problem. Tech. Report, CIS Department, Univ. of Florida, (TR 94-025), 1994.Google Scholar
- J. Griffith, G. Robins, J. Salowe, and T. Zhang. Closing the gap: Near-optimal Steiner trees in polynomial time. IEEE TCAD, 13:1351--1365. Google ScholarDigital Library
- A. B. Kahng and G.Robins. On optimal interconnections for VLSI. Kluwer Academic Publishers, Boston, MA, 1995.Google ScholarDigital Library
- S. Khuller, B. Raghavachari, and N. Young. Balancing minimum spanning trees and shortest-path trees. ACM-SIAM SODA, pp. 243--250, 1993. Google ScholarDigital Library
- G. Kortsarz and D. Peleg. Approximating shallow-light trees. ACM-SIAM SODA, pp. 103--110, 1997. Google ScholarDigital Library
- P. Madden. BOI source code. http://vlsicad.ucsd.edu/GSRC/bookshelf/Slots/RSMT/ Madden_BOI.html.Google Scholar
- M. Marathe, R. Ravi, R. Sundaram, S. Ravi, and D. Rosenkrantz. Bicriteria network design problems. In Intl. Colloquium Automata Languages and Programming (ICALP'95), pp. 487--498, 1995. Google ScholarDigital Library
- J. Naor and B. Schieber. Improved approximations for shallow-light spanning trees. FOCS, page 536, 1997. IEEE Computer Society. Google ScholarDigital Library
- S. Peyer, M. Zachariasen, and D. G. Jørgensen. Delay-related secondary objectives for rectilinear Steiner minimum trees. Discrete Appl. Math., 136(2-3):271--298, 2004. Google ScholarDigital Library
- W. Qiu and W. Shi. Minimum moment Steiner trees. SODA, pp. 488--495, 2004. Google ScholarDigital Library
- S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor. The rectilinear Steiner arborescence problem. Algorithmica, 7:277--288, 1992.Google ScholarCross Ref
- J. Soukup. Uniform steiner tree representation from the floor planning to the final routing. Unpublished manuscript.Google Scholar
- D. M. Warme, P. Winter, and M. Zachariesen. Exact algorithms for plane Steiner tree problems: A computational study. pp. 81--116, 2000.Google Scholar
Index Terms
- Timing-driven Steiner trees are (practically) free
Recommendations
Timing-driven X-architecture routing tree construction among rectangular and non-rectangular obstacles
In this paper, we formulate a new X-architecture routing problem in presence of non-rectangular obstacles, and propose an X-architecture timing-driven routing algorithm to minimize the maximum source-to-sink delay and the total wirelength ...
Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction
It is well known that the problem of constructing a timing-driven rectilinear Steiner tree for any signal net is important in performance-driven designs and has been extensively studied. Until now, many efficient approaches have been proposed for the ...
Efficient multi-layer obstacle-avoiding preferred direction rectilinear Steiner tree construction
ASPDAC '11: Proceedings of the 16th Asia and South Pacific Design Automation ConferenceConstructing rectilinear Steiner trees for signal nets is a very important procedure for placement and routing because we can use it to find topologies of nets and measure the design quality. However, in modern VLSI designs, pins are located in multiple ...
Comments