Browse > Article

Timing-Driven Routing Method by Applying the 1-Steiner Tree Algorithm  

Shim, Ho (Samsung Electronics Semiconductor R&D Center Memory CAE Team)
Rim, Chong-Suck (Dept. of Computer Science and Engineeering, Sogang University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.39, no.3, 2002 , pp. 61-72 More about this Journal
Abstract
In this paper, we propose two timing-driven routing algorithms for single-source net and multi-source net as applications of 1-Steiner heuristic algorithm. Using the method of substituting the cost of 1-Steiner heuristic algorithms with interconnection delay, our routing algorithms can route both single-source net and multi-source net which have all critical source-terminal pairs or one critical pair efficiently Our single-source net routing algorithm reduced the average maximum interconnection delay by up to 2.1% as compared with previous single-source routing algorithm, SERT, and 10.6% as compared with SERT-C. and Our multi-source net routing algorithm increased the average maximum interconnection delay by up to 2.7% as compared with MCMD A-tree, but outperforms it by up to average 1.4% when the signal net has only subset of critical node pairs.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 A.B. Kahng, G. Robins, 'A New Class of Iterative Steiner Tree Heuristics with Good Performance,' IEEE Trans. Computer-Aided Design, Vol. 11, pp. 893-902, July 1992   DOI   ScienceOn
2 K.D. Boese, A.B. Kahng, B.A. McCoy, G. Robins, 'Fidelity and Near-Optimality of Elmore-Based Routing Constructions,' in Proc. IEEE Intl. Conf. on Computer Design, 1993, pp. 81-84   DOI
3 D. Richards, 'Fast Heuristic Algorithms for Rectilinear Steiner Trees,' Algorithmica 4, pp. 191-207, 1989   DOI
4 J. Cong, C.K. Koh, 'Performance-Driven Interconnect Design Based on Distributed RC Delay Model,' in Proc. ACM/IEEE Design Automat. Conf., 1993, pp. 606-611
5 A.B. Kahng, G. Robins, On Optimal Interconnections for VLSI. Norwell, MA : Kluwer Academic, 1995
6 K.D. Boese, A.B. Kahng, G. Robins, 'High Performance Routing Trees with Identified Critical Sinks,' in Proc. ACM/IEEE Design Automat. Conf., 1993, pp. 182-187
7 K.D. Boese, A.B. Kahng, G. Robins, 'Nearoptimal Critical Sink Routing Tree Constructions,' IEEE Trans. Computer-Aided Design, Vol. 14, pp. 1417-1436, Dec. 1995   DOI   ScienceOn
8 H. Hou, J. Hu, S.S. Sapatnekar, 'Non-Hanan Routing,' IEEE Trans. Computer-Aided Design, V.18, pp. 436-444, April 1999   DOI   ScienceOn
9 C.J. Alpert, T.C. Hu, J.H. Huang, A.B. Kahng, 'A Direct Combination of The Prim and Dijkstra Constructions for Improved Performance-Driven Routing,' in Proc. IEEE Int. Symp. on Circuits Syst., 1993, pp. 1869-1872   DOI
10 W.C. Elmore, 'The Transient Response of Damped Linear Network with Particular Regard to Wideband Amplifier,' J. Applied Physics, pp. 55-63, 1948   DOI
11 J. Cong, P.H. Madden, 'Performance Driven Routing with Multiple Sources,' IEEE Trans. Computer-Aided Design, V.16, pp. 410-419, April 1997   DOI   ScienceOn
12 M. Hanan, 'On Steiner's Problem with Rectilinear Distance,' SIAM J. App. Math. 14, pp. 255-265, 1966   DOI   ScienceOn
13 J. Lillis, C.K. Cheng, 'Timing Optimization for Multisource Nets: Characterization and Optimal Repeater Insertion,' IEEE Trans. Computer-Aided Design, V.18, pp. 322-331, March 1999   DOI   ScienceOn
14 J. Cong, L. He, 'Optimal Wiresizing for Interconnects with Multiple Sources,' ACM Trans. Design Automation of Electronic Systems, Vol. 1, pp. 478-511, Oct. 1996   DOI
15 M. Garey, D.S. Johnson, 'The Rectilinear Steiner Problem is NP-Complete,' SIAM J. App. Math, 32(4), pp. 826-834, 1977   DOI   ScienceOn