{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T03:35:19Z","timestamp":1773804919842,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"vor","delay-in-days":17,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["No.2023YFB3001503"],"award-info":[{"award-number":["No.2023YFB3001503"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61972408"],"award-info":[{"award-number":["No. 61972408"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Selecting the optimal combination of compiler passes is a significant challenge to enhance performance and reduce the code size of compiled binaries. While a well-selected sequence of compiler passes can yield considerable benefits, the large number of potential combinations and the scarcity of effective ones make this task prohibitively complex. To tackle this problem, we propose a novel approach to group compiler passes into a small set of sub-sequences. This approach translates the task of identifying the right compiler passes combination into determining the appropriate combination of these sub-sequences. We apply our approach to CBench and PolyBench, demonstrating remarkable performance improvements. Our approach enhances runtime performance by 22% compared to the default LLVM \u2018O3\u2019 option, and achieves a code size reduction of 24% compared to the \u2018Oz\u2019 option. Our approach also outperforms state-of-the-art across various optimization tasks and hardware platforms.<\/jats:p>","DOI":"10.1007\/s42514-024-00197-9","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T09:25:11Z","timestamp":1734513911000},"page":"588-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient compiler optimization by modeling passes dependence"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3074-106X","authenticated-orcid":false,"given":"Jianfeng","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3542-4869","authenticated-orcid":false,"given":"Jianbin","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Ting","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Chun","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,18]]},"reference":[{"issue":"7","key":"197_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/998300.997196","volume":"39","author":"L Almagor","year":"2004","unstructured":"Almagor, L., Cooper, K.D., Grosul, A., Harvey, T.J., Reeves, S.W., Subramanian, D., Torczon, L., Waterman, T.: Finding effective compilation sequences. SIGPLAN Not. 39(7), 231\u2013239 (2004). https:\/\/doi.org\/10.1145\/998300.997196","journal-title":"SIGPLAN Not."},{"key":"197_CR2","doi-asserted-by":"publisher","unstructured":"Ansel, J., Kamil, S., Veeramachaneni, K., Ragan-Kelley, J., Bosboom, J., O\u2019Reilly, U.-M., Amarasinghe, S.: Opentuner: an extensible framework for program autotuning. In: Proceedings of the 23rd International Conference on Parallel Architectures and Compilation, pp. 303\u2013316 (2014). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/2628071.2628092","DOI":"10.1145\/2628071.2628092"},{"issue":"3","key":"197_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/3124452","volume":"14","author":"AH Ashouri","year":"2017","unstructured":"Ashouri, A.H., Bignoli, A., Palermo, G., Silvano, C., Kulkarni, S., Cavazos, J.: Micomp: mitigating the compiler phase-ordering problem using optimization sub-sequences and machine learning. ACM Trans. Archit. Code Optim. 14(3), 29 (2017). https:\/\/doi.org\/10.1145\/3124452","journal-title":"ACM Trans. Archit. Code Optim."},{"issue":"5","key":"197_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/3197978","volume":"51","author":"AH Ashouri","year":"2018","unstructured":"Ashouri, A.H., Killian, W., Cavazos, J., Palermo, G., Silvano, C.: A survey on compiler autotuning using machine learning. ACM Comput. Surv. 51(5), 96 (2018). https:\/\/doi.org\/10.1145\/3197978","journal-title":"ACM Comput. Surv."},{"key":"197_CR5","doi-asserted-by":"publisher","unstructured":"Chen, J., Xu, N., Chen, P., Zhang, H.: Efficient compiler autotuning via bayesian optimization. In: 2021 IEEE\/ACM 43rd International Conference on Software Engineering (ICSE), pp. 1198\u20131209 (2021). https:\/\/doi.org\/10.1109\/ICSE43902.2021.00110","DOI":"10.1109\/ICSE43902.2021.00110"},{"issue":"7","key":"197_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/315253.314414","volume":"34","author":"KD Cooper","year":"1999","unstructured":"Cooper, K.D., Schielke, P.J., Subramanian, D.: Optimizing for reduced code space using genetic algorithms. SIGPLAN Not. 34(7), 1\u20139 (1999). https:\/\/doi.org\/10.1145\/315253.314414","journal-title":"SIGPLAN Not."},{"issue":"3","key":"197_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s10766-010-0161-2","volume":"39","author":"G Fursin","year":"2011","unstructured":"Fursin, G., Kashnikov, Y., Memon, A.W., Chamski, Z., Temam, O., Namolaru, M., Yom-Tov, E., Mendelson, B., Zaks, A., Courtois, E., Bodin, F., Barnard, P., Ashton, E., Bonilla, E., Thomson, J., Williams, C.K.I., O\u2019Boyle, M.: Milepost gcc: machine learning enabled self-tuning compiler. Int. J. Parallel Programm. 39(3), 296\u2013327 (2011). https:\/\/doi.org\/10.1007\/s10766-010-0161-2","journal-title":"Int. J. Parallel Programm."},{"key":"197_CR8","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. CGO 2020, pp. 242\u2013255. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3368826.3377928","DOI":"10.1145\/3368826.3377928"},{"key":"197_CR9","doi-asserted-by":"publisher","unstructured":"Jain, S., Andaluri, Y., VenkataKeerthy, S., Upadrasta, R.: Poset-rl: Phase ordering for optimizing size and execution time using reinforcement learning. In: 2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pp. 121\u2013131 (2022). https:\/\/doi.org\/10.1109\/ISPASS55109.2022.00012","DOI":"10.1109\/ISPASS55109.2022.00012"},{"key":"197_CR10","doi-asserted-by":"publisher","unstructured":"Leather, H., Cummins, C.: Machine learning in compilers: past, present and future. In: 2020 Forum for Specification and Design Languages (FDL), pp. 1\u20138 (2020). https:\/\/doi.org\/10.1109\/FDL50818.2020.9232934","DOI":"10.1109\/FDL50818.2020.9232934"},{"issue":"7","key":"197_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1543136.1542460","volume":"44","author":"H Leather","year":"2009","unstructured":"Leather, H., O\u2019Boyle, M., Worton, B.: Raced profiles: efficient selection of competing compiler optimizations. SIGPLAN Not. 44(7), 50\u201359 (2009). https:\/\/doi.org\/10.1145\/1543136.1542460","journal-title":"SIGPLAN Not."},{"key":"197_CR12","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","DOI":"10.1109\/LLVMHPCHiPar51896.2020.00006"},{"issue":"4","key":"197_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/1014194.800942","volume":"13","author":"SR Vegdahl","year":"1982","unstructured":"Vegdahl, S.R.: Phase coupling and constant generation in an optimizing microcode compiler. SIGMICRO Newsl. 13(4), 125\u2013133 (1982). https:\/\/doi.org\/10.1145\/1014194.800942","journal-title":"SIGMICRO Newsl."},{"issue":"11","key":"197_CR15","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1109\/JPROC.2018.2817118","volume":"106","author":"Z Wang","year":"2018","unstructured":"Wang, Z., O\u2019Boyle, M.: Machine learning in compiler optimization. Proc. IEEE 106(11), 1879\u20131901 (2018). https:\/\/doi.org\/10.1109\/JPROC.2018.2817118","journal-title":"Proc. IEEE"},{"key":"197_CR14","unstructured":"Wang, L., Fonseca, R., Tian, Y.: Learning search space partition for black-box optimization using monte carlo tree search. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, Virtual (2020)"},{"key":"197_CR16","doi-asserted-by":"publisher","unstructured":"Zhang, P., Fang, J., Tang, T., Yang, C., Wang, Z.: Auto-tuning streamed applications on intel xeon phi. In: 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 515\u2013525 (2018). https:\/\/doi.org\/10.1109\/IPDPS.2018.00061","DOI":"10.1109\/IPDPS.2018.00061"},{"key":"197_CR18","doi-asserted-by":"publisher","unstructured":"Zheng, W., Fang, J., Juan, C., Wu, F., Pan, X., Wang, H., Sun, X., Yuan, Y., Xie, M., Huang, C., Tang, T., Wang, Z.: Auto-tuning MPI collective operations on large-scale parallel systems. In: 2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), pp. 670\u2013677 (2019). https:\/\/doi.org\/10.1109\/HPCC\/SMARTCITY\/DSS.2019.00101","DOI":"10.1109\/HPCC\/SMARTCITY\/DSS.2019.00101"}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-024-00197-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-024-00197-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-024-00197-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T06:51:04Z","timestamp":1737528664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-024-00197-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["197"],"URL":"https:\/\/doi.org\/10.1007\/s42514-024-00197-9","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"value":"2524-4922","type":"print"},{"value":"2524-4930","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"7 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}