Enhancing Performance Through Control-Flow Unmerging and Loop Unrolling on GPUs

Compilers use a wide range of advanced optimizations to improve the quality of the machine code they generate. In most cases, compiler optimizations rely on precise analyses to be able to perform the optimizations. However, whenever a control-flow merge is performed information is lost as it is not...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings / International Symposium on Code Generation and Optimization S. 106 - 118
Hauptverfasser: Murtovi, Alnis, Georgakoudis, Giorgis, Parasyris, Konstantinos, Liao, Chunhua, Laguna, Ignacio, Steffen, Bernhard
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 02.03.2024
Schlagworte:
Benchmark testing
code duplication
Codes
compiler
Costs
GPU
Graphics processing units
LLVM
Optimization
Predictive models
Prototypes
ISSN:2643-2838
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Compilers use a wide range of advanced optimizations to improve the quality of the machine code they generate. In most cases, compiler optimizations rely on precise analyses to be able to perform the optimizations. However, whenever a control-flow merge is performed information is lost as it is not possible to precisely reason about the program anymore. One existing solution to this issue is code duplication, which involves duplicating instructions from merge blocks to their predecessors. This paper introduces a novel and more aggressive approach to code duplication, grounded in loop unrolling and control-flow unmerging that enables subsequent optimizations that cannot be enabled by applying only one of these transformations. We implemented our approach inside LLVM, and evaluated its performance on a collection of GPU benchmarks in CUDA. Our results demonstrate that, even when faced with branch divergence, which complicates code duplication across multiple branches and increases the associated cost, our optimization technique achieves performance improvements of up to 81%.
ISSN:2643-2838
DOI:10.1109/CGO57630.2024.10444819