Obstacle-avoiding rectilinear minimum-delay Steiner tree construction toward IP-block-based SOC design

With system-on-chip design, IP blocks form routing obstacles that deteriorate global interconnect delay. In this paper, we present a new approach for obstacle-avoiding rectilinear minimal delay Steiner tree (OARMDST) construction. We formalize the solving of minimum delay tree through the concept of an extended minimization function, and trade the objective into a top-down recursion, which wisely produces delay minimization from source to critical sinks. We analyze the topology generation with treatment of obstacles and exploit the connection flexibilities. To our knowledge, this is the first in-depth study of OARMDST problem based on topological construction. Experimental results are given to demonstrate the efficiency of the algorithm.

[1]  Joseph L. Ganley,et al.  Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[2]  Naveed A. Sherwani,et al.  Switchbox Steiner tree problem in presence of obstacles , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[3]  Andrew B. Kahng,et al.  A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  F. Rubin,et al.  The Lee Path Connection Algorithm , 1974, IEEE Transactions on Computers.

[5]  Dave Hightower.  A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[6]  Jian Liu,et al.  A polynomial time approximation scheme for rectilinear Steiner minimum tree construction in the presence of obstacles , 2002, 9th International Conference on Electronics, Circuits and Systems.

[7]  Dian Zhou,et al.  An automatic clock tree design system for high-speed VLSI designs: planar clock routing with the treatment of obstacles , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[8]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[9]  Jason Cong,et al.  Performance-Driven Interconnect Design Based on Distributed RC Delay Model , 1993, 30th ACM/IEEE Design Automation Conference.

[10]  Xianlong Hong,et al.  Performance-Driven Steiner Tree Algorithms for Global Routing , 1993, 30th ACM/IEEE Design Automation Conference.

[11]  Xianlong Hong,et al.  The key technologies of performance optimization for nanometer routing , 2003, ASICON 2003.

[12]  T. Sakurai,et al.  Approximation of wiring delay in MOSFET LSI , 1983, IEEE Journal of Solid-State Circuits.

[13]  Martin D. F. Wong,et al.  A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).