Skip to main content
SpringerLink
Log in

Accelerated Steiner Tree Problem Solving on GPU with CUDA

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9529))

Abstract

The Steiner Tree Problem in Graphs (STPG) is an important NP-hard combinatorial optimization problem arising naturally in many applications including network routing, social media analysis, power grid routing and in the context of the semantic web. We present the first parallel heuristics for the solution of the STPG for GPU with CUDA, and show that the achieved speedups for different kinds of graphs are significant compared to one of the fastest serial heuristics STAR.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. http://lod.geospecies.org/

  2. http://www.imdb.com/

  3. https://www.jamendo.com/

  4. http://www.opengalen.org/

  5. http://steinlib.zib.de

  6. Chow, W.K., Li, L., Young, E.F.Y., Sham, C.W.: Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach. Integr. VLSI 47(1), 105–114 (2014)

    Article  Google Scholar 

  7. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  8. Duan, G., Yu, Y.: Power distribution system optimization by an algorithm for capacitated Steiner tree problems with complex-flows and arbitrary cost functions. Electr. Power Energy Syst. 25(7), 515–523 (2003)

    Article  Google Scholar 

  9. Harris, M.: Optimizing parallel reduction in CUDA (2007). http://docs.nvidia.com/cuda/samples/6_Advanced/reduction/doc/reduction.pdf

  10. Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating CUDA graph algorithms at maximum warp. In: Proceeding of 16th ACM Symposium on Principles and Practice of Parallel Programming, pp. 267–276. ACM, New York (2011)

    Google Scholar 

  11. Ihler, E., Reich, G., Widmayer, P.: Class Steiner trees and VLSI-design. Discrete Appl. Math. 90(1–3), 173–194 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Jia, X., Wang, L.: A group multicast routing algorithm by using multiple minimum Steiner trees. Comput. Commun. 20(9), 750–758 (1997)

    Article  Google Scholar 

  13. Jia, Y., Lu, V., Hoberock, J., Garland, M., Hart, J.: Edge v. node parallelism for graph centrality metrics. In: GPU Computing Gems Jade Edition, 1st edn., chap. 2, pp. 15–30. Morgan Kaufmann, USA (2011)

    Google Scholar 

  14. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)

    Google Scholar 

  15. Kasneci, G., Ramanath, M., Sozio, M., Suchanek, F.M., Weikum, G.: STAR: steiner-tree approximation in relationship graphs. In: Proceeding of IEEE International Conference on Data Engineering, pp. 868–879. IEEE, Washington DC (2009)

    Google Scholar 

  16. Katz, G.J., Kider, Jr., J.T.: All-pairs shortest-paths for large graphs on the GPU. In: Proceeding of 23rd ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware. Eurographics Association, pp. 47–55. ACM, Switzerland (2008)

    Google Scholar 

  17. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15(2), 141–145 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  18. Martín, P.J., Torres, R., Gavilanes, A.: CUDA solutions for the SSSP problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol. 5544, pp. 904–913. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Mathieu, C.: On approximated Steiner tree problem solving with CUDA. Bachelor thesis, Saarland University, Computer Science Department, Saarbruecken, Germany (2014)

    Google Scholar 

  20. Muhammad, R.: Distributed steiner tree algorithm and its application in ad hocwireless networks. In: Proceeding of International Conference on Wireless Networks, pp. 173–178 (2006)

    Google Scholar 

  21. Ortega-Arranz, H., Torres, Y., Llanos, D., Gonzalez-Escribano, A.: A new GPU-based approach to the shortest path problem. In: Proceeding of International Conference on High Performance Computing and Simulation, pp. 505–511 (2013)

    Google Scholar 

  22. Park, J.S., Ro, W., Lee, H., Park, N.: Parallel algorithms for Steiner tree problem. In: Proceeding of 3rd International Conference on Convergence and Hybrid Information Technology (ICCIT), vol. 1, pp. 453–455 (2008)

    Google Scholar 

  23. Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Math. Educ. Sci. Technol. 14(1), 15–23 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  24. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceeding of 11th Annual ACM-SIAM Symposium on Discrete Algorithms SODA, pp. 770–779. Society for Industrial and Applied Mathematics, USA (2000)

    Google Scholar 

  25. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Mathematica Japonica 24, 573–577 (1980)

    MathSciNet  MATH  Google Scholar 

  26. Zhong, J., He, B.: Medusa: Simplified graph processing on GPUs. IEEE Trans. Parallel Distrib. Sys. 25(6), 1543–1552 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work was supported by the German ministry for education and research (BMBF) in the project INVERSIV under contract number 01IW14004.

Author information

Authors and Affiliations

  1. Computer Science Department, Saarland University, 66123, Saarbruecken, Germany

    Christian Mathieu

  2. German Research Center for Artificial Intelligence, 66123, Saarbruecken, Germany

    Matthias Klusch

Authors
  1. Christian Mathieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Klusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthias Klusch .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Guojun Wang

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

    Albert Zomaya

  3. University of Murcia, Murcia, Murcia, Spain

    Gregorio Martinez

  4. Hunan University , Changsha, China

    Kenli Li

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mathieu, C., Klusch, M. (2015). Accelerated Steiner Tree Problem Solving on GPU with CUDA. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9529. Springer, Cham. https://doi.org/10.1007/978-3-319-27122-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27122-4_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27121-7

  • Online ISBN: 978-3-319-27122-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation