Xing Huang
Genggeng Liu
Abstract
Obstacle-avoiding Steiner minimal tree (OASMT) construction has become a focus problem in the physical design of modern very large-scale integration (VLSI) chips. In this article, an effective algorithm is presented to construct an OASMT based on X-architecturex for a given set of pins and obstacles. First, a kind of special particle swarm optimization (PSO) algorithm is proposed that successfully combines the classic genetic algorithm (GA), and greatly improves its own search capability. Second, a pretreatment strategy is put forward to deal with obstacles and pins, which can provide a fast information inquiry for the whole algorithm by generating a precomputed lookup table. Third, we present an efficient adjustment method, which enables particles to avoid all the obstacles by introducing some corner points of obstacles. Finally, an excellent refinement method is discussed to further enhance the quality of the final routing tree, which can improve the quality of the solution by 7.93% on average. To our best knowledge, this is the first time to specially solve the single-layer obstacle-avoiding problem in X-architecture. Experimental results show that the proposed algorithm can further shorten wirelength in the presence of obstacles. And it achieves the best solution quality in a reasonable runtime among the existing algorithms.
- G. Ajwani, C. Chu, and W. K. Mak. 2011. FOARS: FLUTE based obstacle-avoiding rectilinear Steiner tree construction. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 30, 2, 194--204. Google Scholar
Digital Library
- H. Chen, C. K. Cheng, A. B. Kahng, I. I. Mandoiu, and Q. Wang. 2003. Estimation of wirelength reduction for λ -geometry vs. Manhattan placement and routing. In Proceedings of the International Workshop on System-Level Interconnect Prediction (SLIP'03). ACM Press, New York, 71--76. Google ScholarDigital Library
- C. Chiang and C. S. Chiang. 2002. Octilinear Steiner tree construction. In Proceedings of the International Midwest Symposium on Circuits and Systems (MWSCAS'02). IEEE, 1--6.Google Scholar
- W. K. Chow, L. Li, E. F. Young, and C. W. Sham. 2014. Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach. Integr. VLSI J. 47, 1, 105--114. Google ScholarDigital Library
- C. Chu. 2004. FLUTE: Fast lookup table based wirelength estimation technique. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'04). 696--701. Google ScholarDigital Library
- C. Chu and Y. C. Wong. 2008. Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 27, 1, 70--83. Google ScholarDigital Library
- M. Clerc. 2004. Discrete particle swarm optimization, illustrated by the traveling salesman problem. In New Optimization Techniques in Engineering, Springer, 219--239.Google Scholar
- C. Coulston. 2003. Constructing exact octagonal steiner minimal trees. In Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI'03). ACM Press, New York, 1--6. Google ScholarDigital Library
- R. Eberhart and J. Kennedy. 1995. A new optimizer using particle swarm theory. In Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS'95). 39--43.Google Scholar
- J. L. Ganley and J. P. Cohoon. 1996. Rectilinear Steiner trees on a checkerboard. ACM Trans. Des. Autom. Electron. Syst. 1, 4. 512--522. Google ScholarDigital Library
- M. Hanan. 1966. On Steiner's problem with rectilinear distance. SIAM J. Appl. Math. 14, 2, 255--265.Google ScholarDigital Library
- J. Ho, G. Vijayan, and C. K. Wong. 1989. A new approach to the rectilinear Steiner tree problem. In Proceedings of the 26th Design Automation Conference (DAC'89). ACM Press, New York, 161--166. Google ScholarDigital Library
- T. Huang and E. F. Young. 2013. ObSteiner: An exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 32, 6, 882--893. Google ScholarDigital Library
- T. Huang and E. F. Young. 2011. An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles. In Proceedings of the 48th Design Automation Conference (DAC'11). ACM Press, New York, 164--169. Google ScholarDigital Library
- T. Huang and E. F. Young. 2010. Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach. In Proceedings of the International Conference on Computer Aided Design (ICCAD'10). IEEE, 610--613. Google ScholarDigital Library
- T. T. Jing, Z. Feng, Y. Hu, X. L. Hong, X. D. Hu, and G. Y. Yan. 2007 λ -oat: λ -geometry obstacle-avoiding tree construction with o (nlogn) complexity. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 26, 11, 2073--2079. Google ScholarDigital Library
- A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky. 2003. Highly scalable algorithms for rectilinear and octilinear Steiner trees. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'03). IEEE, 827--833. Google ScholarDigital Library
- C. K. Koh and P. H. Madden. 2000. Manhattan or non-Manhattan? A study of alternative VLSI routing architectures. In Proceedings of the 10th Great Lakes Symposium on VLSI (GLSVLSI'00). ACM Press, New York, 47--52. Google ScholarDigital Library
- L. Li, Z. Qian, and E. F. Young. 2009. Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'09). ACM Press, New York, 21--25. Google ScholarDigital Library
- C. W. Lin, S. Y. Chen, C. F. Li, Y. W. Chang, and C. L. Yang. 2008. Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 27, 4, 643--653. Google ScholarDigital Library
- C. H. Liu, S. Y. Kuo, D. T. Lee, C. S. Lin, J. H. Weng, and S. Y. Yuan. 2012. Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point-based algorithm. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 31, 7, 1050--1060. Google ScholarDigital Library
- C. H. Liu, S. Y. Yuan, S. Y. Kuo, and S. C. Wang. 2009. High-performance obstacle-avoiding rectilinear Steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. 14, 3, 45. Google ScholarDigital Library
- J. Long, H. Zhou, and S. O. Mmeik. 2008. EBOARST: An efficient edge based obstacle avoiding-rectilinear Steiner tree construction algorithm. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 27, 12, 2169--2182. Google ScholarDigital Library
- A. Ratnaweera, S. K. Halgamuge, and H. C. Watson. 2004. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficientss. IEEE Trans. Evolut. Comput. 8, 3, 240--255. Google ScholarDigital Library
- Z. Shen, C. Chu, and Y. M. Li. 2005. Efficient rectilinear Steiner tree construction with rectilinear blockages. In Proceedings of the International Conference on Computer Design: VLSI in Computers and Processors (ICCD'05). IEEE, 38--44. Google ScholarDigital Library
- Y. Shi and R. Eberhart. 1998. Parameter selection in particle swarm optimization. In Proceedings of the 7th Annual Conference on Evolutionary Programming (EP'98). 591--600. Google ScholarDigital Library
- Y. Shi and R. Eberhart. 1999. Empirical study of particle swarm optimization. In Proceedings of the Congress on Evolutionary Computation (CEC'99).Google Scholar
- S. L. Teig. 2002. The x architecture: Not your father's diagonal wiring. In Proceedings of the International Workshop on System-Level Interconnect Prediction (SLIP'02). ACM Press, New York, 33--37. Google ScholarDigital Library
- J. T. Yan. 2008. Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction. ACM Trans. Des. Autom. Electron. Syst. 13, 2, 26. Google ScholarDigital Library
- Q. Zhu, H. Zhou, T. Jing, X. L. Hong, and Y. Yang. 2005. Spanning graph-based nonrectilinear Steiner tree algorithms. IEEE Trans. Comput.-Aided. Des. Integr. Circ. Syst. 24, 7, 1066--1075. Google ScholarDigital Library
Index Terms
- Obstacle-Avoiding Algorithm in X-Architecture Based on Discrete Particle Swarm Optimization for VLSI Design
Recommendations
Efficient obstacle-avoiding rectilinear steiner tree construction
ISPD '07: Proceedings of the 2007 international symposium on Physical designGiven a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (called Steiner points), and avoids running through any obstacle to ...
X-architecture placement based on effective wire models
ISPD '07: Proceedings of the 2007 international symposium on Physical designIn this paper, we derive the X-half-perimeter wirelength (XHPWL) model for X-architecture placement and explore the effects of three different wire models on X-architecture placement, including the Manhattan-half-perimeter wirelength (MHPWL) model, the ...
Obstacle-avoiding rectilinear Steiner tree construction
ICCAD '08: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided DesignIn today's VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important problem in the physical design stage of VLSI circuits. This problem has attracted a ...
Comments