{"title":"一种基于案例的编译器优化序列查找方法","authors":"Ewerton Daniel de Lima, A. F. Silva, C. Herrera","doi":"10.1109/SCCC.2013.21","DOIUrl":null,"url":null,"abstract":"Among several optimizations provided by an optimizing compiler, it is a challenge, even for the most expert programmer, to know which compiler optimizations will generate the best target code. The goal of this paper is to describe a case-based reasoning approach that automatically selects a compiler optimization sequence that is able to outperform a well-engineered compiler optimization level in terms of runtime. The results obtained by our approach indicate that it achieves improvement on a set of standard benchmarks over a well-engineered compiler optimization sequence.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Case-Based Reasoning Approach to Find Good Compiler Optimization Sequences\",\"authors\":\"Ewerton Daniel de Lima, A. F. Silva, C. Herrera\",\"doi\":\"10.1109/SCCC.2013.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Among several optimizations provided by an optimizing compiler, it is a challenge, even for the most expert programmer, to know which compiler optimizations will generate the best target code. The goal of this paper is to describe a case-based reasoning approach that automatically selects a compiler optimization sequence that is able to outperform a well-engineered compiler optimization level in terms of runtime. The results obtained by our approach indicate that it achieves improvement on a set of standard benchmarks over a well-engineered compiler optimization sequence.\",\"PeriodicalId\":182181,\"journal\":{\"name\":\"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2013.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2013.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Case-Based Reasoning Approach to Find Good Compiler Optimization Sequences
Among several optimizations provided by an optimizing compiler, it is a challenge, even for the most expert programmer, to know which compiler optimizations will generate the best target code. The goal of this paper is to describe a case-based reasoning approach that automatically selects a compiler optimization sequence that is able to outperform a well-engineered compiler optimization level in terms of runtime. The results obtained by our approach indicate that it achieves improvement on a set of standard benchmarks over a well-engineered compiler optimization sequence.