{"id":"https://openalex.org/W3116535623","doi":"https://doi.org/10.1109/hpec43674.2020.9286141","title":"Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling","display_name":"Fast GPU Graph Contraction by Combining Efficient Shallow Searches and Post-Culling","publication_year":2020,"publication_date":"2020-09-22","ids":{"openalex":"https://openalex.org/W3116535623","doi":"https://doi.org/10.1109/hpec43674.2020.9286141","mag":"3116535623"},"language":"en","primary_location":{"id":"doi:10.1109/hpec43674.2020.9286141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec43674.2020.9286141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://digitalcommons.lsu.edu/eecs_pubs/635","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032995181","display_name":"Roozbeh Karimi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127875","display_name":"Nvidia (United States)","ror":"https://ror.org/03jdj4y14","country_code":"US","type":"company","lineage":["https://openalex.org/I4210127875"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Roozbeh Karimi","raw_affiliation_strings":["NVidia Corporation, California, USA"],"affiliations":[{"raw_affiliation_string":"NVidia Corporation, California, USA","institution_ids":["https://openalex.org/I4210127875"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036726653","display_name":"David M. Koppelman","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David M. Koppelman","raw_affiliation_strings":["Louisiana State University, Baton Rouge, USA"],"affiliations":[{"raw_affiliation_string":"Louisiana State University, Baton Rouge, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026426371","display_name":"Chris J. Michael","orcid":null},"institutions":[{"id":"https://openalex.org/I2802384920","display_name":"Stennis Space Center","ror":"https://ror.org/03j9e2j92","country_code":"US","type":"facility","lineage":["https://openalex.org/I2802384920","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris J. Michael","raw_affiliation_strings":["Naval Research Laboratory, Stennis Space Center, USA"],"affiliations":[{"raw_affiliation_string":"Naval Research Laboratory, Stennis Space Center, USA","institution_ids":["https://openalex.org/I2802384920"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032995181"],"corresponding_institution_ids":["https://openalex.org/I4210127875"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16318019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9965000152587891,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9828000068664551,"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/speedup","display_name":"Speedup","score":0.8870667219161987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7672508955001831},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6629501581192017},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6071894764900208},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.579832136631012},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.47019895911216736},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.44813403487205505},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41756531596183777},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4097966253757477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36534392833709717}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8870667219161987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7672508955001831},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6629501581192017},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6071894764900208},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.579832136631012},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.47019895911216736},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.44813403487205505},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41756531596183777},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4097966253757477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36534392833709717},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/hpec43674.2020.9286141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec43674.2020.9286141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.lsu.edu:eecs_pubs-1634","is_oa":true,"landing_page_url":"https://digitalcommons.lsu.edu/eecs_pubs/635","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"},{"id":"pmh:oai:repository.lsu.edu:eecs_pubs-1634","is_oa":true,"landing_page_url":"https://repository.lsu.edu/eecs_pubs/635","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:digitalcommons.lsu.edu:eecs_pubs-1634","is_oa":true,"landing_page_url":"https://digitalcommons.lsu.edu/eecs_pubs/635","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2963154741","display_name":null,"funder_award_id":"ACI-1265449","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3684207888","display_name":null,"funder_award_id":"N00173-16-2-C901","funder_id":"https://openalex.org/F4320337628","funder_display_name":"U.S. Naval Research Laboratory"},{"id":"https://openalex.org/G6401487099","display_name":null,"funder_award_id":"LEQSF(2015-16)-ENH-TR-10","funder_id":"https://openalex.org/F4320309392","funder_display_name":"Louisiana Board of Regents"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309392","display_name":"Louisiana Board of Regents","ror":"https://ror.org/00jv89z46"},{"id":"https://openalex.org/F4320337628","display_name":"U.S. Naval Research Laboratory","ror":"https://ror.org/04d23a975"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1904636577","https://openalex.org/W2022980325","https://openalex.org/W2095677000","https://openalex.org/W2104317982","https://openalex.org/W2107173440","https://openalex.org/W2148831787","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2409471617","https://openalex.org/W2461311369","https://openalex.org/W2523378841","https://openalex.org/W2952530739","https://openalex.org/W2963162524","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2983282793","https://openalex.org/W1973046741","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475"],"abstract_inverted_index":{"Efficient":[0],"GPU":[1,78,188],"single-source":[2],"shortest-path":[3],"(SSSP)":[4],"queries":[5],"of":[6,88,95,124,158,218,274],"road":[7],"network":[8],"graphs":[9,126,207,280,302,340],"can":[10],"be":[11,146],"realized":[12],"by":[13,226],"a":[14,56,77,93,138,181,212,267],"technique":[15],"called":[16],"PHAST":[17,42],"(Delling":[18],"et":[19,73],"al.)":[20],"in":[21,49,54,62,175,247],"which":[22,55,82,141],"the":[23,34,85,128,149,156,159,170,208,216,228,262,272,275,297],"graph":[24,37,57,268],"is":[25,38,58,127,199,202,223,289,330],"contracted":[26,36,276,322],"(pre-processed":[27],"using":[28,233],"Geisberger's":[29,327],"Contraction":[30],"Hierarchies)":[31],"once":[32],"and":[33,115,166,191,240,300,307],"resulting":[35,48],"queried":[39],"as":[40,112,282],"needed.":[41],"accommodates":[43],"GPUs'":[44,161],"parallelism":[45],"requirements":[46,165],"well,":[47],"efficient":[50,229],"queries.":[51],"For":[52,278,296],"situations":[53],"not":[59,258],"available":[60],"well":[61],"advance":[63],"or":[64],"changes":[65],"frequently":[66,129],"contraction":[67,79,86,123,287,303],"time":[68,87,263,288],"itself":[69],"becomes":[70],"significant.":[71],"Karimi":[72],"al.":[74],"recently":[75],"described":[76],"technique,":[80],"CU-CH,":[81],"significantly":[83],"reduces":[84,261],"small-to":[89],"medium-sized":[90],"graphs,":[91,110],"reporting":[92],"speedup":[94,107,201,325],"over":[96,326,331],"20\u00d7":[97],"on":[98,108,320,338],"an":[99],"NVidia":[100,335],"P100":[101],"GPU.":[102],"However":[103],"CU-CH":[104,179,230],"realizes":[105],"little":[106],"larger":[109,125,206],"such":[111,281],"DIMACS'":[113],"USA":[114,301],"W.":[116],"Europe":[117,299],"graphs.":[118,323],"The":[119,221,250,324],"obstacle":[120],"to":[121,145,152,186,192,215,242,265,294],"faster":[122,292],"performed":[130],"witness":[131],"path":[132],"search":[133],"(WPS).":[134],"A":[135],"WPS":[136,183,231],"for":[137,205,236,334],"node":[139],"determines":[140],"shortcut":[142],"edges":[143],"need":[144],"added":[147,246],"between":[148],"node's":[150],"neighbors":[151],"maintain":[153,193],"distances":[154],"after":[155],"removal":[157],"node.":[160],"strict":[162],"thread":[163,194],"convergence":[164],"limited":[167],"scratchpad":[168],"preclude":[169],"bidirectional":[171],"Dijkstra":[172],"approach":[173],"used":[174],"CPU":[176,328],"implementations.":[177],"Instead,":[178],"uses":[180],"two-hop-limit":[182],"tightly":[184],"coded":[185],"fit":[187],"shared":[189],"storage":[190],"convergence.":[195],"Where":[196],"two":[197],"hops":[198],"sufficient":[200],"high,":[203],"but":[204,232,269],"hop":[209],"limit":[210],"exacts":[211],"toll":[213],"due":[214],"accumulation":[217],"unneeded":[219],"shortcuts.":[220],"problem":[222],"overcome":[224],"here":[225],"retaining":[227],"it":[234],"both":[235],"its":[237],"original":[238],"purpose":[239],"also":[241,270,314],"identify":[243],"unnecessary":[244,251],"shortcuts":[245,252,257],"prior":[248],"steps.":[249],"are":[253,305],"culled":[254],"(removed).":[255],"Culling":[256],"only":[259],"dramatically":[260],"needed":[264],"contract":[266],"improves":[271],"quality":[273],"graph.":[277],"smaller":[279],"DIMACS":[283,298],"Cal":[284],"(travel":[285],"time)":[286],"61":[290],"%":[291],"compared":[293],"CU-CH.":[295],"times":[304,313,333],"40\u00d7":[306],"12\u00d7":[308],"faster,":[309],"respectively.":[310],"SSSP":[311],"query":[312],"improve":[315],"dramatically,":[316],"approaching":[317],"those":[318],"obtained":[319],"aggressively":[321],"code":[329],"100":[332],"VI00":[336],"GPUs":[337],"most":[339],"tried.":[341]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}