{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:31:43Z","timestamp":1743067903419,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030159955"},{"type":"electronic","value":"9783030159962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15996-2_2","type":"book-chapter","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T08:05:25Z","timestamp":1553501125000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Configuration of CUDA Runtime Variables for CDP-Based Divide-and-Conquer Algorithms"],"prefix":"10.1007","author":[{"given":"Tiago","family":"Carneiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Gmys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco Heron","family":"de Carvalho Junior","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro Pedrosa","family":"Rebou\u00e7as Filho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Tuyttens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,26]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Wang, J., Yalamanchili, S.: Characterization and analysis of dynamic parallelismin unstructured GPU applications. In: 2014 IEEE International Symposium on Workload Characterization (IISWC), pp. 51\u201360. IEEE (2014)","DOI":"10.1109\/IISWC.2014.6983039"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Mukherjee, S.S., Sharma, S.D., Hill, M.D., Larus, J.R., Rogers, A., Saltz, J.: Efficient support for irregular applications on distributed-memory machines. In: ACM SIGPLAN Notices, vol. 30, pp. 68\u201379. ACM (1995)","DOI":"10.1145\/209937.209945"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/156668.156680","volume":"28","author":"KA Yelick","year":"1993","unstructured":"Yelick, K.A.: Programming models for irregular applications. ACM SIGPLAN Not. 28(1), 28\u201331 (1993)","journal-title":"ACM SIGPLAN Not."},{"issue":"6","key":"2_CR4","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-bound algorithms: survey and synthesis. Oper. Res. 42(6), 1042\u20131066 (1994)","journal-title":"Oper. Res."},{"issue":"1","key":"2_CR5","first-page":"1","volume":"18","author":"A Brodtkorb","year":"2010","unstructured":"Brodtkorb, A., Dyken, C., Hagen, T., Hjelmervik, J., Storaasli, O.: State-of-the-art in heterogeneous computing. Sci. Program. 18(1), 1\u201333 (2010)","journal-title":"Sci. Program."},{"key":"2_CR6","unstructured":"Adinetz, A.: CUDA dynamic parallelism: API and principles (2014). Accessed 10 May 2018"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Carneiro Pessoa, T., Gmys, J., de Carvalho Junior, F.H., Melab, N., Tuyttens, D.: GPU-accelerated backtracking using CUDA dynamic parallelism. Concurr. Comput.: Pract. Exp. 30(9), e4374 (2017)","DOI":"10.1002\/cpe.4374"},{"key":"2_CR8","unstructured":"NVIDIA: CUDA C programming guide (version 9.1) (2018)"},{"key":"2_CR9","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"W Cook","year":"2012","unstructured":"Cook, W.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2012)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-44808-X_3","volume-title":"Algorithm Engineering and Experimentation","author":"J Cirasella","year":"2001","unstructured":"Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 32\u201359. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44808-X_3"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.15803\/ijnc.6.2_212","volume":"6","author":"M Plauth","year":"2016","unstructured":"Plauth, M., Feinbube, F., Schlegel, F., Polze, A.: A performance evaluation of dynamic parallelism for fine-grained, irregular workloads. Int. J. Netw. Comput. 6(2), 212\u2013229 (2016)","journal-title":"Int. J. Netw. Comput."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-24151-2_11","volume-title":"Advanced Parallel Processing Technologies","author":"T Zhang","year":"2011","unstructured":"Zhang, T., Shu, W., Wu, M.-Y.: Optimization of N-queens solvers on graphics processors. In: Temam, O., Yew, P.-C., Zang, B. (eds.) APPT 2011. LNCS, vol. 6965, pp. 142\u2013156. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24151-2_11"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, P., et al.: Dynamic parallelism for simple and efficient GPU graph algorithms. In: Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, p. 11. ACM (2015)","DOI":"10.1145\/2833179.2833189"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"DiMarco, J., Taufer, M.: Performance impact of dynamic parallelism on different clustering algorithms and the new GPU architecture. In: Proceedings of SPIE Defense, Security, and Sensing Symposium (2013)","DOI":"10.1117\/12.2018069"},{"key":"2_CR15","unstructured":"Zhang, W.: Branch-and-bound search algorithms and their computational complexity. Technical report, DTIC Document (1996)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Feinbube, F., Rabe, B., von L\u00f6wis, M., Polze, A.: NQueens on CUDA: optimization issues. In: Ninth International Symposium on Parallel and Distributed Computing (ISPDC), pp. 63\u201370. IEEE (2010)","DOI":"10.1109\/ISPDC.2010.22"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Carneiro, T., Muritiba, A., Negreiros, M., de Campos, G.: A new parallel schema for branch-and-bound algorithms using GPGPU. In: 23rd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pp. 41\u201347 (2011)","DOI":"10.1109\/SBAC-PAD.2011.20"},{"issue":"10","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1109\/71.313122","volume":"5","author":"G Karypis","year":"1994","unstructured":"Karypis, G., Kumar, V.: Unstructured tree search on SIMD parallel computers. IEEE Trans. Parallel Distrib. Syst. 5(10), 1057\u20131072 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2013 VECPAR 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15996-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:09:09Z","timestamp":1558343349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15996-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030159955","9783030159962"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15996-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VECPAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Vector and Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"S\u00e3o Pedro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vecpar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vecpar2018.ncc.unesp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}