Detecting Hot Code from Partially Context-Sensitive Profiles

In order to achieve the peek program performance, compilers employ numerous optimizations. Some of these optimizations, although highly effective, come with the high price in terms of compilation time, and the compiled code size. This is why it is beneficial to apply optimizations on only selected portions of the most frequently executed code – hot code. In JIT-compiled programs, information about the frequency of code execution is available during the compilation, however, AOT compilers must compensate through the profiling data collected from the previous program runs. In this paper, we use partially context-sensitive profiles, for efficient profile collection and managing, to identify and reconstruct significant hot-code fragments. We show that, with the proper identification of the hot code, significantly better program performance can be achieved with reasonable cost.

Authors

Institutions

Publication Details

Published
2024-11-26
DOI
https://doi.org/10.1109/telfor63250.2024.10819162
Primary Topic
Web Data Mining and Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Detecting Hot Code from Partially Context-Sensitive Profiles

Aleksandar Prokopec, Maja Vukasović
Web Data Mining and Analysis
article

Detecting Hot Code from Partially Context-Sensitive Profiles

Aleksandar Prokopec, Maja Vukasović
article en

Abstract

In order to achieve the peek program performance, compilers employ numerous optimizations. Some of these optimizations, although highly effective, come with the high price in terms of compilation time, and the compiled code size. This is why it is beneficial to apply optimizations on only selected portions of the most frequently executed code – hot code. In JIT-compiled programs, information about the frequency of code execution is available during the compilation, however, AOT compilers must compensate through the profiling data collected from the previous program runs. In this paper, we use partially context-sensitive profiles, for efficient profile collection and managing, to identify and reconstruct significant hot-code fragments. We show that, with the proper identification of the hot code, significantly better program performance can be achieved with reasonable cost.

University of Belgrade (RS)
Reduced inequalities
Openalex Percentile: Top 61%
Web Data Mining and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.