{"id":"https://openalex.org/W2768826296","doi":"https://doi.org/10.1002/cpe.4374","title":"GPU\u2010accelerated backtracking using CUDA Dynamic Parallelism","display_name":"GPU\u2010accelerated backtracking using CUDA Dynamic Parallelism","publication_year":2017,"publication_date":"2017-11-27","ids":{"openalex":"https://openalex.org/W2768826296","doi":"https://doi.org/10.1002/cpe.4374","mag":"2768826296"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4374","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4374","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","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/A5102880197","display_name":"Tiago Carneiro","orcid":"https://orcid.org/0000-0002-6145-8352"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Tiago Carneiro\u00a0Pessoa","raw_affiliation_strings":["ParGO Research Group (Parallelism, Graphs, and Optimization), Mestrado Doutorado em Ci\u00eancia da Computa\u00e7\u00e3o Universidade Federal do Cear\u00e1  Fortaleza Brazil"],"raw_orcid":"https://orcid.org/0000-0002-6145-8352","affiliations":[{"raw_affiliation_string":"ParGO Research Group (Parallelism, Graphs, and Optimization), Mestrado Doutorado em Ci\u00eancia da Computa\u00e7\u00e3o Universidade Federal do Cear\u00e1  Fortaleza Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076242888","display_name":"Jan Gmys","orcid":"https://orcid.org/0000-0001-9635-4396"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]},{"id":"https://openalex.org/I4210138412","display_name":"Centre Inria de l'Universit\u00e9 de Lille","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]}],"countries":["BE","FR"],"is_corresponding":false,"raw_author_name":"Jan Gmys","raw_affiliation_strings":["INRIA Lille Nord Europe Universit\u00e9 Lille 1, CNRS/CRIStAL  Villeneuve\u2010d'Ascq France","Mathematics and Operational Research Department (MARO) University of Mons  Mons Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Lille Nord Europe Universit\u00e9 Lille 1, CNRS/CRIStAL  Villeneuve\u2010d'Ascq France","institution_ids":["https://openalex.org/I4210138412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Mathematics and Operational Research Department (MARO) University of Mons  Mons Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071385431","display_name":"Francisco Heron de Carvalho","orcid":"https://orcid.org/0000-0003-2286-2376"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Francisco Heron de Carvalho J\u00fanior","raw_affiliation_strings":["ParGO Research Group (Parallelism, Graphs, and Optimization), Mestrado Doutorado em Ci\u00eancia da Computa\u00e7\u00e3o Universidade Federal do Cear\u00e1  Fortaleza Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ParGO Research Group (Parallelism, Graphs, and Optimization), Mestrado Doutorado em Ci\u00eancia da Computa\u00e7\u00e3o Universidade Federal do Cear\u00e1  Fortaleza Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112866837","display_name":"Nouredine Melab","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210138412","display_name":"Centre Inria de l'Universit\u00e9 de Lille","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nouredine Melab","raw_affiliation_strings":["INRIA Lille Nord Europe Universit\u00e9 Lille 1, CNRS/CRIStAL  Villeneuve\u2010d'Ascq France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Lille Nord Europe Universit\u00e9 Lille 1, CNRS/CRIStAL  Villeneuve\u2010d'Ascq France","institution_ids":["https://openalex.org/I4210138412","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075398977","display_name":"Daniel Tuyttens","orcid":"https://orcid.org/0000-0002-2567-1324"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Daniel Tuyttens","raw_affiliation_strings":["Mathematics and Operational Research Department (MARO) University of Mons  Mons Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics and Operational Research Department (MARO) University of Mons  Mons Belgium","institution_ids":["https://openalex.org/I130929987"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5102880197"],"corresponding_institution_ids":["https://openalex.org/I243754102"],"apc_list":{"value":4740,"currency":"USD","value_usd":4740},"apc_paid":null,"fwci":2.0786,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90433071,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"9","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.9443856477737427},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8037177920341492},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.6510519981384277},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6326498985290527},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.6282521486282349},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5225505232810974},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4690704047679901},{"id":"https://openalex.org/keywords/look-ahead","display_name":"Look-ahead","score":0.4615286886692047},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4522446393966675},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4422687888145447},{"id":"https://openalex.org/keywords/general-purpose-computing-on-graphics-processing-units","display_name":"General-purpose computing on graphics processing units","score":0.439853310585022},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4368603825569153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40040016174316406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1317562460899353},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.08643838763237}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9443856477737427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8037177920341492},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.6510519981384277},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6326498985290527},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.6282521486282349},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5225505232810974},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4690704047679901},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.4615286886692047},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4522446393966675},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4422687888145447},{"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.439853310585022},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4368603825569153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40040016174316406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1317562460899353},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.08643838763237},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/cpe.4374","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4374","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01648125v1","is_oa":false,"landing_page_url":"https://hal.inria.fr/hal-01648125","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1532-0626","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-01919514v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01919514","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Concurrency and Computation: Practice and Experience, 2018, 30 (9), ⟨10.1002/cpe.4374⟩","raw_type":"Journal articles"},{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/16015","is_oa":false,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/16015","pdf_url":null,"source":{"id":"https://openalex.org/S7407055454","display_name":"ORBi UMONS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Concurrency and Computation: Practice and Experience, 1-19 (2017-10-01)","raw_type":"peer reviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W99366755","https://openalex.org/W656060844","https://openalex.org/W1525900372","https://openalex.org/W1561345290","https://openalex.org/W1594608409","https://openalex.org/W1644726185","https://openalex.org/W1823070989","https://openalex.org/W1997162567","https://openalex.org/W2012223233","https://openalex.org/W2016931788","https://openalex.org/W2029940394","https://openalex.org/W2045295066","https://openalex.org/W2046295359","https://openalex.org/W2090278477","https://openalex.org/W2091739771","https://openalex.org/W2108334735","https://openalex.org/W2123440268","https://openalex.org/W2124310142","https://openalex.org/W2126607274","https://openalex.org/W2151788546","https://openalex.org/W2166915329","https://openalex.org/W2170613462","https://openalex.org/W2260499435","https://openalex.org/W2279753750","https://openalex.org/W2286462955","https://openalex.org/W2502560717","https://openalex.org/W2547803396","https://openalex.org/W2552719414","https://openalex.org/W3029849211","https://openalex.org/W4229972189","https://openalex.org/W4300848134"],"related_works":["https://openalex.org/W160089862","https://openalex.org/W1575452963","https://openalex.org/W294897107","https://openalex.org/W2021700650","https://openalex.org/W1631221657","https://openalex.org/W3149379725","https://openalex.org/W301365898","https://openalex.org/W2114502531","https://openalex.org/W2040822462","https://openalex.org/W2357479099"],"abstract_inverted_index":{"Summary":[0],"New":[1],"GPGPU":[2],"technologies,":[3],"such":[4,18],"as":[5,19,111],"CUDA":[6],"Dynamic":[7],"Parallelism":[8],"(CDP),":[9],"can":[10],"help":[11],"dealing":[12],"with":[13,183],"recursive":[14],"patterns":[15],"of":[16,69,80,104,159,192],"computation,":[17],"divide\u2010and\u2010conquer,":[20],"used":[21],"by":[22,125],"backtracking":[23,32,41,61],"algorithms.":[24],"In":[25],"this":[26,59],"paper,":[27],"we":[28],"propose":[29],"a":[30,38,53,126],"GPU\u2010accelerated":[31],"algorithm":[33,64,75,92,116,171,179],"using":[34,97],"CDP":[35,115,213],"that":[36],"extends":[37],"well\u2010known":[39],"parallel":[40],"model.":[42],"The":[43,73,90,113,140,177,190],"search":[44,50],"starts":[45],"on":[46,58,82,156,173],"CPU,":[47],"processing":[48],"the":[49,63,66,88,98,105,157,167,169,188,200,212],"tree":[51],"until":[52],"first":[54],"cutoff":[55],"depth.":[56],"Based":[57],"partial":[60],"tree,":[62],"analyzes":[65],"memory":[67,81],"requirements":[68],"subsequent":[70],"kernel":[71],"generations.":[72],"proposed":[74,91,114,170,178],"performs":[76],"no":[77],"dynamic":[78],"allocation":[79],"GPU,":[83],"unlike":[84],"related":[85,201],"works":[86],"from":[87,166,187],"literature.":[89,189],"has":[93,143],"been":[94],"extensively":[95],"tested":[96],"N\u2010Queens":[99],"Puzzle":[100],"problem":[101],"and":[102,150,209],"instances":[103],"Asymmetric":[106],"Traveling":[107],"Salesman":[108],"Problem":[109],"(ATSP)":[110],"test\u2010cases.":[112],"may,":[117],"under":[118],"some":[119,206],"conditions,":[120],"outperform":[121],"its":[122],"non\u2010CDP":[123],"counterpart":[124],"factor":[127],"up":[128,136],"to":[129,137,162],"25.":[130],"But,":[131],"it":[132],"may":[133,217],"also":[134,181,204],"be":[135,218],"twice":[138],"slower.":[139],"CDP\u2010based":[141,164,185],"implementation":[142],"much":[144],"better":[145],"worst":[146],"case":[147],"execution":[148],"times":[149],"makes":[151],"algorithm's":[152],"performance":[153],"less":[154],"dependent":[155],"tuning":[158],"parameters.":[160],"Compared":[161],"other":[163],"strategies":[165,193],"literature,":[168],"is":[172,180,194],"average":[174,196],"8\u00d7":[175],"faster.":[176],"hybridized":[182],"another":[184],"strategy":[186],"combination":[191],"in":[195],"4.5\u00d7":[197],"faster":[198],"than":[199],"strategy.":[202],"We":[203],"identify":[205],"difficulties,":[207],"limitations,":[208],"bottlenecks":[210],"concerning":[211],"programming":[214],"model":[215],"which":[216],"useful":[219],"for":[220],"helping":[221],"potential":[222],"users.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}