Augmenting Compiler Optimisations through Source-to-Source Injection of Runtime Information-aware Transformations

Traditionally, high-performance scientific computing applications have relied on ahead-of-time compilation of statically typed programming languages such as C, C++, and FORTRAN to generate efficient machine code. Ahead-of-time compilers can perform complex dependency analysis to enable optimisations that take advantage of modern processor capabilities, such as vectorisation. HPC system vendors typically provide their own ahead-of-time proprietary compilers that are specifically tuned for their architectures. Alternatively, dynamic compilation can also take advantage of information available only at runtime to improve the quality of compiler analysis. However, they are typically designed to avoid costly optimisations in order to provide the low recompilation overhead needed for general-purpose computing, and are tightly implemented inside specific compiler toolchains, often making them incompatible with vendor proprietary compilers. This thesis explores the suitability of ahead-of-time code injection of dynamic optimisation runtimes that are able to leverage proprietary vendor tuned compilers with aggressive optimisations. To do this, the thesis presents a new compiler benchmarking approach that comprehensively evaluates the benefit of releasing contextual information at compile-time and introduces two source-to-source code injection frameworks for dynamic optimisations. One for C and C++ loops that provide average vectorisation speed-ups of x1.25 for the Intel compiler and x1.47 for the Nvidia compiler in the presented benchmarking suite. And another that leverages the OpenCL runtime compilation model to delay the evaluation of runtime invariants and achieves x1.15 speedup in selected kernels while also improving the portability of the target application.

Publication Details

Journal
University of Liverpool
Published
2025-01-01
DOI
https://doi.org/10.17638/03171199
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Augmenting Compiler Optimisations through Source-to-Source Injection of Runtime Information-aware Transformations

University of Liverpool
Parallel Computing and Optimization Techniques
article

Augmenting Compiler Optimisations through Source-to-Source Injection of Runtime Information-aware Transformations

article en

Abstract

Traditionally, high-performance scientific computing applications have relied on ahead-of-time compilation of statically typed programming languages such as C, C++, and FORTRAN to generate efficient machine code. Ahead-of-time compilers can perform complex dependency analysis to enable optimisations that take advantage of modern processor capabilities, such as vectorisation. HPC system vendors typically provide their own ahead-of-time proprietary compilers that are specifically tuned for their architectures. Alternatively, dynamic compilation can also take advantage of information available only at runtime to improve the quality of compiler analysis. However, they are typically designed to avoid costly optimisations in order to provide the low recompilation overhead needed for general-purpose computing, and are tightly implemented inside specific compiler toolchains, often making them incompatible with vendor proprietary compilers. This thesis explores the suitability of ahead-of-time code injection of dynamic optimisation runtimes that are able to leverage proprietary vendor tuned compilers with aggressive optimisations. To do this, the thesis presents a new compiler benchmarking approach that comprehensively evaluates the benefit of releasing contextual information at compile-time and introduces two source-to-source code injection frameworks for dynamic optimisations. One for C and C++ loops that provide average vectorisation speed-ups of x1.25 for the Intel compiler and x1.47 for the Nvidia compiler in the presented benchmarking suite. And another that leverages the OpenCL runtime compilation model to delay the evaluation of runtime invariants and achieves x1.15 speedup in selected kernels while also improving the portability of the target application.

University of Liverpool
Openalex Percentile: Top 54%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.