Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

P Sao, H Lu, R Kannan, V Thakkar, R Vuduc… - Proceedings of the 30th …, 2021 - dl.acm.org
We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-
pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due …

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

R Kannan, V Thakkar, R Vuduc, T Potok - HPDC'21: Proceedings of …, 2020 - par.nsf.gov
We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-
pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due …