{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:12:14Z","timestamp":1768029134330,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1111407"],"award-info":[{"award-number":["CNS 1111407"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["269623"],"award-info":[{"award-number":["269623"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1145\/2925426.2926287","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:04:07Z","timestamp":1465549447000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["DSMR"],"prefix":"10.1145","author":[{"given":"Saeed","family":"Maleki","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign and Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lenharth","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda","family":"Garzar\u00e1n","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign and Intel Corp."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Padua","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"9th dimacs implementation challenge - shortest paths. http:\/\/www.dis.uniroma1.it\/challenge9\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_48"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.96"},{"key":"e_1_3_2_1_8_1","volume-title":"Christos Faloutsos. R-MAT: A Recursive Model for Graph Mining. In Fourth SIAM International Conference on Data Mining","author":"Chakrabarti Deepayan","year":"2004","unstructured":"Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. R-MAT: A Recursive Model for Graph Mining. In Fourth SIAM International Conference on Data Mining, April 2004."},{"key":"e_1_3_2_1_9_1","volume-title":"Chaotic Relaxation. Linear Algebra and Its Applications'69, 2(7):199--222","author":"Chazan D.","year":"1969","unstructured":"D. Chazan and W. Miranker. Chaotic Relaxation. Linear Algebra and Its Applications'69, 2(7):199--222, 1969."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.058701"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.89"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_181"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_14_1","unstructured":"Nick Edmonds Alex Breuer Douglas Gregor and Andrew Lumsdaine. Single-source shortest paths with the parallel boost graph library."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_17_1","unstructured":"Galois system. http:\/\/iss.ices.utexas.edu\/?p=projects\/galois."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788912"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646344.689749"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/070698774"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791171.2791184"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387880.2387883"},{"key":"e_1_3_2_1_23_1","unstructured":"Graph 500. http:\/\/www.graph500.org\/."},{"key":"e_1_3_2_1_24_1","volume-title":"In Parallel Object-Oriented Scientific Computing (POOSC)","author":"Gregor Douglas","year":"2005","unstructured":"Douglas Gregor and Andrew Lumsdaine. The parallel bgl: A generic library for distributed graph computations. In In Parallel Object-Oriented Scientific Computing (POOSC), 2005."},{"key":"e_1_3_2_1_25_1","first-page":"100","volume-title":"Proceedings 6th Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Gutman Ron","year":"2004","unstructured":"Ron Gutman. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In Proceedings 6th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 100--111. SIAM, 2004."},{"key":"e_1_3_2_1_26_1","unstructured":"IBM XL C\/C++ Compiler for Blue Gene\/Q. http:\/\/www-03.ibm.com\/software\/products\/en\/xlcc+forbluegene."},{"key":"e_1_3_2_1_27_1","unstructured":"Intel C\/C++ Compiler. http:\/\/software.intel.com\/en-us\/c-compilers."},{"issue":"3","key":"e_1_3_2_1_28_1","first-page":"43","article-title":"Mapping networks of terrorist cells","volume":"24","author":"Krebs Valdis","year":"2002","unstructured":"Valdis Krebs. Mapping networks of terrorist cells. CONNECTIONS, 24(3):43--52, 2002.","journal-title":"CONNECTIONS"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_30_1","volume-title":"IN: 9TH DIMACS IMPLEMENTATION CHALLENGE {29","author":"K\u00c3\u0171hler Ekkehard","year":"2006","unstructured":"Ekkehard K\u00c3\u0171hler, Rolf H. M\u00c3\u0171hring, and Heiko Schilling. Fast point-to-point shortest path computations with arc-flags. In IN: 9TH DIMACS IMPLEMENTATION CHALLENGE {29, 2006."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/35082140"},{"key":"e_1_3_2_1_32_1","volume-title":"Conference on Uncertainty in Artificial Intelligence (UAI)","author":"Low Yucheng","year":"2010","unstructured":"Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. Graphlab: A new parallel framework for machine learning. In Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, July 2010."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791188.2791191"},{"key":"e_1_3_2_1_34_1","volume-title":"Padua. Languages and Compilers for Parallel Computing: 27th International Workshop, LCPC 2014","author":"Maleki Saeed","year":"2014","unstructured":"Saeed Maleki, G. Carl Evans, and David A. Padua. Languages and Compilers for Parallel Computing: 27th International Workshop, LCPC 2014, Hillsboro, OR, USA, September 15-17, 2014, Revised Selected Papers, chapter Tiled Linear Algebra a System for Parallel Graph Algorithms, pages 116--130. Springer International Publishing, Cham, 2015."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00046-4"},{"key":"e_1_3_2_1_37_1","unstructured":"MPICH: High-Performance Portable MPI. http:\/\/www.mpich.org\/."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/10\/12\/123026"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384644"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"ICS '16: 2016 International Conference on Supercomputing","location":"Istanbul Turkey","acronym":"ICS '16","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 2016 International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2925426.2926287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2925426.2926287","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2925426.2926287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:17:16Z","timestamp":1763457436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2925426.2926287"}},"subtitle":["A Parallel Algorithm for Single-Source Shortest Path Problem"],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":40,"alternative-id":["10.1145\/2925426.2926287","10.1145\/2925426"],"URL":"https:\/\/doi.org\/10.1145\/2925426.2926287","relation":{},"subject":[],"published":{"date-parts":[[2016,6]]},"assertion":[{"value":"2016-06-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}