{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:13:25Z","timestamp":1743023605484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031073113"},{"type":"electronic","value":"9783031073120"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07312-0_15","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"293-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Motivating Case Study on\u00a0Code Variant Selection by\u00a0Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Hacker","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Korch","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Seiferth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3306346.3322967","volume":"38","author":"A Adams","year":"2019","unstructured":"Adams, A., et al.: Learning to optimize halide with tree search and random programs. ACM Trans. Graph. 38(4), 1\u201312 (2019). https:\/\/doi.org\/10.1145\/3306346.3322967","journal-title":"ACM Trans. Graph."},{"doi-asserted-by":"publisher","unstructured":"Ansel, J., et al.: OpenTuner: an extensible framework for program autotuning. In: Proceedings of the 23rd International Conference on Parallel Architectures and Compilation (PACT 2014). ACM (2014). https:\/\/doi.org\/10.1145\/2628071.2628092","key":"15_CR2","DOI":"10.1145\/2628071.2628092"},{"doi-asserted-by":"publisher","unstructured":"Beckingsale, D., Pearce, O., Laguna, I., Gamblin, T.: Apollo: reusable models for fast, dynamic tuning of input-dependent code. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 307\u2013316 (2017). https:\/\/doi.org\/10.1109\/IPDPS.2017.38","key":"15_CR3","DOI":"10.1109\/IPDPS.2017.38"},{"doi-asserted-by":"publisher","unstructured":"Bilmes, J., Asanovic, K., Chin, C.W., Demmel, J.: Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In: Proceedings of the 11th International Conference on Supercomputing (ICS 1997), pp. 340\u2013347. ACM, July 1997. https:\/\/doi.org\/10.1145\/263580.263662","key":"15_CR4","DOI":"10.1145\/263580.263662"},{"doi-asserted-by":"publisher","unstructured":"Haj-Ali, A., Ahmed, N.K., Willke, T., Shao, Y.S., Asanovic, K., Stoica, I.: NeuroVectorizer: end-to-end vectorization with deep reinforcement learning. In: Proceedings of the 18th ACM\/IEEE International Symposium on Code Generation and Optimization. ACM, February 2020. https:\/\/doi.org\/10.1145\/3368826.3377928","key":"15_CR5","DOI":"10.1145\/3368826.3377928"},{"doi-asserted-by":"publisher","unstructured":"Heo, K., Lee, W., Pashakhanloo, P., Naik, M.: Effective program debloating via reinforcement learning. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. ACM, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243838","key":"15_CR6","DOI":"10.1145\/3243734.3243838"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0377-0427(90)90200-J","volume":"29","author":"P van der Houwen","year":"1990","unstructured":"van der Houwen, P., Sommeijer, B.: Parallel iteration of high-order Runge-Kutta methods with stepsize control. J. Comput. Appl. Math. 29(1), 111\u2013127 (1990). https:\/\/doi.org\/10.1016\/0377-0427(90)90200-J","journal-title":"J. Comput. Appl. Math."},{"unstructured":"Konduit: DL4J: Deep learning for Java (2022). https:\/\/deeplearning4j.konduit.ai\/","key":"15_CR8"},{"doi-asserted-by":"publisher","unstructured":"Mammadli, R., Jannesari, A., Wolf, F.: Static neural compiler optimization via deep reinforcement learning. In: 2020 IEEE\/ACM 6th Workshop on the LLVM Compiler Infrastructure in HPC (LLVM-HPC) and Workshop on Hierarchical Parallelism for Exascale Computing (HiPar), pp. 1\u201311 (2020). https:\/\/doi.org\/10.1109\/LLVMHPCHiPar51896.2020.00006","key":"15_CR9","DOI":"10.1109\/LLVMHPCHiPar51896.2020.00006"},{"unstructured":"Mirhoseini, A., et al.: Device placement optimization with reinforcement learning. In: Proceedings of the 34th International Conference on Machine Learning (ICML 2017), vol. 70, pp. 2430\u20132439. PMLR (2017)","key":"15_CR10"},{"issue":"7540","key":"15_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015). https:\/\/doi.org\/10.1038\/nature14236","journal-title":"Nature"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/2954680.2872411","volume":"50","author":"S Muralidharan","year":"2016","unstructured":"Muralidharan, S., Roy, A., Hall, M., Garland, M., Rai, P.: Architecture-adaptive code variant tuning. SIGOPS Oper. Syst. Rev. 50(2), 325\u2013338 (2016). https:\/\/doi.org\/10.1145\/2954680.2872411","journal-title":"SIGOPS Oper. Syst. Rev."},{"doi-asserted-by":"publisher","unstructured":"Pfaffe, P., Grosser, T., Tillmann, M.: Efficient hierarchical online-autotuning: a case study on polyhedral accelerator mapping. In: Proceedings of the ACM International Conference on Supercomputing (ICS 2019), pp. 354\u2013366. ACM (2019). https:\/\/doi.org\/10.1145\/3330345.3330377","key":"15_CR13","DOI":"10.1145\/3330345.3330377"},{"doi-asserted-by":"publisher","unstructured":"Pfaffe, P., Tillmann, M., Walter, S., Tichy, W.F.: Online-autotuning in the presence of algorithmic choice. In: 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW 2017), pp. 1379\u20131388 (2017). https:\/\/doi.org\/10.1109\/IPDPSW.2017.28","key":"15_CR14","DOI":"10.1109\/IPDPSW.2017.28"},{"doi-asserted-by":"publisher","unstructured":"Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., Amarasinghe, S.: Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2013), pp. 519\u2013530. ACM (2013). https:\/\/doi.org\/10.1145\/2491956.2462176","key":"15_CR15","DOI":"10.1145\/2491956.2462176"},{"doi-asserted-by":"publisher","unstructured":"Rasch, A., Gorlatch, S.: ATF: a generic directive-based auto-tuning framework. Concurr. Comput. Pract. Exp. 31(5) (2019). https:\/\/doi.org\/10.1002\/cpe.4423","key":"15_CR16","DOI":"10.1002\/cpe.4423"},{"unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms, July 2017. http:\/\/arxiv.org\/abs\/1707.06347","key":"15_CR17"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-50743-5_19","volume-title":"High Performance Computing","author":"J Seiferth","year":"2020","unstructured":"Seiferth, J., Korch, M., Rauber, T.: Offsite autotuning approach. In: Sadayappan, P., Chamberlain, B.L., Juckeland, G., Ltaief, H. (eds.) ISC High Performance 2020. LNCS, vol. 12151, pp. 370\u2013390. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50743-5_19"},{"key":"15_CR19","volume-title":"Reinforcement Learning","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning, 2nd edn. The MIT Press, Cambridge (2018)","edition":"2"},{"doi-asserted-by":"publisher","unstructured":"Tiwari, A., Hollingsworth, J.K.: Online adaptive code generation and tuning. In: Proceedings of the 2011 IEEE International Parallel Distributed Processing Symposium (IPDPS 2011), pp. 879\u2013892. IEEE, May 2011. https:\/\/doi.org\/10.1109\/IPDPS.2011.86","key":"15_CR20","DOI":"10.1109\/IPDPS.2011.86"},{"doi-asserted-by":"publisher","unstructured":"Vigueras, G., Carro, M., Tamarit, S., Mari\u00f1o, J.: Towards automatic learning of heuristics for mechanical transformations of procedural code. In: Electronic Proceedings in Theoretical Computer Science, vol. 237, pp. 52\u201367. Open Publishing Association, January 2017. https:\/\/doi.org\/10.4204\/eptcs.237.4","key":"15_CR21","DOI":"10.4204\/eptcs.237.4"},{"doi-asserted-by":"publisher","unstructured":"Wang, T., Jain, N., Boehme, D., Beckingsale, D., Mueller, F., Gamblin, T.: CodeSeer: input-dependent code variants selection via machine learning. In: Proceedings of the 34th ACM International Conference on Supercomputing. ACM, June 2020. https:\/\/doi.org\/10.1145\/3392717.3392741","key":"15_CR22","DOI":"10.1145\/3392717.3392741"},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-8191(00)00087-9","volume":"27","author":"RC Whaley","year":"2001","unstructured":"Whaley, R.C., Petitet, A., Dongarra, J.: Automated empirical optimizations of software and the ATLAS project. Parallel Comput. 27(1), 3\u201335 (2001). https:\/\/doi.org\/10.1016\/S0167-8191(00)00087-9","journal-title":"Parallel Comput."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07312-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T12:15:38Z","timestamp":1673957738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07312-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031073113","9783031073120"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07312-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - 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 (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops a 27 papers have been accepted for publication out of a total of 43 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}