Sciweavers

PC
2010

Solving path problems on the GPU

13 years 2 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as all-pairs shortest-paths, transitive closure, and LU decomposition without pivoting) having similar data access patterns. Using the all-pairs shortest-paths problem as an example, we uncover potential gains over this class of algorithms. The impressive computational power and memory bandwidth of the GPU make it an attractive platform to run such computationally intensive algorithms. Although improvements over CPU implementations have previously been achieved for those algorithms in terms of raw speed, the utilization of the underlying computational resources was quite low. We implemented a recursively partioned all-pairs shortest-paths algorithm that harnesses the power of GPUs better than existing implementations. The alternate schedule of path computations allowed us to cast almost all operations into matr...
Aydin Buluç, John R. Gilbert, Ceren Budak
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where PC
Authors Aydin Buluç, John R. Gilbert, Ceren Budak
Comments (0)