CUDA Solutions for the SSSP Problem

Authors:
Pedro J. Martín;Roberto Torres;Antonio Gavilanes
Affiliations:
Dpto. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Dpto. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain;Dpto. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain
Venue:
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Year:
2009

Citing 7
Cited 1

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
A parallel priority queue with constant time operations

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Introduction to Algorithms

Introduction to Algorithms
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Δ-stepping: a parallelizable shortest path algorithm

Journal of Algorithms
Accelerating large graph algorithms on the GPU using CUDA

HiPC'07 Proceedings of the 14th international conference on High performance computing
On the implementation of parallel shortest path algorithms on a supercomputer

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications

Atomic-free irregular computations on GPUs

Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present several algorithms that solve the single-source shortest-path problem using CUDA. We have run them on a database, composed of hundreds of large graphs represented by adjacency lists and adjacency matrices, achieving high speedups regarding a CPU implementation based on Fibonacci heaps. Concerning correctness, we outline why our solutions work, and show that a previous approach [10] is incorrect.