{"id":"https://openalex.org/W2409471617","doi":"https://doi.org/10.1145/2925426.2926287","title":"DSMR","display_name":"DSMR","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2409471617","doi":"https://doi.org/10.1145/2925426.2926287","mag":"2409471617"},"language":"en","primary_location":{"id":"doi:10.1145/2925426.2926287","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2925426.2926287","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2925426.2926287","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Conference on Supercomputing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2925426.2926287","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077514991","display_name":"Saeed Maleki","orcid":"https://orcid.org/0000-0003-1107-1827"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeed Maleki","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign and Microsoft Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign and Microsoft Research","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103999652","display_name":"Donald Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donald Nguyen","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063810839","display_name":"Andrew Lenharth","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Lenharth","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110864141","display_name":"Mar\u00eda Jes\u00fas Garzar\u00e1n","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mar\u00eda Garzar\u00e1n","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign and Intel Corp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign and Intel Corp","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109071293","display_name":"David Padua","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Padua","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013181067","display_name":"Keshav Pingali","orcid":"https://orcid.org/0000-0002-0484-4636"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keshav Pingali","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.8605188131332397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7259756326675415},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6920817494392395},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.639612078666687},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6206826567649841},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5389301180839539},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4483005404472351},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4110596179962158},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3943929672241211},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38380032777786255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36600688099861145},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.23387256264686584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.197074294090271},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17998895049095154},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0729459822177887}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.8605188131332397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259756326675415},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6920817494392395},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.639612078666687},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6206826567649841},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5389301180839539},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4483005404472351},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4110596179962158},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3943929672241211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38380032777786255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36600688099861145},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.23387256264686584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.197074294090271},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17998895049095154},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0729459822177887}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2925426.2926287","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2925426.2926287","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2925426.2926287","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Conference on Supercomputing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2925426.2926287","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2925426.2926287","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2925426.2926287","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Conference on Supercomputing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1789663435","display_name":"CSR: Large: Collaborative Research: Kali:  A System for Sequential Programming of Multicore Processors","funder_award_id":"1111407","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5667965049","display_name":null,"funder_award_id":"269623","funder_id":"https://openalex.org/F4320338284","funder_display_name":"Argonne National Laboratory"},{"id":"https://openalex.org/G6148989208","display_name":null,"funder_award_id":"CNS 1111407","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338284","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2409471617.pdf","grobid_xml":"https://content.openalex.org/works/W2409471617.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W78077100","https://openalex.org/W190901240","https://openalex.org/W1482680420","https://openalex.org/W1548756387","https://openalex.org/W1550136763","https://openalex.org/W1576026045","https://openalex.org/W1903894141","https://openalex.org/W1971937094","https://openalex.org/W1993643838","https://openalex.org/W2008620264","https://openalex.org/W2010772252","https://openalex.org/W2026042206","https://openalex.org/W2045271686","https://openalex.org/W2057112598","https://openalex.org/W2066133878","https://openalex.org/W2084224084","https://openalex.org/W2095677000","https://openalex.org/W2101196063","https://openalex.org/W2110942501","https://openalex.org/W2118169763","https://openalex.org/W2119004437","https://openalex.org/W2141380216","https://openalex.org/W2148831787","https://openalex.org/W2150898004","https://openalex.org/W2151400766","https://openalex.org/W2165461546","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2573366627","https://openalex.org/W2745560456","https://openalex.org/W2995414748","https://openalex.org/W3122602071","https://openalex.org/W4285719527","https://openalex.org/W6600944653","https://openalex.org/W6628673860","https://openalex.org/W6639897565"],"related_works":["https://openalex.org/W3013741436","https://openalex.org/W3209137076","https://openalex.org/W2363632570","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294"],"abstract_inverted_index":{"The":[0],"Single":[1],"Source":[2],"Shortest":[3],"Path":[4],"(SSSP)":[5],"problem":[6,42,56],"consists":[7],"in":[8,23,43,61],"finding":[9],"the":[10,40,47,54,69,98,103,117],"shortest":[11],"paths":[12],"from":[13],"a":[14,24,89],"vertex":[15],"(the":[16],"source":[17,59],"vertex)":[18],"to":[19,38],"all":[20],"other":[21],"vertices":[22,60],"graph.":[25],"SSSP":[26,41,55,79],"has":[27],"numerous":[28],"applications.":[29],"For":[30],"some":[31],"algorithms":[32],"and":[33,83],"applications,":[34],"it":[35],"is":[36,46,114],"useful":[37],"solve":[39],"parallel.":[44],"This":[45],"case":[48],"of":[49,91,106],"Betweenness":[50],"Centrality":[51],"which":[52],"solves":[53],"for":[57,81],"multiple":[58],"large":[62],"graphs.":[63],"In":[64],"this":[65],"paper,":[66],"we":[67],"introduce":[68,88],"Dijkstra":[70],"Strip":[71],"Mined":[72],"Relaxation":[73],"(DSMR)":[74],"algorithm,":[75,120],"an":[76],"efficient":[77],"parallel":[78,121],"algorithm":[80],"shared":[82],"distributed-memory":[84],"systems.":[85],"We":[86],"also":[87],"set":[90],"preprocessing":[92],"optimization":[93],"techniques":[94],"that":[95],"significantly":[96],"reduce":[97],"communication":[99],"overhead":[100],"without":[101],"increasing":[102],"total":[104],"amount":[105],"work":[107],"dramatically.":[108],"Our":[109],"results":[110],"show":[111],"that,":[112],"DSMR":[113],"faster":[115],"than":[116],"best":[118],"previous":[119],"\u0394-Stepping,":[122],"by":[123],"up-to":[124],"7.38\u00d7.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}