Parallelization of Shortest Path Finder on GPU: Floyd-Warshall
Till now serial computing has been used for performing all the tasks. But as the data for processing increases the load on the single node system also increase. This paper elaborates the use of parallel computing instead of the serial computing at times when the system has to process a large amount of data. The paper deals with implementation of Floyd Warshall algorithm i.e. all pair shortest path. This algorithm is implemented using parallel programming concept for faster solution.