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

Recent years have seen a surge in the popularity of binary optimisers, such as BOLT, Propeller, Janus and HALO. These tools rely on dynamic profiling information to guide the behavior of optimizations. Although effective, gathering such run-time data presents developers with some inconveniences, from unrepresentative inputs to the need to accommodate software modifications. In this paper, we revisit the static profiling technique proposed by Calder et al., in the nineties, and adapt it to binary optimizers. We show that a few modifications in that original proposal, consisting of a new selection of program features and of a regression model, is sufficient to provide some of the gains obtained using real profile data in the task of basic block placement using BOLT. We have implemented said static profiler in the BOLT binary optimizer. Experiments reveal that the static version of BOLT yields code that is almost 8.0% faster than the executables produced by clang -O3 on the same setting.

Angélica Moreira is a late 2nd year PhD student in the Computer Science Department at Federal University of Minas Gerais (UFMG). She is a member of the Compilers Laboratory (LAC), where she is advised by Professor Fernando Magno Quintão Pereira. She holds an M.Sc degree in Computer Science from the Federal University of Ouro Preto (UFOP) and a B.Sc degree in Computer Science from the Pontifical Catholic University of Minas Gerais (PUC Minas).

Angélica’s research interest lies in pursuing the design and implementation of techniques that reduce program binary size and make them run faster on heterogeneous architectures. Her research focuses on combining machine learning and compilation techniques to achieve her goal. Her dream is to contribute to a better world through the development of science and technology.

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