Skip to main content
SpringerLink
Log in

Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

The single-source shortest path (SSSP) problem arises in many different fields. In this paper, we present a GPU SSSP algorithm implementation. Our work significantly speeds up the computation of the SSSP, not only with respect to a CPU-based version, but also to other state-of-the-art GPU implementations based on Dijkstra. Both GPU implementations have been evaluated using the latest NVIDIA architectures. The graphs chosen as input sets vary in nature, size, and fan-out degree, in order to evaluate the behavior of the algorithms for different data classes. Additionally, we have enhanced our GPU algorithm implementation using two optimization techniques: The use of a proper choice of threadblock size; and the modification of the GPU L1 cache memory state of NVIDIA devices. These optimizations lead to performance improvements of up to 23 % with respect to the non-optimized versions. In addition, we have made a platform comparison of several NVIDIA boards in order to distinguish which one is better for each class of graphs, depending on their features. Finally, we compare our results with an optimized sequential implementation of Dijkstra’s algorithm included in the reference Boost library, obtaining an improvement ratio of up to 19\(\times \) for some graph families, using less memory space.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Bast, H., Delling, D., Goldberg, A., Muller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. In: Microsoft Research, Techical Report MSR-TR-2014-4 (2014)

  2. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases, in VLDB’03, pp. 802–813. VLDB Endowment, Berlin (2003)

  3. Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM J. Comput. 30, 809–837 (2000)

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Siek, J.G., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Longman, Boston, MA (2002)

    Google Scholar 

  6. Martín, P., Torres, R., Gavilanes, A.: CUDA Solutions for the SSSP Problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G., Dongarra, J., Sloot, P. (eds.) In Computational Science—ICCS 2009, ser. LNCS. vol. 5544, pp. 904–913. Springer, Berlin (2009)

  7. Harish, P., Vineet, V., Narayanan, P.J.: Large graph algorithms for massively multithreaded architectures, Centre for Visual Information Technology, International Institute of IT, Hyderabad, India, Techical Report IIIT/TR/2009/74 (2009)

  8. Kirk, D.B., Hwu, W.W.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann, San Francisco, CA (2010)

  9. Crauser, A., Mehlhorn, K., Meyer, U., Sanders, P.: A parallelization of Dijkstra’s shortest path algorithm. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) In Mathematical Foundations of Computer Science 1998, ser. LNCS, vol. 1450, pp. 722–731. Springer, Berlin (1998)

  10. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd ed. Burr Ridge, Il 60521: McGraw-Hill Higher Education (2001)

  11. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  12. Singh, D.P., Khare, N.: A study of different parallel implementations of single source shortest path algorithms. Int. J. Comput. Appl. 54(10), 26–30 (2012)

    Google Scholar 

  13. Papaefthymiou, M., Rodrigue, J.: Implementing Parallel Shortest-paths Algorithms, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. vol. 30, pp. 59–68. American Mathematical Society, Providence (1994)

  14. Meyer, U., Sanders, P.: \(\Delta \)-Stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114–152 (2003) [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0196677403000762

  15. Davidson, A., Baxter, S., Garland, M., Owens, J.: Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths, in Parallel and Distributed Processing Symposium, 2014 IEEE 28th International, pp. 349–359 (2014)

  16. Harris, M.: Optimizing Parallel Reduction in CUDA, developer.download.nvidia.com/assets/cuda/files/reduction.pdf, nVidia (2008)

  17. Ortega, H., Torres, Y., Gonzalez-Escribano, A., Llanos, D.R.: Optimizing an APSP implementation for NVIDIA GPUs using Kernel characterization criteria. J. Supercomput. 70(2), 786–798 (2014)

  18. Nobari, S., Lu, X., Karras, P., Bressan, S.: Fast random graph generation, In: Proceedings of the 14th International Conference on Extending Database Technology, ser. EDBT/ICDT ’11. pp. 331–342. ACM, New York, NY (2011)

  19. DIMACS implementation challenge, (2012). [Online]. Available: http://www.cise.ufl.edu/research/sparse/dimacs10

  20. Gleich, D.F.: Graph of flickr photo-sharing social network crawled in may 2006, (2012). [Online]. Available: https://purr.purdue.edu/publications/1002

Download references

Acknowledgments

This research has been partially supported by the Ministerio de Economía y Competitividad (Spain) and ERDF program of the European Union: CAPAP-H5 network (TIN2014-53522-REDT), MOGECOPP project (TIN2011-25639); Junta de Castilla y León (Spain): ATLAS project (VA172A12-2); and the COST Program Action IC1305: NESUS.

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidad de Valladolid, Valladolid, Spain

    Hector Ortega-Arranz, Yuri Torres, Arturo Gonzalez-Escribano & Diego R. Llanos

Authors
  1. Hector Ortega-Arranz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Torres
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arturo Gonzalez-Escribano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Diego R. Llanos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hector Ortega-Arranz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ortega-Arranz, H., Torres, Y., Gonzalez-Escribano, A. et al. Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem. Int J Parallel Prog 43, 918–938 (2015). https://doi.org/10.1007/s10766-015-0351-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10766-015-0351-z

Keywords

Search

Navigation