EGGH08: SIGGRAPH/Eurographics Workshop on Graphics Hardware 2008
Permanent URI for this collection
Browse
Browsing EGGH08: SIGGRAPH/Eurographics Workshop on Graphics Hardware 2008 by Subject "Categories and Subject Descriptors (according to ACM CCS): I.3.1 [Computer Graphics]: Hardware Architecture Graphics Processors Parallel processing G.2.2 [Graph Theory]: Graph algorithms"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item All-Pairs Shortest-Paths for Large Graphs on the GPU(The Eurographics Association, 2008) Katz, Gary J.; Jr., Joseph T. Kider; David Luebke and John OwensThe all-pairs shortest-path problem is an intricate part in numerous practical applications. We describe a shared memory cache efficient GPU implementation to solve transitive closure and the all-pairs shortest-path problem on directed graphs for large datasets. The proposed algorithmic design utilizes the resources available on the NVIDIA G80 GPU architecture using the CUDA API. Our solution generalizes to handle graph sizes that are inherently larger then the DRAM memory available on the GPU. Experiments demonstrate that our method is able to significantly increase processing large graphs making our method applicable for bioinformatics, internet node traffic, social networking, and routing problems.