Journal Article

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

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

2015

Overview

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 × for some graph families, using less memory space.

• Publisher: Springer US,Springer Nature B.V
• Subject: Algorithms / Analysis / Boards / Computer programming / Computer Science / Dijkstra's algorithm / Graph theory / Graphs / Libraries / Optimization / Optimization techniques / Parallel processing / Platforms / Processor Architectures / Shortest path algorithms / Shortest-path problems / Software Engineering/Programming and Operating Systems / Studies / Texts / Theory of Computation