Zur Seitenansicht
 

Titelaufnahme

Titel
Trace Register Allocation
AutorInnenEisl, Josef
Erschienen in
SPLASH Companion 2015 Companion Proceedings of the 2015 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity, 2015, S. 21-23
Erschienen2015
SpracheEnglisch
DokumenttypAufsatz in einem Sammelwerk
Schlagwörter (DE)register allocation / just-in-time compilation / linear scan / trace compilation / virtual machines
Schlagwörter (EN)register allocation / just-in-time compilation / linear scan / trace compilation / virtual machines
ISBN9781450337229
URNurn:nbn:at:at-ubl:3-225 Persistent Identifier (URN)
DOI10.1145/2814189.2814199 
Zugriffsbeschränkung
 Das Werk ist gemäß den "Hinweisen für BenützerInnen" verfügbar
Dateien
Trace Register Allocation [0.18 mb]
Links
Nachweis
Klassifikation
Zusammenfassung (Englisch)

This paper proposes the idea of Trace Register Allocation, a register allocation approach that is tailored for just-in-time (JIT) compilation in the context of virtual machines with run-time feedback. The basic idea is to offload costly operations such as spilling and splitting to less frequently executed branches and to focus on efficient registers allocation for the hot parts of a program. This is done by performing register allocation on traces instead of on the program as a whole. We believe that the basic approach is compatible to Linear Scan, the predominant register allocation algorithm for just-in-time compilation, in both code quality and allocation time, while our design leads to a simpler and more extensible solution. This extensibility allows us to add further enhancements in order to optimize the allocation based on the run-time profile of the application and thus to outperform current Linear Scan implementations.

Statistik
Das PDF-Dokument wurde 20 mal heruntergeladen.