Parallel Implementation of SSSP Dijkstra algorithm in CUDA
Budget: ₹12,500 – ₹37,500 INR
1.Dijkstra's algorithm(Single Source Shortest Path) can be used to find the sortest distance from source node to all other nodes in the node network.
2.Graph nodes should be generated using 'jngen' graph generator.(File attached)
3.Shortest Distance from source node(Zero) to all other nodes should be calculated.
4.Parallel implementation of the algorithm is mandatory.
5.The CUDA code should run on NVIDIA-SMI 470.42.01 Driver Version: 470.42.01 CUDA Version: 11.4
2.Graph nodes should be generated using 'jngen' graph generator.(File attached)
3.Shortest Distance from source node(Zero) to all other nodes should be calculated.
4.Parallel implementation of the algorithm is mandatory.
5.The CUDA code should run on NVIDIA-SMI 470.42.01 Driver Version: 470.42.01 CUDA Version: 11.4