Access Restriction

Author Castañeda Lozano, Roberto ♦ Hjort Blindell, Gabriel ♦ Schulte, Christian ♦ Carlsson, Mats
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Instruction scheduling ♦ Spill code optimization ♦ Combinatorial optimization ♦ Ultimate coalescing ♦ Register allocation
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.
Description Affiliation: SCALE, School of ICT, KTH Royal Institute of Technology, Stockholm, Sweden (Hjort Blindell, Gabriel; Schulte, Christian) || SCALE, Swedish Institute of Computer Science, Stockholm, Sweden (Castañeda Lozano, Roberto; Carlsson, Mats)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 49
Issue Number 5
Page Count 10
Starting Page 23
Ending Page 32

Open content in new tab

   Open content in new tab
Source: ACM Digital Library