SODA

Combinatorial Spill Code Optimization and Ultimate Coalescing

Castañeda Lozano, Roberto and Carlsson, Mats and Hjort Blindell, Gabriel and Schulte, Christian (2014) Combinatorial Spill Code Optimization and Ultimate Coalescing. In: Fourteenth ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems, 12-13 Jun 2014. (In Press)

Full text not available from this repository.

Abstract

This paper presents a novel combinatorial model that integrates global register allocation based on ultimate coalescing, spill code optimization, register packing, and multiple register banks with instruction scheduling (including VLIW). The model exploits alternative temporaries that hold the same value as a new concept for ultimate coalescing and spill code optimization. The paper presents Unison as a code generator based on the model and advanced solving techniques using constraint programming. Thorough experiments using MediaBench and a processor (Hexagon) that are typical for embedded systems demonstrate that Unison: is robust and scalable; generates faster code than LLVM (up to 41% with a mean improvement of 7%); possibly generates optimal code (for 29% of the experiments); effortlessly supports different optimization criteria (code size on par with LLVM). Unison is significant as it addresses the same aspects as traditional code generation algorithms, yet is based on a simple integrated model and robustly can generate optimal code.

Item Type:Conference or Workshop Item (Paper)
ID Code:5646
Deposited By:Roberto Castañeda
Deposited On:07 Apr 2014 09:19
Last Modified:07 Apr 2014 09:19

Repository Staff Only: item control page