{"id":"https://openalex.org/W2902582969","doi":"https://doi.org/10.1109/hpec.2018.8547548","title":"A Fast and Efficient Parallel Algorithm for Pruned Landmark Labeling","display_name":"A Fast and Efficient Parallel Algorithm for Pruned Landmark Labeling","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2902582969","doi":"https://doi.org/10.1109/hpec.2018.8547548","mag":"2902582969"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2018.8547548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007191254","display_name":"Qing Dong","orcid":"https://orcid.org/0009-0000-3945-4980"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qing Dong","raw_affiliation_strings":["Department of Computer Science, University of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027048290","display_name":"Kartik Lakhotia","orcid":"https://orcid.org/0000-0002-9414-8481"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kartik Lakhotia","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014103790","display_name":"Hanqing Zeng","orcid":"https://orcid.org/0000-0002-2578-2147"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanqing Zeng","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081033459","display_name":"Rajgopal Karman","orcid":null},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajgopal Karman","raw_affiliation_strings":["US Army Research Lab-West"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"US Army Research Lab-West","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033166029","display_name":"Viktor K. Prasanna","orcid":"https://orcid.org/0000-0002-1609-8589"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Viktor Prasanna","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089593576","display_name":"Guna Seetharaman","orcid":null},"institutions":[{"id":"https://openalex.org/I1288214837","display_name":"United States Naval Research Laboratory","ror":"https://ror.org/04d23a975","country_code":"US","type":"facility","lineage":["https://openalex.org/I1288214837","https://openalex.org/I1330347796","https://openalex.org/I175003984","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guna Seetharaman","raw_affiliation_strings":["US Naval Research Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"US Naval Research Laboratory","institution_ids":["https://openalex.org/I1288214837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1663,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.48204393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"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.9998000264167786,"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.9998000264167786,"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.9966999888420105,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9940000176429749,"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/computer-science","display_name":"Computer science","score":0.8728281259536743},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.593632698059082},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5791286826133728},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5091702342033386},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4670713543891907},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4138852059841156},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.39855802059173584},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3942098617553711},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34252065420150757}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8728281259536743},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.593632698059082},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5791286826133728},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5091702342033386},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4670713543891907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4138852059841156},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.39855802059173584},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3942098617553711},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34252065420150757},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2018.8547548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W154362522","https://openalex.org/W160678529","https://openalex.org/W1969483458","https://openalex.org/W1994924587","https://openalex.org/W2005945380","https://openalex.org/W2008620264","https://openalex.org/W2014889099","https://openalex.org/W2057112598","https://openalex.org/W2083019227","https://openalex.org/W2084224084","https://openalex.org/W2105509646","https://openalex.org/W2116437000","https://openalex.org/W2146583842","https://openalex.org/W2151400766","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2257437291","https://openalex.org/W2602433152","https://openalex.org/W2791658191","https://openalex.org/W2809349882","https://openalex.org/W2963025109","https://openalex.org/W2964092925","https://openalex.org/W3105815789","https://openalex.org/W4211173878","https://openalex.org/W4285719527","https://openalex.org/W6654186649","https://openalex.org/W6681245171","https://openalex.org/W6735876087","https://openalex.org/W6744527873"],"related_works":["https://openalex.org/W2951598131","https://openalex.org/W4221159459","https://openalex.org/W3128136716","https://openalex.org/W3138851421","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015"],"abstract_inverted_index":{"Hub":[0],"labeling":[1],"based":[2,152,168],"shortest":[3,109],"distance":[4],"querying":[5,123,185],"plays":[6],"a":[7,69,139,154,170,233,238],"key":[8],"role":[9],"in":[10,68,97,232],"many":[11,103],"important":[12],"networked":[13],"graph":[14],"applications,":[15],"such":[16],"as":[17,37,62,119],"route":[18],"planning,":[19],"socially-sensitive":[20],"search":[21],"and":[22,121,142,160,186,206,215,227],"web":[23],"page":[24],"ranking.":[25],"Over":[26,199],"the":[27,38,47,98,173,194],"last":[28],"few":[29],"years,":[30],"Pruned":[31],"Landmark":[32],"Labeling":[33],"(PLL)":[34],"has":[35],"emerged":[36],"state-of-the-art":[39,262],"technique":[40],"for":[41,81,117],"hub":[42],"labeling.":[43],"PLL":[44,58,148],"drastically":[45],"reduces":[46],"complexity":[48,127],"of":[49,72,157,172],"label":[50,78,122,184],"construction":[51],"by":[52],"pruning":[53,120],"Shortest-Path":[54],"Trees":[55],"(SPTs).":[56],"However,":[57],"is":[59,219],"inherently":[60],"sequential,":[61],"different":[63],"SPTs":[64,93,167,211,218],"must":[65],"be":[66,114],"constructed":[67],"specific":[70],"order":[71],"source":[73,108],"vertices":[74,96],"to":[75,89,145,181,224],"ensure":[76],"small":[77,214],"size.":[79],"Particularly,":[80],"large":[82,150],"graphs,":[83],"it":[84],"takes":[85],"significant":[86,125],"processing":[87],"time":[88],"construct":[90,228],"even":[91],"pruned":[92,166,210],"from":[94],"all":[95],"graph.":[99],"While":[100],"there":[101],"are":[102],"works":[104],"on":[105,149,153,169,237,248],"parallelizing":[106,216],"single":[107],"path,":[110],"these":[111],"solutions":[112],"cannot":[113],"directly":[115],"used":[116],"PLL,":[118],"introduce":[124],"additional":[126],"while":[128],"restricting":[129],"parallelism":[130],"within":[131],"an":[132],"SPT.":[133],"In":[134],"this":[135],"paper,":[136],"we":[137,164,222],"propose":[138],"novel,":[140],"fast":[141],"efficient":[143],"algorithm":[144,192,254],"significantly":[146],"accelerate":[147],"graphs":[151],"two-level":[155],"parallelization":[156,226],"SPTs:":[158],"intra-":[159],"inter-tree.":[161],"For":[162],"intra-tree,":[163],"generate":[165],"modification":[171],"Bellman-Ford":[174],"(BF)":[175],"algorithm.":[176,264],"We":[177,189],"further":[178],"optimize":[179],"BF":[180],"reduce":[182],"SPT":[183],"initialization":[187],"costs.":[188],"implement":[190],"our":[191,251],"using":[193],"recently":[195],"proposed":[196,252],"Graph":[197],"Processing":[198],"Partitions":[200],"(GPOP)":[201],"which":[202],"dramatically":[203],"improves":[204],"cache-efficiency":[205],"DRAM":[207],"communication-bandwidth.":[208],"When":[209],"become":[212],"very":[213],"individual":[217],"not":[220],"advantageous,":[221],"switch":[223],"inter-tree":[225],"multiple":[229],"trees":[230],"concurrently":[231],"batch.":[234],"Experiments":[235],"conducted":[236],"36":[239],"core":[240],"(2-way":[241],"hyperthreaded)":[242],"Intel":[243],"Broadwell":[244],"server":[245],"show":[246],"that":[247],"some":[249],"datasets,":[250],"parallel":[253],"can":[255],"achieve":[256],"greater":[257],"than":[258],"35.1\u00d7":[259],"speedup":[260],"over":[261],"sequential":[263]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}