Go to page
 

Bibliographic Metadata

Title
Implementation of a Graph Coloring Register Allocator for the Graal Compiler / submitted by Schröckeneder Florian
AuthorSchröckeneder, Florian
CensorMössenböck, Hanspeter
PublishedLinz, 2017
DescriptionV, 54 Blätter : Illustrationen
Institutional NoteUniversität Linz, Masterarbeit, 2017
LanguageEnglish
Document typeMaster Thesis
Keywords (GND)Register <Informatik> / Graphfärbung / Programmcode / Übersetzer <Informatik>
URNurn:nbn:at:at-ubl:1-17390 Persistent Identifier (URN)
Restriction-Information
 The work is publicly available
Files
Implementation of a Graph Coloring Register Allocator for the Graal Compiler [1.7 mb]
Links
Reference
Classification
Abstract (English)

Register allocation is crucial for the performance of modern compilers. In this thesis we implemented a graph coloring register allocator and compared it to a linear scan approach. In cases where code quality is important our approach has potentially an advantage. In cases where compile time is more important the other approach has the advantage. In this thesis we first explain the two register allocation approaches and take a look at where register allocation fits into the compilation process. Then we look at our version of register allocation and show an complete example of how it works. For the comparison of the two approaches we use two benchmark suites. From the results of this comparison we learned that linear scan can perform better if it is highly optimized and graph coloring is not. In order to use the full advantages of graph coloring there are also a lot of further optimizations needed. From what we have learned creating this thesis, it is beneficial to have the possibility to choose between different kinds of register allocation. Depending on the situation, a better code performance can be more important than a shorter compile time. But to really make a difference in practice, a lot optimization effort has to be put into an implementation.

Stats
The PDF-Document has been downloaded 25 times.