Reduced O3 subsequence labelling: a stepping stone towards optimisation sequence prediction

References

• Ashouri, A. H., Bignoli, A., Palermo, G., & Silvano, C. (2016). Predictive modeling methodology for compiler phase-ordering. In Proceedings of the 7th workshop on parallel programming and run-time management techniques for many-core architectures and the 5th workshop on design tools and architectures for multicore embedded computing platforms (pp. 7–12). Association for Computing Machinery. https://doi.org/10.1145/2872421.2872424.
   Google Scholar
• Ashouri, A. H., Bignoli, A., Palermo, G., Silvano, C., Kulkarni, S., & Cavazos, J. (2017). MiCOMP: Mitigating the compiler phase-ordering problem using optimization sub-sequences and machine learning. ACM Transactions on Architecture and Code Optimization, 14(3), Article 29. https://doi.org/10.1145/3124452.
   Web of Science ®Google Scholar
• Ashouri, A. H., Killian, W., Cavazos, J., Palermo, G., & Silvano, C. (2018, September). A survey on compiler autotuning using machine learning. ACM Computing Surveys, 51(5), Article 96. https://doi.org/10.1145/3197978.
   Web of Science ®Google Scholar
• Ben-Nun, T., Jakobovits, A. S., & Hoefler, T. (2018a). Neural code comprehension: A learnable representation of code semantics. CoRR. http://arxiv.org/abs/1806.07336.
   Google Scholar
• Ben-Nun, T., Jakobovits, A. S., & Hoefler, T. (2018b). Neural code comprehension: A learnable representation of code semantics. In Proceedings of the 32nd international conference on neural information processing systems (pp. 3589–3601). Curran Associates Inc.
   Google Scholar
• Cavazos, J., Fursin, G., Agakov, F., Bonilla, E., O'Boyle, M. F. P., & Temam, O. (2007). Rapidly selecting good compiler optimizations using performance counters. In Proceedings of the international symposium on code generation and optimization (pp. 185–197). IEEE Computer Society. https://doi.org/10.1109/CGO.2007.32.
   Google Scholar
• Cummins, C., Petoumenos, P., Wang, Z., & Leather, H. (2017, October). End-to-end deep learning of optimization heuristics. In Proceedings of parallel architectures and compilation techniques, PACT 2017 (vol. 2017-September, pp. 219–232). Institute of Electrical and Electronics Engineers Inc. doi:10.1109/PACT.2017.24.
   Google Scholar
• Dubach, C., Cavazos, J., Franke, B., Fursin, G., OBoyle, M. F., & Temam, O. (2007). Fast compiler optimisation evaluation using code-feature based performance prediction. In Proceedings of the 4th international conference on computing frontiers (pp. 131–142). Association for Computing Machinery. doi:10.1145/1242531.1242553.
   Google Scholar
• Fortin, F. A., De Rainville, F. M., Gardner, M. A., Parizeau, M., & Gagné, C. (2012, July). DEAP: Evolutionary algorithms made easy. Journal of Machine Learning Research, 13, 2171–2175.
   Web of Science ®Google Scholar
• Fursin, G., Kashnikov, Y., Memon, A. W., Chamski, Z., Temam, O., Namolaru, M., & O'Boyle, M. (2011). Milepost GCC: Machine learning enabled self-tuning compiler. International Journal of Parallel Programming, 39(3), 296–327. https://doi.org/10.1007/s10766-010-0161-2
   Web of Science ®Google Scholar
• Hamming, R. W. (1950). Error detecting and error correcting codes. The Bell System Technical Journal, 29(2), 147–160. https://doi.org/10.1002/bltj.1950.29.issue-2
   Google Scholar
• Jaccard, P. (1912). The distribution of the flora in the alpine zone. 1. New Phytologist, 11(2), 37–50. https://doi.org/10.1111/nph.1912.11.issue-2
   Google Scholar
• Kim, M., Hiroyasu, T., Miki, M., & Watanabe, S. (2004). SPEA2+: Improving the performance of the strength pareto evolutionary algorithm 2 SPEA2+: Improving the performance of the strength pareto evolutionary algorithm 2. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3242, pp. 742–751. https://doi.org/10.1007/978-3-540-30217-9_75.
   Google Scholar
• Kruse, M., & Grosser, T. (2018). DeLICM: Scalar dependence removal at zero memory cost. In Proceedings of the 2018 international symposium on code generation and optimization. https://doi.org/10.1145/3168815.
   Google Scholar
• Kulkarni, P., Hines, S., Hiser, J., Whalley, D., Davidson, J., & Jones, D. (2004). Fast searches for effective optimization phase sequences. In Proceedings of the ACM sigplan 2004 conference on programming language design and implementation (pp. 171–182). Association for Computing Machinery. https://doi.org/10.1145/996841.996863.
   Google Scholar
• Lattner, C., & Adve, V. (2004). LLVM: A compilation framework for lifelong program analysis & transformation. In Proceedings of the international symposium on code generation and optimization: Feedback-directed and runtime optimization (p. 75). IEEE Computer Society.
   Google Scholar
• Park, E., Cavazos, J., & Alvarez, M. A. (2012). Using graph-based program characterization for predictive modeling. In Proceedings of international symposium on code generation and optimization, CGO 2012 (pp. 196–206). https://doi.org/10.1145/2259016.2259042.
   Google Scholar
• Park, E., Kulkarni, S., & Cavazos, J. (2011). An evaluation of different modeling techniques for iterative compilation. In Proceedings of the 14th international conference on compilers, architectures and synthesis for embedded systems (pp. 65–74). Association for Computing Machinery. https://doi.org/10.1145/2038698.2038711.
   Google Scholar
• Poli, R., & Langdon, W. B. (1998). Genetic programming with one-point crossover. In P.K. Chawdhry, R. Roy, & R.K. Pant (Eds.), Soft computing in engineering design and manufacturing (pp. 180–189). Springer.
   Google Scholar
• Tanabe, R., & Ishibuchi, H. (2020, February). A review of evolutionary multimodal multiobjective optimization. Transactions on Evolutionary Computation, 24(1), 193–200. https://doi.org/10.1109/TEVC.4235
   Web of Science ®Google Scholar
• Željko, J., & Šiljak, H. (2011). A new formula for the number of combinations of permutations of multisets. Applied Mathematical Sciences, 5(19), 875–881.
   Google Scholar
• Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength pareto evolutionary algorithm [Tech. Rep.]. Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH) Zurich.
   Google Scholar