{"id":"https://openalex.org/W3080908358","doi":"https://doi.org/10.1145/3410463.3414657","title":"Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs","display_name":"Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs","publication_year":2020,"publication_date":"2020-09-30","ids":{"openalex":"https://openalex.org/W3080908358","doi":"https://doi.org/10.1145/3410463.3414657","mag":"3080908358"},"language":"en","primary_location":{"id":"doi:10.1145/3410463.3414657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3410463.3414657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3410463.3414657","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3410463.3414657","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Changwan Hong","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Changwan Hong","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Laxman Dhulipala","orcid":null},"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":"Laxman Dhulipala","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Julian Shun","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.4907,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.66256611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"55","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9957000017166138,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/speedup","display_name":"Speedup","score":0.8949000239372253},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5874999761581421},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5648999810218811},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5482000112533569},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4887999892234802},{"id":"https://openalex.org/keywords/general-purpose-computing-on-graphics-processing-units","display_name":"General-purpose computing on graphics processing units","score":0.4596000015735626},{"id":"https://openalex.org/keywords/design-space-exploration","display_name":"Design space exploration","score":0.4106000065803528},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.39590001106262207},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.3783999979496002}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8949000239372253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8396000266075134},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6090999841690063},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5874999761581421},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5648999810218811},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5482000112533569},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4887999892234802},{"id":"https://openalex.org/C50630238","wikidata":"https://www.wikidata.org/wiki/Q971505","display_name":"General-purpose computing on graphics processing units","level":3,"score":0.4596000015735626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4205999970436096},{"id":"https://openalex.org/C2776221188","wikidata":"https://www.wikidata.org/wiki/Q21072556","display_name":"Design space exploration","level":2,"score":0.4106000065803528},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40880000591278076},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.39590001106262207},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.3783999979496002},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.367900013923645},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.3379000127315521},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3410463.3414657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3410463.3414657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3410463.3414657","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2008.11839","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.11839","pdf_url":"https://arxiv.org/pdf/2008.11839","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"}],"best_oa_location":{"id":"doi:10.1145/3410463.3414657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3410463.3414657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3410463.3414657","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1065316766","display_name":null,"funder_award_id":"Award","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3636379132","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G3700309451","display_name":null,"funder_award_id":"#CCF-1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4363747310","display_name":"CAREER: Parallel Algorithms and Frameworks for Graph and Hypergraph Processing","funder_award_id":"1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6078903008","display_name":null,"funder_award_id":"#DE-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G6650245637","display_name":null,"funder_award_id":"HR0011-18-3-0007","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7809439052","display_name":null,"funder_award_id":"CCF-1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8510928812","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G8684776890","display_name":null,"funder_award_id":"E-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3080908358.pdf","grobid_xml":"https://content.openalex.org/works/W3080908358.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W92301696","https://openalex.org/W1510835612","https://openalex.org/W1551663228","https://openalex.org/W1821591339","https://openalex.org/W1968523623","https://openalex.org/W1968933256","https://openalex.org/W1976398917","https://openalex.org/W1993297915","https://openalex.org/W1993962865","https://openalex.org/W1994598067","https://openalex.org/W1995040285","https://openalex.org/W2001383125","https://openalex.org/W2003037918","https://openalex.org/W2004350101","https://openalex.org/W2019998590","https://openalex.org/W2028583484","https://openalex.org/W2033837972","https://openalex.org/W2033887412","https://openalex.org/W2034102265","https://openalex.org/W2039688301","https://openalex.org/W2039757598","https://openalex.org/W2053999255","https://openalex.org/W2069446854","https://openalex.org/W2078629151","https://openalex.org/W2086825382","https://openalex.org/W2097426481","https://openalex.org/W2111309482","https://openalex.org/W2117148224","https://openalex.org/W2125182537","https://openalex.org/W2125742596","https://openalex.org/W2131004306","https://openalex.org/W2134008243","https://openalex.org/W2151440203","https://openalex.org/W2523378841","https://openalex.org/W2581090187","https://openalex.org/W2590926957","https://openalex.org/W2612835624","https://openalex.org/W2794887017","https://openalex.org/W2808229499","https://openalex.org/W2902093742","https://openalex.org/W2904524424","https://openalex.org/W2915012400","https://openalex.org/W2951744441","https://openalex.org/W2964294252","https://openalex.org/W2971736579","https://openalex.org/W3015485598","https://openalex.org/W3080908358","https://openalex.org/W4249333804","https://openalex.org/W6731504765"],"related_works":[],"abstract_inverted_index":{"Connected":[0],"components":[1],"and":[2,21,38,74,110,159],"spanning":[3],"forest":[4],"are":[5,25],"fundamental":[6],"graph":[7,19,30],"algorithms":[8,31,47],"due":[9,32],"to":[10,33,92,135,142],"their":[11,34],"use":[12],"in":[13,48,67],"many":[14,51,100],"important":[15],"applications,":[16],"such":[17],"as":[18,81,83],"clustering":[20],"image":[22],"segmentation.":[23],"GPUs":[24],"an":[26,107,115],"ideal":[27],"platform":[28],"for":[29,77,156,161],"high":[35],"peak":[36],"performance":[37],"memory":[39],"bandwidth.":[40],"While":[41],"there":[42],"exist":[43],"several":[44],"GPU":[45,68,96],"connectivity":[46,69,158,163],"the":[49,79,84,126],"literature,":[50],"design":[52,65,89],"choices":[53,66,90],"have":[54],"not":[55],"yet":[56],"been":[57],"explored.":[58],"In":[59,125],"this":[60],"paper,":[61],"we":[62,113,129,150],"explore":[63],"various":[64,88],"algorithms,":[70],"including":[71],"sampling,":[72],"linking,":[73],"tree":[75],"compression,":[76],"both":[78],"static":[80,123,157],"well":[82],"incremental":[85,127,162],"setting.":[86],"Our":[87],"lead":[91],"over":[93,121],"300":[94],"new":[95],"implementations":[97,145],"of":[98,101,118,133,154],"connectivity,":[99],"which":[102],"outperform":[103],"state-of-the-art.":[104],"We":[105],"present":[106],"experimental":[108],"evaluation,":[109],"show":[111],"that":[112],"achieve":[114,130,151],"average":[116],"speedup":[117,120,153],"2.47x":[119],"existing":[122],"algorithms.":[124],"setting,":[128],"a":[131,147,152,165],"throughput":[132],"up":[134],"48.23":[136],"billion":[137],"edges":[138],"per":[139],"second.":[140],"Compared":[141],"state-of-the-art":[143],"CPU":[144],"on":[146],"72-core":[148],"machine,":[149],"8.26-14.51x":[155],"1.85-13.36x":[160],"using":[164],"Tesla":[166],"V100":[167],"GPU.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2020-09-01T00:00:00"}