@inproceedings{caf2886ad92546eb91cdfcae89447e1e,
title = "DSMR: A shared and distributed memory algorithm for single-source shortest path problem",
abstract = "The Single-Source Shortest Path (SSSP) problem is to find the shortest paths from a source vertex to all other vertices in a graph. In this paper, we introduce the Dijkstra Strip-Mined Relaxation (DSMR) algorithm, an efficient parallel SSSP algorithm for shared and distributed memory systems. Our results show that, DSMR is faster than parallel Δ-Stepping by a factor of up-to 1:66.",
author = "Saeed Maleki and Donald Nguyen and Andrew Lenharth and Mar{\'i}a Garzar{\'a}n and David Padua and Keshav Pingali",
note = "Publisher Copyright: {\textcopyright} 2016 ACM.; 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016 ; Conference date: 12-03-2016 Through 16-03-2016",
year = "2016",
month = feb,
day = "27",
doi = "10.1145/2851141.2851183",
language = "English (US)",
series = "Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP",
publisher = "Association for Computing Machinery",
booktitle = "21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016 - Proceedings",
address = "United States",
}