All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

An Analysis of Compiled Code Reusability in Dynamic Compilation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10484071" target="_blank" >RIV/00216208:11320/24:10484071 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1145/3689490.3690406" target="_blank" >https://doi.org/10.1145/3689490.3690406</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3689490.3690406" target="_blank" >10.1145/3689490.3690406</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    An Analysis of Compiled Code Reusability in Dynamic Compilation

  • Original language description

    Large applications reliant on dynamic compilation for performance often run in horizontally scaled architectures. When this is combined with frequent deployment or demand-based scaling, hardware capacity is lost to frequent warmup phases due to the need to recompile the code after each start of the virtual machine (VM). Moreover, the individual VMs waste hardware resources by repeating the same compilations.Offloading compilation jobs to a dedicated compilation server can mitigate these problems. Such a server can compile the code in a mode where the compilation result is reusable for multiple VMs. The goal is to save compilation resources, such as CPU and memory, and potentially improve the warmup time of individual VMs.This paper investigates the options to reuse previous compilation results of a high-performance compiler. Rather than reusing machine code, we propose to reuse a pre-optimized intermediate representation (IR). Reusability is achieved by deferring VM-specific optimizations until the IR is compiled to machine code for a concrete VM. In an empirical study using the GraalVM compiler and the HotSpot Java VM, the slowdown of code compiled with deferred optimization ranges between a negligible impact and a 6x slowdown. However, the code still performs significantly better than the code compiled by a lower-tier compiler. Therefore, the presented approach can form the foundation for improving warmup times in certain workloads.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 16th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages

  • ISBN

    979-8-4007-1213-5

  • ISSN

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

    43-53

  • Publisher name

    ACM

  • Place of publication

    USA

  • Event location

    Pasadena, California, United States

  • Event date

    Oct 20, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001344224800005