Register allocation (mapping variables to processor registers or memory) and instruction
scheduling (reordering instructions to increase instruction-level parallelism) are essential …

We show that register allocation can be viewed as solving a collection of puzzles. We model
the register file as a puzzle board and the program variables as puzzle pieces; pre-coloring …

Modern microprocessors are equipped with single instruction multiple data (SIMD) or vector
instruction sets which allow compilers to exploit superword level parallelism (SLP), a type of …

This article introduces a combinatorial optimization approach to register allocation and
instruction scheduling, two central compiler problems. Combinatorial optimization has the …

We aim to automate decades of research and experience in register allocation, leveraging
machine learning. We tackle this problem by embedding a multi-agent reinforcement …

General purpose computing using GPUs is becoming increasingly popular, because of
GPU's extremely favorable performance/price ratio. Like standard processors, GPUs also …

Modeling high-level synthesis (HLS) as mixed integer linear programming (MILP) affords the
opportunity to integrate constraints and optimization objectives of hardware design in the …

This paper presents the first implementation of a non-iterative range analysis algorithm in a
production compiler. Discrete range analyses try to discover the intervals of values that may …

The goal of register allocation is to assign the variables of a program to the registers or to
spill them to memory whenever there are no register left. Since memory is much slower than …

Range analysis is a compiler technique that determines statically the lower and upper
values that each integer variable from a target program may assume during this program's …