{"id":"https://openalex.org/W3131049055","doi":"https://doi.org/10.14778/3436905.3436914","title":"Accelerating exact constrained shortest paths on GPUs","display_name":"Accelerating exact constrained shortest paths on GPUs","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3131049055","doi":"https://doi.org/10.14778/3436905.3436914","mag":"3131049055"},"language":"en","primary_location":{"id":"doi:10.14778/3436905.3436914","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3436905.3436914","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-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/A5103071022","display_name":"Shengliang Lu","orcid":"https://orcid.org/0000-0003-4775-4005"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Shengliang Lu","raw_affiliation_strings":["National University of Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039946576","display_name":"Bingsheng He","orcid":"https://orcid.org/0000-0001-8618-4581"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Bingsheng He","raw_affiliation_strings":["National University of Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100348344","display_name":"Yuchen Li","orcid":"https://orcid.org/0000-0001-9646-291X"},"institutions":[{"id":"https://openalex.org/I79891267","display_name":"Singapore Management University","ror":"https://ror.org/050qmg959","country_code":"SG","type":"education","lineage":["https://openalex.org/I79891267"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Yuchen Li","raw_affiliation_strings":["Singapore Management University"],"affiliations":[{"raw_affiliation_string":"Singapore Management University","institution_ids":["https://openalex.org/I79891267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103050216","display_name":"Hao Fu","orcid":"https://orcid.org/0009-0000-8086-7779"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Fu","raw_affiliation_strings":["Tianjin University, China"],"affiliations":[{"raw_affiliation_string":"Tianjin University, China","institution_ids":["https://openalex.org/I162868743"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103071022"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.883,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.77420211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"14","issue":"4","first_page":"547","last_page":"559"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9984999895095825,"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.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9958000183105469,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8645051717758179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8434426784515381},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6743980050086975},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6454848647117615},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6263460516929626},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.474852591753006},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4109416604042053},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40758299827575684},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3569469451904297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.335451602935791}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8645051717758179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8434426784515381},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6743980050086975},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6454848647117615},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6263460516929626},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.474852591753006},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4109416604042053},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40758299827575684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3569469451904297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.335451602935791},{"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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3436905.3436914","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3436905.3436914","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:ink.library.smu.edu.sg:sis_research-7022","is_oa":false,"landing_page_url":"https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=7022&context=sis_research","pdf_url":null,"source":{"id":"https://openalex.org/S4377196871","display_name":"Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79891267","host_organization_name":"Singapore Management University","host_organization_lineage":["https://openalex.org/I79891267"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.14778/3436905.3436914","raw_type":"Conference Proceeding Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W138833385","https://openalex.org/W311217234","https://openalex.org/W606997861","https://openalex.org/W1494474111","https://openalex.org/W1497519077","https://openalex.org/W1501367650","https://openalex.org/W1536465844","https://openalex.org/W1542689763","https://openalex.org/W1548701190","https://openalex.org/W1605296224","https://openalex.org/W1799626923","https://openalex.org/W1965830721","https://openalex.org/W1995415305","https://openalex.org/W2029341065","https://openalex.org/W2035841327","https://openalex.org/W2036914862","https://openalex.org/W2040678783","https://openalex.org/W2041470524","https://openalex.org/W2042545849","https://openalex.org/W2058479406","https://openalex.org/W2060882019","https://openalex.org/W2076724219","https://openalex.org/W2107173440","https://openalex.org/W2111708605","https://openalex.org/W2128653745","https://openalex.org/W2129817042","https://openalex.org/W2130626677","https://openalex.org/W2140556610","https://openalex.org/W2169528473","https://openalex.org/W2294347342","https://openalex.org/W2404199818","https://openalex.org/W2471190594","https://openalex.org/W2564443285","https://openalex.org/W2609578772","https://openalex.org/W2766871436","https://openalex.org/W2766910786","https://openalex.org/W2767135145","https://openalex.org/W2782087530","https://openalex.org/W2887155473","https://openalex.org/W2922398414","https://openalex.org/W2948085055","https://openalex.org/W3030126027","https://openalex.org/W3097653461","https://openalex.org/W4234724504","https://openalex.org/W4252246366"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W4318196244"],"abstract_inverted_index":{"The":[0,52,133],"recently":[1],"emerging":[2,86],"applications":[3,87],"such":[4],"as":[5],"software-defined":[6],"networks":[7],"and":[8,13,61,71,99,160],"autonomous":[9],"vehicles":[10],"require":[11,154],"efficient":[12],"exact":[14,92,106,128,266],"solutions":[15,70],"for":[16,77,85,108],"constrained":[17],"shortest":[18,24,38],"paths":[19],"(CSP),":[20],"which":[21,81],"finds":[22],"the":[23,36,89,105,121,127,176,183,197,200,206,212,229,253,257],"path":[25,39],"in":[26,137],"a":[27,46,117,144,155,170,247],"graph":[28],"while":[29],"satisfying":[30],"some":[31],"user-defined":[32],"constraints.":[33],"Compared":[34,255],"with":[35,88,143,211,246,261,268],"common":[37],"problems":[40],"without":[41],"constraints,":[42],"CSP":[43,129],"queries":[44],"have":[45],"significantly":[47],"larger":[48],"number":[49,146],"of":[50,91,147,158,182,202,215],"subproblems.":[51],"most":[53],"widely":[54,230],"used":[55],"labeling":[56,122],"algorithm":[57,123],"becomes":[58],"prohibitively":[59],"slow":[60],"impractical.":[62],"Other":[63],"existing":[64],"approaches":[65],"tend":[66],"to":[67,124,141,174,208,256],"find":[68,104,126],"approximate":[69,259],"build":[72],"costly":[73],"indices":[74],"on":[75,196,226,235],"graphs":[76],"fast":[78],"query":[79],"processing,":[80],"are":[82,150],"not":[83],"suitable":[84],"requirement":[90],"solutions.":[93],"A":[94],"natural":[95],"question":[96],"is":[97,139,165,205],"whether":[98],"how":[100,140],"we":[101,113,168,188],"can":[102],"efficiently":[103,125],"solution":[107,130,164,233,260],"CSP.":[109],"In":[110],"this":[111],"paper,":[112],"propose":[114,189],"Vine":[115,138,222,239,264],",":[116],"framework":[118],"that":[119,149,199,221,250],"parallelizes":[120],"using":[131],"GPUs.":[132],"major":[134],"challenge":[135],"addressed":[136],"deal":[142],"large":[145],"subproblems":[148,177],"mostly":[151],"unpromising":[152],"but":[153],"significant":[156],"amount":[157,214],"memory":[159],"computational":[161,216],"resources.":[162,217],"Our":[163],"twofold.":[166],"First,":[167],"develop":[169],"two-level":[171],"pruning":[172],"approach":[173,249],"eliminate":[175],"by":[178],"making":[179],"good":[180],"use":[181],"GPU's":[184],"hierarchical":[185],"memory.":[186],"Second,":[187],"an":[190],"adaptive":[191],"parallelism":[192,203],"control":[193],"model":[194],"based":[195],"observations":[198],"degree":[201],"(DOP)":[204],"key":[207],"performance":[209],"optimization":[210],"given":[213],"Extensive":[218],"experiments":[219],"show":[220],"achieves":[223],"18\u00d7":[224],"speedup":[225,244],"average":[227],"over":[228,242],"adopted":[231],"CPU-based":[232],"running":[234],"40":[236],"CPU":[237],"threads.":[238],"also":[240],"has":[241],"5\u00d7":[243],"compared":[245],"GPU":[248],"statically":[251],"controls":[252],"DOP.":[254],"state-of-the-art":[258],"preprocessed":[262],"indices,":[263],"provides":[265],"results":[267],"competitive":[269],"or":[270],"even":[271],"better":[272],"performance.":[273]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}