{"id":"https://openalex.org/W2802440256","doi":"https://doi.org/10.1145/3210377.3210414","title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable","display_name":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2802440256","doi":"https://doi.org/10.1145/3210377.3210414","mag":"2802440256"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210414","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210414","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210414","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210414","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065818820","display_name":"Laxman Dhulipala","orcid":"https://orcid.org/0000-0003-0685-064X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Laxman Dhulipala","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["MIT CSAIL, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL, Boston, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065818820"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":7.6489,"has_fulltext":true,"cited_by_count":98,"citation_normalized_percentile":{"value":0.97982287,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"393","last_page":"404"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.8519441485404968},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6429709792137146},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5743947625160217},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5011477470397949},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4650946855545044},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45645591616630554},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4154566824436188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3802156448364258},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.16236424446105957},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13359040021896362},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.12498077750205994},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12312692403793335}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8519441485404968},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6429709792137146},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5743947625160217},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5011477470397949},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4650946855545044},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45645591616630554},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4154566824436188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3802156448364258},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.16236424446105957},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13359040021896362},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12498077750205994},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12312692403793335}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3210377.3210414","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210414","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210414","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1805.05208","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.05208","pdf_url":"https://arxiv.org/pdf/1805.05208","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/135027","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/135027","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/143885","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/143885","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"doi:10.1145/3210377.3210414","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210414","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210414","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G1560875024","display_name":"SHF: Medium: Collaborative Research: Automatic Locality Management for Dynamically Scheduled Parallelism","funder_award_id":"1408940","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1574315406","display_name":null,"funder_award_id":"CCF-1408940","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2461472526","display_name":"XPS: FULL: FP: Write-Efficient Parallel Algorithms for Emerging Memory Technologies","funder_award_id":"1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3366761448","display_name":null,"funder_award_id":"CCF-1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7010669580","display_name":null,"funder_award_id":"1629444","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8803023401","display_name":null,"funder_award_id":"CCF-1629444","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G912878421","display_name":null,"funder_award_id":"CCF-1408940, CCF-1533858, CCF-1629444.","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2802440256.pdf","grobid_xml":"https://content.openalex.org/works/W2802440256.grobid-xml"},"referenced_works_count":162,"referenced_works":["https://openalex.org/W22572007","https://openalex.org/W23573688","https://openalex.org/W78077100","https://openalex.org/W183656749","https://openalex.org/W198890980","https://openalex.org/W808058772","https://openalex.org/W1475732121","https://openalex.org/W1489509891","https://openalex.org/W1497287285","https://openalex.org/W1507039213","https://openalex.org/W1513982482","https://openalex.org/W1528711087","https://openalex.org/W1531625822","https://openalex.org/W1535144194","https://openalex.org/W1539701003","https://openalex.org/W1543897857","https://openalex.org/W1566824445","https://openalex.org/W1576026045","https://openalex.org/W1582397847","https://openalex.org/W1595783387","https://openalex.org/W1604585469","https://openalex.org/W1807272711","https://openalex.org/W1896160955","https://openalex.org/W1945186739","https://openalex.org/W1945708402","https://openalex.org/W1955235267","https://openalex.org/W1964089073","https://openalex.org/W1967066104","https://openalex.org/W1972786931","https://openalex.org/W1974807151","https://openalex.org/W1975274780","https://openalex.org/W1981032891","https://openalex.org/W1984291654","https://openalex.org/W1988837529","https://openalex.org/W1991858502","https://openalex.org/W1994598067","https://openalex.org/W1994727615","https://openalex.org/W1995040285","https://openalex.org/W1999812064","https://openalex.org/W2000041758","https://openalex.org/W2002055996","https://openalex.org/W2002531683","https://openalex.org/W2004350101","https://openalex.org/W2011771662","https://openalex.org/W2013081353","https://openalex.org/W2016311778","https://openalex.org/W2016559894","https://openalex.org/W2025919541","https://openalex.org/W2026143151","https://openalex.org/W2032181982","https://openalex.org/W2034102265","https://openalex.org/W2038570785","https://openalex.org/W2039997255","https://openalex.org/W2042010354","https://openalex.org/W2044112344","https://openalex.org/W2045446569","https://openalex.org/W2047345171","https://openalex.org/W2051109346","https://openalex.org/W2053482409","https://openalex.org/W2057112598","https://openalex.org/W2057925324","https://openalex.org/W2061303458","https://openalex.org/W2061983247","https://openalex.org/W2065187378","https://openalex.org/W2066636486","https://openalex.org/W2071134069","https://openalex.org/W2073975876","https://openalex.org/W2074875917","https://openalex.org/W2080098453","https://openalex.org/W2082801772","https://openalex.org/W2086337948","https://openalex.org/W2088570605","https://openalex.org/W2090885171","https://openalex.org/W2092534058","https://openalex.org/W2092720654","https://openalex.org/W2094224753","https://openalex.org/W2094900885","https://openalex.org/W2096544401","https://openalex.org/W2097884397","https://openalex.org/W2098297530","https://openalex.org/W2100061495","https://openalex.org/W2100225700","https://openalex.org/W2101196063","https://openalex.org/W2108301529","https://openalex.org/W2120490947","https://openalex.org/W2120925698","https://openalex.org/W2125182537","https://openalex.org/W2126077878","https://openalex.org/W2132750992","https://openalex.org/W2137572956","https://openalex.org/W2138304862","https://openalex.org/W2144970024","https://openalex.org/W2148606255","https://openalex.org/W2151690061","https://openalex.org/W2152907584","https://openalex.org/W2154702940","https://openalex.org/W2165301438","https://openalex.org/W2165606466","https://openalex.org/W2170616854","https://openalex.org/W2171707538","https://openalex.org/W2175110005","https://openalex.org/W2177862760","https://openalex.org/W2232813226","https://openalex.org/W2292193262","https://openalex.org/W2408601709","https://openalex.org/W2409471617","https://openalex.org/W2469481711","https://openalex.org/W2480409449","https://openalex.org/W2498113451","https://openalex.org/W2546689575","https://openalex.org/W2574229471","https://openalex.org/W2582846437","https://openalex.org/W2588458088","https://openalex.org/W2595815880","https://openalex.org/W2605153484","https://openalex.org/W2606413522","https://openalex.org/W2611219145","https://openalex.org/W2725219117","https://openalex.org/W2735337572","https://openalex.org/W2739409954","https://openalex.org/W2751186796","https://openalex.org/W2763158813","https://openalex.org/W2765155492","https://openalex.org/W2776603735","https://openalex.org/W2782087530","https://openalex.org/W2783930193","https://openalex.org/W2798525482","https://openalex.org/W2798579874","https://openalex.org/W2802440256","https://openalex.org/W2887468875","https://openalex.org/W2898231337","https://openalex.org/W2911409877","https://openalex.org/W2953539745","https://openalex.org/W2963924681","https://openalex.org/W2964070308","https://openalex.org/W2993198966","https://openalex.org/W3098475836","https://openalex.org/W3099866104","https://openalex.org/W3101346938","https://openalex.org/W3104921985","https://openalex.org/W3145128584","https://openalex.org/W3157585079","https://openalex.org/W4212939824","https://openalex.org/W4214651228","https://openalex.org/W4236539906","https://openalex.org/W4240827605","https://openalex.org/W4244579861","https://openalex.org/W4246219036","https://openalex.org/W4247322843","https://openalex.org/W4251344828","https://openalex.org/W4285719527","https://openalex.org/W4289665873","https://openalex.org/W4295180119","https://openalex.org/W4298313295","https://openalex.org/W6600944653","https://openalex.org/W6635487903","https://openalex.org/W6638337918","https://openalex.org/W6677894098","https://openalex.org/W6681707426","https://openalex.org/W6685131550","https://openalex.org/W6724294556","https://openalex.org/W6786301650"],"related_works":["https://openalex.org/W2120447654","https://openalex.org/W2977179488","https://openalex.org/W2144453115","https://openalex.org/W2744553356","https://openalex.org/W2128223750","https://openalex.org/W4238532390","https://openalex.org/W2188872161","https://openalex.org/W2961779879","https://openalex.org/W2610007503","https://openalex.org/W4401278057"],"abstract_inverted_index":{"There":[0],"has":[1],"been":[2,26,211],"significant":[3],"recent":[4],"interest":[5],"in":[6,57,70,111,139,163,169],"parallel":[7,118,146],"graph":[8,23,41,45,85,106,110,119,151],"processing":[9,137],"due":[10],"to":[11,14,95,123,172],"the":[12,17,37,58,71,80,83,124,156,181,192,199,206],"need":[13],"quickly":[15],"analyze":[16],"large":[18,175],"graphs":[19,127,176,214],"available":[20],"today.":[21],"Many":[22],"codes":[24],"have":[25,210],"designed":[27],"for":[28,82,148],"distributed":[29,87],"memory":[30,59],"or":[31,88],"external":[32,89],"memory.":[33,90,112],"However,":[34],"today":[35],"even":[36],"largest":[38,125,193],"publicly-available":[39,126,221],"real-world":[40,194],"(the":[42],"Hyperlink":[43,84],"Web":[44],"with":[46,132],"over":[47],"3.5":[48],"billion":[49,53],"vertices":[50],"and":[51,79,158],"128":[52],"edges)":[54],"can":[55,99,121],"fit":[56],"of":[60,105,135,144,184,198],"a":[61,102,129,133,220],"single":[62,130],"commodity":[63],"multicore":[64],"server.":[65],"Nevertheless,":[66],"most":[67],"experimental":[68],"work":[69],"literature":[72],"report":[73],"results":[74],"on":[75,108,191,213],"much":[76],"smaller":[77],"graphs,":[78],"ones":[81],"use":[86],"Therefore,":[91],"it":[92],"is":[93,205],"natural":[94],"ask":[96],"whether":[97],"we":[98,161,202],"efficiently":[100],"solve":[101],"broad":[103],"class":[104],"problems":[107,200],"this":[109,204,216],"This":[113],"paper":[114],"shows":[115],"that":[116,160,180,201],"theoretically-efficient":[117,145],"algorithms":[120,147],"scale":[122],"using":[128],"machine":[131],"terabyte":[134],"RAM,":[136],"them":[138],"minutes.":[140],"We":[141,153,178,218],"give":[142],"implementations":[143,186,190],"13":[149],"important":[150],"problems.":[152],"also":[154],"present":[155],"optimizations":[157],"techniques":[159],"used":[162],"our":[164,185,225],"implementations,":[165],"which":[166],"were":[167],"crucial":[168],"enabling":[170],"us":[171],"process":[173],"these":[174],"quickly.":[177],"show":[179],"running":[182],"times":[183],"outperform":[187],"existing":[188],"state-of-the-art":[189],"graphs.":[195],"For":[196],"many":[197],"consider,":[203],"first":[207],"time":[208],"they":[209],"solved":[212],"at":[215],"scale.":[217],"provide":[219],"benchmark":[222],"suite":[223],"containing":[224],"implementations.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":32},{"year":2020,"cited_by_count":26},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}