Journal of the ACM (JACM)
Communications of the ACM
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Introduction to Algorithms
Fast matrix multiplies using graphics hardware
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
A blocked all-pairs shortest-paths algorithm
Journal of Experimental Algorithmics (JEA)
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Glift: Generic, efficient, random-access GPU data structures
ACM Transactions on Graphics (TOG)
Program generation for the all-pairs shortest path problem
Proceedings of the 15th international conference on Parallel architectures and compilation techniques
A memory model for scientific algorithms on graphics processors
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Cache-Friendly implementations of transitive closure
Journal of Experimental Algorithmics (JEA)
Scan primitives for GPU computing
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Cache-efficient numerical algorithms using graphics hardware
Parallel Computing
Accelerating large graph algorithms on the GPU using CUDA
HiPC'07 Proceedings of the 14th international conference on High performance computing
Parallel FPGA-based all-pairs shortest-paths in a directed graph
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A heterogeneous accelerator platform for multi-subject voxel-based brain network analysis
Proceedings of the International Conference on Computer-Aided Design
A task parallel algorithm for finding all-pairs shortest paths using the GPU
International Journal of High Performance Computing and Networking
A yoke of oxen and a thousand chickens for heavy lifting graph processing
Proceedings of the 21st international conference on Parallel architectures and compilation techniques
Approximate weighted matching on emerging manycore and multithreaded architectures
International Journal of High Performance Computing Applications
A survey on proximity measures for social networks
Search Computing
Simulating large topologies in ns-3 using BRITE and CUDA driven global routing
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
A comparative study of parallel algorithms for the girth problem
AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
A memory access model for highly-threaded many-core architectures
Future Generation Computer Systems
FALCON or how to compute measures time efficiently on dynamically evolving dense complex networks?
Journal of Biomedical Informatics
| Hi-index | 0.00 |
The 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.