{"id":"https://openalex.org/W2885747357","doi":"https://doi.org/10.1145/3225058.3225075","title":"An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores","display_name":"An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores","publication_year":2018,"publication_date":"2018-08-08","ids":{"openalex":"https://openalex.org/W2885747357","doi":"https://doi.org/10.1145/3225058.3225075","mag":"2885747357"},"language":"en","primary_location":{"id":"doi:10.1145/3225058.3225075","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3225058.3225075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 47th International Conference on Parallel Processing","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/A5068434278","display_name":"Deepak Ajwani","orcid":"https://orcid.org/0000-0001-7269-4150"},"institutions":[{"id":"https://openalex.org/I4210105201","display_name":"Nokia (Ireland)","ror":"https://ror.org/01dcaj468","country_code":"IE","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210105201"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Deepak Ajwani","raw_affiliation_strings":["Nokia Bell Laboratories, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"Nokia Bell Laboratories, Dublin, Ireland","institution_ids":["https://openalex.org/I4210105201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085548538","display_name":"Erika Duriakova","orcid":"https://orcid.org/0000-0001-7351-385X"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Erika Duriakova","raw_affiliation_strings":["Insight Centre for Data Analytics, School of Computer Science, University College Dublin, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"Insight Centre for Data Analytics, School of Computer Science, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084111561","display_name":"Neil Hurley","orcid":"https://orcid.org/0000-0001-8428-2866"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Neil Hurley","raw_affiliation_strings":["Insight Centre for Data Analytics, School of Computer Science, University College Dublin, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"Insight Centre for Data Analytics, School of Computer Science, University College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103183708","display_name":"Ulrich Meyer","orcid":"https://orcid.org/0000-0002-1197-3153"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ulrich Meyer","raw_affiliation_strings":["Goethe University, Frankfurt, Germany"],"affiliations":[{"raw_affiliation_string":"Goethe University, Frankfurt, Germany","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091224874","display_name":"Alexander Schickedanz","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Schickedanz","raw_affiliation_strings":["Goethe University, Frankfurt, Germany"],"affiliations":[{"raw_affiliation_string":"Goethe University, Frankfurt, Germany","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5068434278"],"corresponding_institution_ids":["https://openalex.org/I4210105201"],"apc_list":null,"apc_paid":null,"fwci":0.4039,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.63665659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.7985813021659851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7769367694854736},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.645796000957489},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.5759085416793823},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5668731331825256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5079510807991028},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.48820760846138},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48111361265182495},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46531346440315247},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42746439576148987},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4161166548728943},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40840578079223633},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11620786786079407},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07039806246757507}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.7985813021659851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7769367694854736},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.645796000957489},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5759085416793823},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5668731331825256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5079510807991028},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48820760846138},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48111361265182495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46531346440315247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42746439576148987},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4161166548728943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40840578079223633},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11620786786079407},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07039806246757507},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3225058.3225075","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3225058.3225075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 47th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319077","display_name":"Society for the Study of School Psychology","ror":"https://ror.org/00gz9xf10"},{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320331354","display_name":"Insight SFI Research Centre for Data Analytics","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W814515578","https://openalex.org/W1931114878","https://openalex.org/W1969097955","https://openalex.org/W1970543907","https://openalex.org/W1977192249","https://openalex.org/W1984407615","https://openalex.org/W1989169588","https://openalex.org/W1993451940","https://openalex.org/W1998002108","https://openalex.org/W2010945917","https://openalex.org/W2011282943","https://openalex.org/W2034102265","https://openalex.org/W2041470524","https://openalex.org/W2052120747","https://openalex.org/W2057112598","https://openalex.org/W2073094163","https://openalex.org/W2073296515","https://openalex.org/W2078948975","https://openalex.org/W2084224084","https://openalex.org/W2084803275","https://openalex.org/W2094099891","https://openalex.org/W2107173440","https://openalex.org/W2117909275","https://openalex.org/W2131058166","https://openalex.org/W2135819212","https://openalex.org/W2150898004","https://openalex.org/W2154782854","https://openalex.org/W2169528473","https://openalex.org/W2237181770","https://openalex.org/W2277605219","https://openalex.org/W2294996551","https://openalex.org/W2295258302","https://openalex.org/W2402803841","https://openalex.org/W2558631043","https://openalex.org/W2573366627","https://openalex.org/W2584516749","https://openalex.org/W2620346917","https://openalex.org/W2739409954","https://openalex.org/W2755088640","https://openalex.org/W4285719527","https://openalex.org/W4301891805"],"related_works":["https://openalex.org/W2120447654","https://openalex.org/W2977179488","https://openalex.org/W2144453115","https://openalex.org/W2128223750","https://openalex.org/W4238532390","https://openalex.org/W2188872161","https://openalex.org/W2961779879","https://openalex.org/W797688974","https://openalex.org/W2002978035","https://openalex.org/W2025467172"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,16,22,81],"loop":[3],"less":[4],"k-shortest":[5],"path":[6],"(KSP)":[7],"problem.":[8],"Although":[9],"this":[10,33],"problem":[11],"has":[12],"been":[13],"studied":[14],"in":[15],"sequential":[17,58],"setting":[18],"for":[19,87],"at":[20],"least":[21],"last":[23],"two":[24],"decades,":[25],"no":[26],"good":[27],"parallel":[28,54,68],"implementations":[29,55,69],"are":[30],"known.":[31],"In":[32],"paper,":[34],"we":[35],"provide":[36],"(i)":[37],"a":[38,71],"first":[39],"systematic":[40],"empirical":[41],"comparison":[42],"of":[43,56,66,73],"various":[44,53],"KSP":[45],"algorithms":[46,59],"and":[47,60,76,84],"heuristic":[48],"optimisations,":[49],"(ii)":[50],"carefully":[51],"engineer":[52],"these":[57,67],"(iii)":[61],"perform":[62],"an":[63],"extensive":[64],"study":[65],"on":[70],"range":[72],"graph":[74,89],"classes":[75],"multicore":[77],"architectures":[78],"to":[79],"determine":[80],"best":[82],"algorithm":[83],"parallelization":[85],"strategy":[86],"different":[88],"classes.":[90]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}