EUVIMEDEUVIMED entdecken
Crossref

Combinatorial Register Allocation and Instruction Scheduling

Roberto Castañeda Lozano, Mats Carlsson, Gabriel Hjort Blindell, Christian Schulte

ACM Transactions on Programming Languages and Systems · 30.09.2019 · 41 (3) · 1-53

DOI: 10.1145/3332373 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, online erschienen am 02.07.2019. Verfasst von Roberto Castañeda Lozano und 3 weiteren Autor:innen. Die Arbeit wurde bisher 28-mal zitiert (Crossref) und nennt 100 Literaturangaben. Gefördert von: Ericsson AB and the Swedish Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This article introduces a combinatorial optimization approach to register allocation and instruction scheduling, two central compiler problems. Combinatorial optimization has the potential to solve these problems optimally and to exploit processor-specific features readily. Our approach is the first to leverage this potential in practice : it captures the complete set of program transformations used in state-of-the-art compilers, scales to medium-sized functions of up to 1,000 instructions, and generates executable code. This level of practicality is reached by using constraint programming, a particularly suitable combinatorial optimization technique. Unison, the implementation of our approach, is open source, used in industry, and integrated with the LLVM toolchain. An extensive evaluation confirms that Unison generates better code than LLVM while scaling to medium-sized functions. The evaluation uses systematically selected benchmarks from MediaBench and SPEC CPU2006 and different processor architectures (Hexagon, ARM, MIPS). Mean estimated speedup ranges from 1.1% to 10% and mean code size reduction ranges from 1.3% to 3.8% for the different architectures. A significant part of this improvement is due to the integrated nature of the approach. Executing the generated code on Hexagon confirms that the estimated speedup results in actual speedup. Given a fixed time limit, Unison solves optimally functions of up to 946 instructions, nearly an order of magnitude larger than previous approaches. The results show that our combinatorial approach can be applied in practice to trade compilation time for code quality beyond the usual compiler optimization levels, identify improvement opportunities in heuristic algorithms, and fully exploit processor-specific features.

Förderung

  • Ericsson AB and the Swedish Research Council

Zitieren

APA

Lozano, R. C., Carlsson, M., Blindell, G. H., & Schulte, C. (2019). Combinatorial Register Allocation and Instruction Scheduling. ACM Transactions on Programming Languages and Systems, 41(3), 1-53. https://doi.org/10.1145/3332373

Vancouver

Lozano RC, Carlsson M, Blindell GH, Schulte C. Combinatorial Register Allocation and Instruction Scheduling. ACM Transactions on Programming Languages and Systems. 2019;41(3):1-53. doi:10.1145/3332373

BibTeX
@article{Lozano2019,
  author = {Lozano, Roberto Castañeda and Carlsson, Mats and Blindell, Gabriel Hjort and Schulte, Christian},
  title = {Combinatorial Register Allocation and Instruction Scheduling},
  journal = {ACM Transactions on Programming Languages and Systems},
  year = {2019},
  volume = {41},
  number = {3},
  pages = {1--53},
  doi = {10.1145/3332373}
}
Kostenlos starten →