SODA

Survey on Combinatorial Register Allocation and Instruction Scheduling

Castañeda Lozano, Roberto and Schulte, Christian (2014) Survey on Combinatorial Register Allocation and Instruction Scheduling. arXiv:1409.7628 [cs.PL] .

Full text not available from this repository.

Official URL: http://arxiv.org/abs/1409.7628

Abstract

Register allocation and instruction scheduling are two central compiler back-end problems that are critical for quality. In the last two decades, combinatorial optimization has emerged as an alternative approach to traditional, heuristic algorithms for these problems. Combinatorial approaches are generally slower but more flexible than their heuristic counterparts and have the potential to generate optimal code. This paper surveys existing literature on combinatorial register allocation and instruction scheduling. The survey covers approaches that solve each problem in isolation as well as approaches that integrate both problems. The latter have the potential to generate code that is globally optimal by capturing the trade-off between conflicting register allocation and instruction scheduling decisions.

Item Type:Article
ID Code:5755
Deposited By:Roberto Castañeda
Deposited On:18 Nov 2014 11:21
Last Modified:18 Nov 2014 11:21

Repository Staff Only: item control page