External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

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]

Authors

Piyush Sao

This author has not been identified. Look up 'Piyush Sao' in Google

Hao Lu

This author has not been identified. Look up 'Hao Lu' in Google

Ramakrishnan Kannan

This author has not been identified. Look up 'Ramakrishnan Kannan' in Google

Vijay Thakkar

This author has not been identified. Look up 'Vijay Thakkar' in Google

Richard W. Vuduc

This author has not been identified. Look up 'Richard W. Vuduc' in Google

Thomas E. Potok

This author has not been identified. Look up 'Thomas E. Potok' in Google
runs on