Group colloquium: Computation and Communication-Efficient Algorithms for Solving the Shortest Path Problem on GPUs

When: April 26, 2018, 15:45-16:45

Where: RA 3336

In my previous talk, I introduced a vertex-based algorithm to solve Single Source Shortest Path (SSSP) problem in sparse graphs on GPUs. In this talk, I will describe a different algorithm, arc-based SSSP, to solve this problem in non-sparse graphs. Moreover, I will explain how we can solve Shortest Path Query Problem (SPQP) according to these two SSSP algorithms. Finally, I will show you the experimental results of our proposed algorithms.

	Home > News and Events > Events
<< EEMCS (EWI) Home News and Events » Group Colloquium » Events » In the Media People Research Education Vacancies Intranet Contact	Group colloquium: Computation and Communication-Efficient Algorithms for Solving the Shortest Path Problem on GPUs When: April 26, 2018, 15:45-16:45 Where: RA 3336 Who: Mohsen Safari In my previous talk, I introduced a vertex-based algorithm to solve Single Source Shortest Path (SSSP) problem in sparse graphs on GPUs. In this talk, I will describe a different algorithm, arc-based SSSP, to solve this problem in non-sparse graphs. Moreover, I will explain how we can solve Shortest Path Query Problem (SPQP) according to these two SSSP algorithms. Finally, I will show you the experimental results of our proposed algorithms.