TY - GEN
T1 - Yet another proposal for all pair shortest path on GPU
AU - Neelima, B.
AU - Prabhu, Rithesh G.
AU - Narayan, Anjjan S.
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/2/18
Y1 - 2015/2/18
N2 - In present day applications, there has been a rapid increase in the amount of data to be processed and stored. Same set of operations will be performed on large data. With the help of GPU's, these operations can be performed in parallel and reduce the computation time. Graph algorithms play an important role in our day to day applications. This paper reviews various implementation of All Pair Shortest Path algorithm (APSP). Further, this paper proposes a new method that can be used in increasing the efficiency of APSP on a GPU.
AB - In present day applications, there has been a rapid increase in the amount of data to be processed and stored. Same set of operations will be performed on large data. With the help of GPU's, these operations can be performed in parallel and reduce the computation time. Graph algorithms play an important role in our day to day applications. This paper reviews various implementation of All Pair Shortest Path algorithm (APSP). Further, this paper proposes a new method that can be used in increasing the efficiency of APSP on a GPU.
UR - https://www.scopus.com/pages/publications/84925434568
UR - https://www.scopus.com/pages/publications/84925434568#tab=citedBy
U2 - 10.1109/ICHPCA.2014.7045310
DO - 10.1109/ICHPCA.2014.7045310
M3 - Conference contribution
AN - SCOPUS:84925434568
T3 - 2014 International Conference on High Performance Computing and Applications, ICHPCA 2014
BT - 2014 International Conference on High Performance Computing and Applications, ICHPCA 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 International Conference on High Performance Computing and Applications, ICHPCA 2014
Y2 - 22 December 2014 through 24 December 2014
ER -