Skip to main content
SpringerLink
Log in

SLPSO-Based X-Architecture Steiner Minimum Tree Construction

  • Conference paper
  • First Online:
Book cover Web Information Systems and Applications (WISA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12432))

Included in the following conference series:

Abstract

The X-architecture Steiner Minimum Tree (XSMT) is the best connection model for multi-terminal nets in global routing algorithms under non-Manhattan structures, and it is an NP-hard problem. And the successful application of Particle Swarm Optimization (PSO) technique in this field also reflects its extraordinary optimization ability. Therefore, based on Social Learning Particle Swarm Optimization (SLPSO), this paper proposes an XSMT construction algorithm (called SLPSO-XSMT) that can effectively balance exploration and exploitation capabilities. In order to expand the learning range of particles, a novel SLPSO approach based on the learning mechanism of example pool is proposed, which is conductive to break through local extrema. Then the proposed mutation operator is integrated into the inertia component of SLPSO to enhance the exploration ability of the algorithm. At the same time, in order to maintain the exploitation ability, the proposed crossover operator is integrated into the individual cognition and social cognition of SLPSO. Experimental results show that compared with other Steiner tree construction algorithms, the proposed SLPSO-XSMT algorithm has better wirelength optimization capability and superior stability.

This work was supported in part by National Natural Science Foundation of China (No. 61877010, 11501114), Natural Science Foundation of Fujian Province, China (2019J01243).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen, X., Liu, G., Xiong, N., Su, Y., Chen, G.: A survey of swarm intelligence techniques in VLSI routing problems. IEEE Access 8, 26266–26292 (2020). https://doi.org/10.1109/ACCESS.2020.2971574

    Article  Google Scholar 

  2. Coulston, C.S.: Constructing exact octagonal Steiner minimal trees. In: Proceedings of the 13th ACM Great Lakes symposium on VLSI, pp. 1–6 (2003). https://doi.org/10.1145/764808.764810

  3. Guo, W., Liu, G., Chen, G., Peng, S.: A hybrid multi-objective PSO algorithm with local search strategy for VLSI partitioning. Front. Comput. Sci. China 8(2), 203–216 (2014). https://doi.org/10.1007/S11704-014-3008-Y

    Article  MathSciNet  Google Scholar 

  4. Huang, X., Guo, W., Liu, G., Chen, G.: FH-OAOS: a fast four-step heuristic for obstacle-avoiding octilinear Steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. 21(3), 1–31 (2016). https://doi.org/10.1145/2856033

    Article  Google Scholar 

  5. Huang, X., Liu, G., Guo, W., Niu, Y., Chen, G.: Obstacle-avoiding algorithm in x-architecture based on discrete particle swarm optimization for VLSI design. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 20(2), 1–28 (2015). https://doi.org/10.1145/2699862

    Article  Google Scholar 

  6. Lin, K.W., Lin, Y.S., Li, Y.L., Lin, R.B.: A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 23(4), 1–26 (2018). https://doi.org/10.1145/3177878

    Article  Google Scholar 

  7. Lin, S.E.D., Kim, D.H.: Construction of all rectilinear Steiner minimum trees on the hanan grid. In: Proceedings of the 2018 International Symposium on Physical Design, pp. 18–25 (2018). https://doi.org/10.1145/3177540.3178240

  8. Liu, G., Chen, G., Guo, W.: DPSO based octagonal Steiner tree algorithm for VLSI routing. In: 2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI), pp. 383–387. IEEE (2012). https://doi.org/10.1109/ICACI.2012.6463191

  9. Liu, G., Chen, G., Guo, W., Chen, Z.: DPSO-based rectilinear Steiner minimal tree construction considering bend reduction. In: 2011 Seventh International Conference on Natural Computation, vol. 2, pp. 1161–1165. IEEE (2011). https://doi.org/10.1109/ICNC.2011.6022221

  10. Liu, G., Chen, Z., Guo, W., Chen, G.: Self-adapting PSO algorithm with efficient hybrid transformation strategy for x-architecture Steiner minimal tree construction algorithm. Pattern Recogn. Artif. Intell. 31(5), 398–408 (2018). https://doi.org/10.16451/j.cnki.issn1003-6059.201805002. (In Chinese)

  11. Liu, G., Chen, Z., Zhuang, Z., Guo, W., Chen, G.: A unified algorithm based on HTS and self-adapting PSO for the construction of octagonal and rectilinear SMT. Soft Comput. 24(6), 3943–3961 (2020). https://doi.org/10.1007/S00500-019-04165-2

    Article  Google Scholar 

  12. Liu, G., Guo, W., Li, R., Niu, Y., Chen, G.: Xgrouter: high-quality global router in x-architecture with particle swarm optimization. Front. Comput. Sci. China 9(4), 576–594 (2015). https://doi.org/10.1007/S11704-015-4017-1

    Article  Google Scholar 

  13. Liu, G., Guo, W., Niu, Y., Chen, G., Huang, X.: A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction. Soft Comput. 19(5), 1153–1169 (2015). https://doi.org/10.1007/S00500-014-1329-2

    Article  MATH  Google Scholar 

  14. Thurber, A., Xue, G.: Computing hexagonal Steiner trees using PCX [for VLSI]. In: Proceedings of ICECS 1999, 6th IEEE International Conference on Electronics, Circuits and Systems, ICECS 1999 (Cat. No. 99EX357), vol. 1, pp. 381–384. IEEE (1999). https://doi.org/10.1109/ICECS.1999.812302

  15. Warme, D., Winter, P., Zachariasen, M.: Geosteiner software for computing Steiner trees (2003). http://geosteiner.net

  16. Wu, H., Xu, S., Zhuang, Z., Liu, G.: X-architecture Steiner minimal tree construction based on discrete differential evolution. In: Liu, Y., Wang, L., Zhao, L., Yu, Z. (eds.) ICNC-FSKD 2019. AISC, vol. 1074, pp. 433–442. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-32456-8_47

    Chapter  Google Scholar 

  17. Yan, J.T.: Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 13(2), 1–18 (2008). https://doi.org/10.1145/1344418.1344422

    Article  MathSciNet  Google Scholar 

  18. Zhang, X., Wang, X., Kang, Q., Cheng, J.: Differential mutation and novel social learning particle swarm optimization algorithm. Inf. Sci. 480, 109–129 (2019). https://doi.org/10.1016/J.INS.2018.12.030

    Article  Google Scholar 

  19. Zhao, H., Xia, S., Zhao, J., Zhu, D., Yao, R., Niu, Q.: Pareto-based many-objective convolutional neural networks. In: Meng, X., Li, R., Wang, K., Niu, B., Wang, X., Zhao, G. (eds.) WISA 2018. LNCS, vol. 11242, pp. 3–14. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-02934-0_1

    Chapter  Google Scholar 

  20. Zhu, Q., Zhou, H., Jing, T., Hong, X.L., Yang, Y.: Spanning graph-based nonrectilinear Steiner tree algorithms. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 24(7), 1066–1075 (2005). https://doi.org/10.1109/TCAD.2005.850862

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Computer Science, Fuzhou University, Fuzhou, China

    Xiaohua Chen, Ruping Zhou & Genggeng Liu

  2. College of Intelligence and Computing, Tianjin University, Tianjin, China

    Xin Wang

Authors
  1. Xiaohua Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruping Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Genggeng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Genggeng Liu .

Editor information

Editors and Affiliations

  1. Guangzhou University, Guangzhou, China

    Guojun Wang

  2. The University of New South Wales, Sydney, NSW, Australia

    Xuemin Lin

  3. Rensselaer Polytechnic Institute, Troy, NY, USA

    James Hendler

  4. Wuhan University, Wuhan, China

    Wei Song

  5. Hohai University, Nanjing, China

    Zhuoming Xu

  6. Fuzhou University, Fuzhou, China

    Genggeng Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, X., Zhou, R., Liu, G., Wang, X. (2020). SLPSO-Based X-Architecture Steiner Minimum Tree Construction. In: Wang, G., Lin, X., Hendler, J., Song, W., Xu, Z., Liu, G. (eds) Web Information Systems and Applications. WISA 2020. Lecture Notes in Computer Science(), vol 12432. Springer, Cham. https://doi.org/10.1007/978-3-030-60029-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60029-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-60028-0

  • Online ISBN: 978-3-030-60029-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation