CGO 2021
Sat 27 February - Wed 3 March 2021
Tue 2 Mar 2021 13:10 - 13:20 - CGO Student Research Competition

Traditional register allocation requires building an interference graph for the entire function or maintaining and updating conflict data incrementally as live ranges are assigned to physical registers. As such, these approaches introduce significant overhead and are unsuitable for JIT compilation.

We propose an SSA-based region-based allocator for JIT compilation. Our allocator breaks a program into single-entry single-exit regions, constructs a small interference graph per region, and assigns colors for each region, guided by SEO ordering. Compared to GCC 10’s allocator, a region-based allocator guided by register pressure, and Clang 10’s allocator, a global priority-based range allocator, our allocator is 5x and 1.75x faster, while maintaining comparable runtime performance (between 0.9x and 1.05x faster).

Tue 2 Mar

Displayed time zone: Eastern Time (US & Canada) change

12:30 - 14:30
CGO Student Research CompetitionMain Conference / Student Research Competition
12:30
10m
Talk
A New Memory Layout for Self-Rebalancing Trees
Student Research Competition
Paul Iannetta ENS Lyon
12:40
10m
Talk
Automatic Inspection of Program State for Debugging and Verification Purposes
Student Research Competition
José Wesley de Souza Magalhães Federal University of Minas Gerais
12:50
10m
Talk
Compiler Framework for Low Overhead Fork-Join Parallelism
Student Research Competition
13:00
10m
Talk
Data vs. Instructions: Runtime Code Generation for Convolutions
Student Research Competition
Malith Jayaweera Northeastern University
13:10
10m
Talk
Fast Structural Register Allocation
Student Research Competition
William Zhang Carnegie Mellon University, Pranav Kumar Carnegie Mellon University
13:20
10m
Talk
Fine Grained Control of Program Transformations via Strategic Rewriting in MLIR
Student Research Competition
Martin Lücke University of Edinburgh
13:30
10m
Talk
Towards an Exploration Tool for Program Optimization Using Heuristic Search Algorithms
Student Research Competition
Johannes Lenfers University of Münster
13:40
10m
Talk
When Binary Optimization Meets Static Profiling
Student Research Competition
Angelica Aparecida Moreira Universidade Federal de Minas Gerais