Piyush Sao, Hao Lu, Ramakrishnan Kannan, Vijay Thakkar, Richard W. Vuduc, Thomas E. Potok. Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters. In Erwin Laure, Stefano Markidis, Ana Lucia Verbanescu, Jay F. Lofstead, editors, HPDC '21: The 30th International Symposium on High-Performance Parallel and Distributed Computing, Virtual Event, Sweden, June 21-25, 2021. pages 121-131, ACM, 2021. [doi]
@inproceedings{SaoLKTVP21,
title = {Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters},
author = {Piyush Sao and Hao Lu and Ramakrishnan Kannan and Vijay Thakkar and Richard W. Vuduc and Thomas E. Potok},
year = {2021},
doi = {10.1145/3431379.3460651},
url = {https://doi.org/10.1145/3431379.3460651},
researchr = {https://researchr.org/publication/SaoLKTVP21},
cites = {0},
citedby = {0},
pages = {121-131},
booktitle = {HPDC '21: The 30th International Symposium on High-Performance Parallel and Distributed Computing, Virtual Event, Sweden, June 21-25, 2021},
editor = {Erwin Laure and Stefano Markidis and Ana Lucia Verbanescu and Jay F. Lofstead},
publisher = {ACM},
isbn = {978-1-4503-8217-5},
}