RT info:eu-repo/semantics/conferenceObject
T1 A New GPU-based Approach to the Shortest Path Problem
A1 Ortega-Arranz, Hector
A1 Torres de la Sierra, Yuri
A1 Llanos Ferraris, Diego Rafael
A1 González Escribano, Arturo
K1 Informática
K1 Dijkstra
K1 GPU
K1 Kepler
K1 NSSP
K1 Parallel Algorithms
K1 SSSP
K1 1203 Ciencia de Los Ordenadores
K1 3304 Tecnología de Los Ordenadores
AB The Single-Source Shortest Path (SSSP) problem arises in many different fields. In this paper we present a GPU-based version of the Crauser et al. SSSP algorithm. Our work significantly speeds up the computation of the SSSP, not only with respect to the CPU-based version, but also to other state-of-the-art GPU implementation based on Dijkstra, due to Martín et al. Both GPU implementations have been evaluated using the last Nvidia architecture (Kepler). Our experimental results show that the new GPU-Crauser algorithm leads to speed-ups from 13× to 220× with respect to the CPU version and a performance gain of up to 17% with respect the GPU-Martên algorithm.
PB IEEE
YR 2013
FD 2013
LK https://uvadoc.uva.es/handle/10324/70778
UL https://uvadoc.uva.es/handle/10324/70778
LA eng
NO 2013 International Conference on High Performance Computing and Simulation (HPCS 2013), pp 505-511, ISBN 978-1-4799-0838-7, July 01-05, 2013, Helsinki, Finland,
NO Producción Científica
DS UVaDOC
RD 26-nov-2024