2018/01/01 by Josef Eisl, David Leopoldseder, Hanspeter Mössenböck · 1 citation
Computer Science · #Parallel Computing and Optimization Techniques #Logic, programming, and type systems #Distributed and Parallel Computing Systems #Register allocation #Compiler #Computer science #Compile time #Parallel computing #Latency (audio) #Task (project management) #TRACE (psycholinguistics) #Execution time #Register (sociolinguistics) #Optimizing compiler #Processor register #Programming language #Operating system
paper · doi:10.1145/3237009.3237010
openalex publication_date 2018/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Register allocation is a mandatory task for almost every compiler and consumes a significant portion of compile time. In a just-in-time compiler, compile time is a particular issue because compilation happens during program execution and contributes to the overall application run time. Parallelization can help here. We developed a theoretical model for parallel register allocation and show that it can be used in practice without a negative impact on the quality of the allocation result. Doing so reduces compilation latency, i.e., the duration until the result of a compilation is available.