{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:24:25Z","timestamp":1762957465478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031695827"},{"type":"electronic","value":"9783031695834"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-69583-4_27","type":"book-chapter","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:02:05Z","timestamp":1724612525000},"page":"386-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Investigating Portability in\u00a0Chapel for\u00a0Tree-Based Optimization on\u00a0GPU-Powered Clusters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6145-8352","authenticated-orcid":false,"given":"Tiago","family":"Carneiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4966-3812","authenticated-orcid":false,"given":"Engin","family":"Kayraklioglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8697-3721","authenticated-orcid":false,"given":"Guillaume","family":"Helbecque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2007.12.043","volume":"309","author":"J Bell","year":"2009","unstructured":"Bell, J., Stevens, B.: A survey of known results and research areas for n-queens. Discret. Math. 309(1), 1\u201331 (2009)","journal-title":"Discret. Math."},{"key":"27_CR2","unstructured":"Carneiro, T., Melab, N.: Chapel-based optimization. https:\/\/github.com\/tcarneirop\/ChOp (2021)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.future.2019.11.011","volume":"105","author":"T Carneiro","year":"2020","unstructured":"Carneiro, T., Gmys, J., Melab, N., Tuyttens, D.: Towards ultra-scale branch-and-bound using a high-productivity language. Futur. Gener. Comput. Syst. 105, 196\u2013209 (2020). https:\/\/doi.org\/10.1016\/j.future.2019.11.011","journal-title":"Futur. Gener. Comput. Syst."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-22734-0_19","volume-title":"Computational Science \u2013 ICCS 2019","author":"T Carneiro","year":"2019","unstructured":"Carneiro, T., Melab, N.: Productivity-aware design and implementation of distributed tree-based search algorithms. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11536, pp. 253\u2013266. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22734-0_19"},{"key":"27_CR5","unstructured":"Carneiro, T., Melab, N., Hayashi, A., Sarkar, V.: Towards chapel-based exascale tree search algorithms: dealing with multiple GPU accelerators. In: HPCS 2020-The 18th International Conference on High Performance Computing & Simulation (2021)"},{"key":"27_CR6","unstructured":"Chamberlain, B.L., et\u00a0al.: Chapel comes of age: making scalable programming productive. In: Cray User Group (2018)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Crainic, T., Le\u00a0Cun, B., Roucairol, C.: Parallel branch-and-bound algorithms. Parallel combinatorial optimization, pp. 1\u201328 (2006)","DOI":"10.1002\/9780470053928.ch1"},{"issue":"6","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B Gendron","year":"1994","unstructured":"Gendron, B., Crainic, T.G.: Parallel branch-and-branch algorithms: survey and synthesis. Oper. Res. 42(6), 1042\u20131066 (1994)","journal-title":"Oper. Res."},{"issue":"9","key":"27_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4019","volume":"29","author":"J Gmys","year":"2017","unstructured":"Gmys, J., Mezmaz, M., Melab, N., Tuyttens, D.: IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems. Concurr. Comput. Pract. Experience 29(9), e4019 (2017)","journal-title":"Concurr. Comput. Pract. Experience"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ejor.2020.01.039","volume":"284","author":"J Gmys","year":"2020","unstructured":"Gmys, J., Mezmaz, M., Melab, N., Tuyttens, D.: A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem. Eur. J. Oper. Res. 284(3), 814\u2013833 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Grama, A.Y., Kumar, V.: A survey of parallel search algorithms for discrete optimization problems. ORSA J. Comput. 7, 365\u2013490 (1993). https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/ijoc.7.4.365","DOI":"10.1287\/ijoc.7.4.365"},{"issue":"6","key":"27_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/MCSE.2013.96","volume":"15","author":"W Gropp","year":"2013","unstructured":"Gropp, W., Snir, M.: Programming for exascale computers. Comput. Sci. Eng. 15(6), 27\u201335 (2013)","journal-title":"Comput. Sci. Eng."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Mezmaz, M., Melab, N., Talbi, E.G.: A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. In: IEEE International Parallel and Distributed Processing Symposium, 2007. IPDPS 2007, pp.\u00a01\u20139. IEEE (2007)","DOI":"10.1109\/IPDPS.2007.370217"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-49583-5_24","volume-title":"Algorithms and Architectures for Parallel Processing","author":"TC Pessoa","year":"2016","unstructured":"Pessoa, T.C., Gmys, J., Melab, N., de Carvalho Junior, F.H., Tuyttens, D.: A GPU-based backtracking algorithm for permutation combinatorial problems. In: Carretero, J., Garcia-Blas, J., Ko, R.K.L., Mueller, P., Nakano, K. (eds.) ICA3PP 2016. LNCS, vol. 10048, pp. 310\u2013324. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49583-5_24"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-69583-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:05:23Z","timestamp":1724612723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-69583-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031695827","9783031695834"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-69583-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}