{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:24:52Z","timestamp":1762957492250,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637582"},{"type":"electronic","value":"9783031637599"}],"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-63759-9_13","type":"book-chapter","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T05:02:07Z","timestamp":1719550927000},"page":"103-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PGAS Data Structure for\u00a0Unbalanced Tree-Based Algorithms at\u00a0Scale"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8697-3721","authenticated-orcid":false,"given":"Guillaume","family":"Helbecque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiago","family":"Carneiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Gmys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,29]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"issue":"9","key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4374","volume":"30","author":"T Carneiro Pessoa","year":"2018","unstructured":"Carneiro Pessoa, T., Gmys, J., de Carvalho J\u00fanior, F.H., et al.: GPU-accelerated backtracking using CUDA Dynamic parallelism. Concurrency Comput. Pract. Experience 30(9), e4374 (2018)","journal-title":"Concurrency Comput. Pract. Experience"},{"unstructured":"Chamberlain, B.L., Ronaghan, E., Albrecht, B., et\u00a0al.: Chapel Comes of Age: Making Scalable Programming Productive (2018)","key":"13_CR3"},{"doi-asserted-by":"crossref","unstructured":"Cong, G., Kodali, S., Krishnamoorthy, S., et\u00a0al.: Solving large, irregular graph problems using adaptive work-stealing. In: 37th International Conference on Parallel Processing, pp. 536\u2013545 (2008)","key":"13_CR4","DOI":"10.1109\/ICPP.2008.88"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-14313-2_18","volume-title":"Euro-Par 2014: Parallel Processing Workshops","author":"T van Dijk","year":"2014","unstructured":"van Dijk, T., van de Pol, J.C.: Lace: non-blocking split deque for work-stealing. In: Lopes, L., et al. (eds.) Euro-Par 2014. LNCS, vol. 8806, pp. 206\u2013217. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14313-2_18"},{"doi-asserted-by":"crossref","unstructured":"Dinan, J., Larkins, D.B., Sadayappan, P., et\u00a0al.: Scalable work stealing. In: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. Association for Computing Machinery (2009)","key":"13_CR6","DOI":"10.1145\/1654059.1654113"},{"issue":"6","key":"13_CR7","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":"5","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1287\/ijoc.2022.1193","volume":"34","author":"J Gmys","year":"2022","unstructured":"Gmys, J.: Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers. INFORMS J. Comput. 34(5), 2502\u20132522 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"18","key":"13_CR9","doi-asserted-by":"publisher","first-page":"4463","DOI":"10.1002\/cpe.3771","volume":"28","author":"J Gmys","year":"2016","unstructured":"Gmys, J., Leroy, R., Mezmaz, M., et al.: Work stealing with private integer-vector-matrix data structure for multi-core Branch-and-Bound algorithms. Concurrency Comput. Pract. Experience 28(18), 4463\u20134484 (2016)","journal-title":"Concurrency Comput. Pract. Experience"},{"issue":"3","key":"13_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., et al.: 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."},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/ijoc.7.4.365","volume":"7","author":"A Grama","year":"1995","unstructured":"Grama, A., Kumar, V.: Parallel search algorithms for discrete optimization problems. ORSA J. Comput. 7(4), 365\u2013385 (1995)","journal-title":"ORSA J. Comput."},{"unstructured":"Helbecque, G., Gmys, J., Carneiro, T., et\u00a0al.: Productivity- and performance-aware parallel distributed depth-first search, October 2023. https:\/\/github.com\/Guillaume-Helbecque\/P3D-DFS","key":"13_CR12"},{"issue":"27","key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.7874","volume":"35","author":"G Helbecque","year":"2023","unstructured":"Helbecque, G., Gmys, J., Melab, N., et al.: Parallel distributed productivity-aware tree-search using Chapel. Concurrency Comput. Pract. Experience 35(27), e7874 (2023)","journal-title":"Concurrency Comput. Pract. Experience"},{"doi-asserted-by":"crossref","unstructured":"Lageweg, B.J., Lenstra, J.K., Rinnooy\u00a0Kan, A.H.G.: A general bounding scheme for the permutation flow-shop problem. Oper. Res. 26(1), 53\u201367 (1978)","key":"13_CR14","DOI":"10.1287\/opre.26.1.53"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00450-011-0163-3","volume":"26","author":"R Machado","year":"2011","unstructured":"Machado, R., Lojewski, C., Abreu, S., et al.: Unbalanced tree search on a manycore system using the GPI programming model. Comput. Sci. Res. Dev. 26(3), 229\u2013236 (2011)","journal-title":"Comput. Sci. Res. Dev."},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-72521-3_18","volume-title":"Languages and Compilers for Parallel Computing","author":"S Olivier","year":"2007","unstructured":"Olivier, S., et al.: UTS: an unbalanced tree search benchmark. In: Alm\u00e1si, G., Ca\u015fcaval, C., Wu, P. (eds.) LCPC 2006. LNCS, vol. 4382, pp. 235\u2013250. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72521-3_18"},{"doi-asserted-by":"crossref","unstructured":"Olivier, S., Prins, J.: Scalable dynamic load balancing using UPC. In: 37th International Conference on Parallel Processing, pp. 123\u2013131 (2008)","key":"13_CR17","DOI":"10.1109\/ICPP.2008.19"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Zhang, W.: Branch-and-Bound search algorithms and their computational complexity. Technical report, Defence Technical Information Center (1996)","key":"13_CR19"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63759-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T05:03:05Z","timestamp":1719550985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63759-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637582","9783031637599"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63759-9_13","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":"29 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","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":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}