{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:06:30Z","timestamp":1730225190926,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/hpcs48598.2019.9188106","type":"proceedings-article","created":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T16:58:33Z","timestamp":1599670713000},"page":"19-26","source":"Crossref","is-referenced-by-count":1,"title":["An Incremental Parallel PGAS-based Tree Search Algorithm"],"prefix":"10.1109","author":[{"given":"Tiago","family":"Carneiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Chapel comes of age: Making scalable programming productive","author":"chamberlain","year":"2018","journal-title":"Cray User Group"},{"journal-title":"Chapel language specification v 986","year":"2018","key":"ref11"},{"key":"ref12","first-page":"1539","article-title":"Pgas (partitioned global address space) languages","author":"almasi","year":"2011","journal-title":"Encyclopedia of Parallel Computing"},{"key":"ref13","first-page":"1","article-title":"Userdefined parallel zippered iterators in chapel","author":"chamberlain","year":"2011","journal-title":"Proceedings of Fifth Conference on Partitioned Global Address Space Programming Models"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2010.22"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1995.395930"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370217"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.043"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.46"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/1094342006070078"},{"key":"ref4","first-page":"4374e","article-title":"GPU-accelerated backtracking using CUDA dynamic parallelism","author":"carneiro pessoa","year":"2017","journal-title":"Concurrency and Computation Practice and Experience"},{"journal-title":"Recent developments in bit-parallel algorithms","year":"2008","author":"san segundo","key":"ref3"},{"key":"ref6","first-page":"6","article-title":"Exascale machines require new programming paradigms and runtimes","volume":"2","author":"da costa","year":"2015","journal-title":"Supercomputing Frontiers and Innovations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4019"},{"key":"ref8","article-title":"Um levantamento na literatura sobre a resolu&#x00E7;&#x00E3;o de problemas de otimiza&#x00E7;&#x00E3;o combinat&#x00F3;ria atrav&#x00E9;s do uso de aceleradores gr&#x00E1;ficos","author":"carneiro","year":"2014","journal-title":"Proceedings of the XXXV Ibero-Latin American Congress on Computational Methods in Engineering (CILAMCE)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002892"},{"key":"ref2","article-title":"A survey of parallel search algorithms for discrete optimization problems","volume":"7","author":"grama","year":"1993","journal-title":"ORSA Journal on Computing"},{"journal-title":"Branch-and-Bound Search Algorithms and Their Computational Complexity","year":"1996","author":"zhang","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/9780470053928.ch1"}],"event":{"name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","start":{"date-parts":[[2019,7,15]]},"location":"Dublin, Ireland","end":{"date-parts":[[2019,7,19]]}},"container-title":["2019 International Conference on High Performance Computing &amp; Simulation (HPCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9183768\/9188050\/09188106.pdf?arnumber=9188106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:49:05Z","timestamp":1658080145000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9188106\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/hpcs48598.2019.9188106","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}