Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2017

Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths

Mohsen Safari
  • Function : Author
  • PersonId : 1030364
Ali Ebnenasir
  • Function : Author
  • PersonId : 999411

Abstract

This paper presents a novel parallel algorithm for solving the Single-Source Shortest Path (SSSP) problem on GPUs. The proposed algorithm is based on the idea of locality-based relaxation, where instead of updating just the distance of a single vertex v, we update the distances of v’s neighboring vertices up to k steps. The proposed algorithm also implements a communication-efficient method (in the CUDA programming model) that minimizes the number of kernel launches, the number of atomic operations and the frequency of CPU-GPU communication without any need for thread synchronization. This is a significant contribution as most existing methods often minimize one at the expense of another. Our experimental results demonstrate that our approach outperforms most existing methods on real-world road networks of up to 6.3 million vertices and 15 million arcs (on weaker GPUs).
Fichier principal
Vignette du fichier
440117_1_En_5_Chapter.pdf (361.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01760642 , version 1 (06-04-2018)

Licence

Attribution

Identifiers

Cite

Mohsen Safari, Ali Ebnenasir. Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths. 2nd International Conference on Topics in Theoretical Computer Science (TTCS), Sep 2017, Tehran, Iran. pp.41-56, ⟨10.1007/978-3-319-68953-1_5⟩. ⟨hal-01760642⟩
85 View
307 Download

Altmetric

Share

Gmail Facebook X LinkedIn More