use CUDA to accelerate the Bellman-Ford algorithm
In this project, the Bellman-Ford algorithm is implemented in different ways.
- Sequential implementation (in C)
- Multithreaded CPU implementation (pthread)
- Naive/Optimized GPU implementation (CUDA C)
The optimized GPU implementation gains a speedup of 167x over the naive parallel GPU version and 10.6x over the optimized parallel CPU version for large graphs with up to 20000 vertices.