SPLASH 2021
Sun 17 - Fri 22 October 2021 Chicago, Illinois, United States
Fri 22 Oct 2021 11:05 - 11:20 at Zurich B - Optimization Chair(s): Fredrik Kjolstad
Fri 22 Oct 2021 19:05 - 19:20 at Zurich B - Optimization - mirror Chair(s): Tony Hosking

Over the past few years, there has been a surge in the popularity of binary optimizers such as BOLT, Propeller, Janus and HALO. These tools use dynamic profiling information to make optimization decisions. Although effective, gathering runtime data presents developers with inconveniences such as unrepresentative inputs, the need to accommodate software modifications, and longer build times. In this paper, we revisit the static profiling technique proposed by Calder {\em et al.} in the late 90's, and investigate its application to drive binary optimizations, in the context of the BOLT binary optimizer, as a replacement for dynamic profiling. A few core modifications to Calder et al.'s original proposal, consisting of new program features and a new regression model, are sufficient to enable some of the gains obtained through runtime profiling. An evaluation of BOLT powered by our static profiler on four large benchmarks (clang, GCC, MySQL and PostgreSQL) yields binaries that are 5.47,% faster than the executables produced by clang -O3.

Fri 22 Oct

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

10:50 - 12:10
OptimizationOOPSLA at Zurich B +8h
Chair(s): Fredrik Kjolstad Stanford University
10:50
15m
Talk
Copy-and-Patch Compilation: A Fast Compilation Algorithm for High-Level Languages and BytecodeDistinguished PaperVirtual
OOPSLA
Haoran Xu Stanford University, Fredrik Kjolstad Stanford University
DOI Pre-print
11:05
15m
Talk
VESPA: Static Profiling for Binary OptimizationVirtual
OOPSLA
Angelica Moreira Federal University of Minas Gerais, Guilherme Ottoni Facebook, Fernando Magno Quintão Pereira Federal University of Minas Gerais
DOI
11:20
15m
Talk
A Derivative-Based Parser Generator for Visibly Pushdown GrammarsIn-Person
OOPSLA
Xiaodong Jia Pennsylvania State University, Ashish Kumar Pennsylvania State University, Gang (Gary) Tan Pennsylvania State University
DOI
11:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

18:50 - 20:10
Optimization - mirrorOOPSLA at Zurich B
Chair(s): Tony Hosking Australian National University
18:50
15m
Talk
Copy-and-Patch Compilation: A Fast Compilation Algorithm for High-Level Languages and BytecodeDistinguished PaperVirtual
OOPSLA
Haoran Xu Stanford University, Fredrik Kjolstad Stanford University
DOI Pre-print
19:05
15m
Talk
VESPA: Static Profiling for Binary OptimizationVirtual
OOPSLA
Angelica Moreira Federal University of Minas Gerais, Guilherme Ottoni Facebook, Fernando Magno Quintão Pereira Federal University of Minas Gerais
DOI
19:20
15m
Talk
A Derivative-Based Parser Generator for Visibly Pushdown GrammarsIn-Person
OOPSLA
Xiaodong Jia Pennsylvania State University, Ashish Kumar Pennsylvania State University, Gang (Gary) Tan Pennsylvania State University
DOI
19:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA