Survey on Combinatorial Register Allocation and Instruction Scheduling
release_sldnueyeanaz7dzbsecohvmkii
by
Roberto Castañeda Lozano, Christian Schulte
2014
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.
In text/plain
format
Archived Files and Locations
application/pdf 381.8 kB
file_mk2sn3t7sbbqpnsc5l3f2n6mau
|
arxiv.org (repository) web.archive.org (webarchive) |
1409.7628v1
access all versions, variants, and formats of this works (eg, pre-prints)