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”

Reusing Highly Optimized IR 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%2F25%3A10500299" target="_blank" >RIV/00216208:11320/25:10500299 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.4230/LIPIcs.ECOOP.2025.25" target="_blank" >https://doi.org/10.4230/LIPIcs.ECOOP.2025.25</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPIcs.ECOOP.2025.25" target="_blank" >10.4230/LIPIcs.ECOOP.2025.25</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Reusing Highly Optimized IR in Dynamic Compilation

  • Original language description

    Virtual machines (VMs) with dynamic compilers typically specialize compiled code to the state of the running VM instance and thus cannot reuse the code between multiple runs of the same application. The JIT compiler must recompile the same methods for each run of the application separately, which can prolong the application’s warmup time. We propose a technique to reduce compilation time by reusing a highly optimized intermediate representation (IR). We achieve this by tracing compiler-interface calls during compilation. The validity of the specializations in the IR is verified during a replay stage, and the replay also facilitates the relocation of runtime object references. The IR is stored on a compilation server, which can compile it to machine code and provide the code to local or remote VM instances. We implemented a compilation server with IR caching for GraalVM, a high-performance production-grade Java Virtual Machine (JVM). We present an evaluation based on four industry-standard benchmark suites. In each suite, our approach reduces compilation time by 23.6% to 36.8% and warmup time by 13.1% to 21.2% on average while preserving peak application performance.

  • 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

    2025

  • 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

    Leibniz International Proceedings in Informatics Lipics

  • ISBN

    978-3-95977-373-7

  • ISSN

    1868-8969

  • e-ISSN

  • Number of pages

    25

  • Pages from-to

    25.1-25.25

  • Publisher name

    Schloss Dagstuhl, Leibniz-Zentrum für Informatik

  • Place of publication

    Wadern

  • Event location

    Bergen, Norway

  • Event date

    Jun 30, 2025

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    001592262200025