Name
Abstract | ||
|---|---|---|
Collecting hot paths is important for restructuring and optimizing the target program effectively. It is, however, challenging for Just-In-Time (JIT) compilers, which must collect path profiles on the fly at runtime. In this paper, we propose an efficient online path profiling technique, called structural path profiling (SPP), suitable for JIT compilers. The key idea is to partition the target method into a hierarchy of the nested graphs based on the loop structure, and then to profile each graph independently. With SPP, we can collect accurate path profiles efficiently with low overhead. The experimental results show that our technique can collect path profiles with an accuracy of around 90% compared to the offline complete path profiles, while it incurs only 2-3% overhead on average in the active profiling phase. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/PACT.2003.1238011 | IEEE PACT |
Keywords | Field | DocType |
Java,data flow graphs,optimising compilers,program control structures,Java just-in-time compiler,loop structure,nested graph,offline complete path profile,online path profiling framework,structural path profiling | Instructions per cycle,Graph,Profiling (computer programming),Computer science,Parallel computing,On the fly,Real-time computing,Compiler,Instruction distribution,Hierarchy,Java | Conference |
ISSN | ISBN | Citations |
1089-795X | 0-7695-2021-9 | 10 |
PageRank | References | Authors |
0.87 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toshiaki Yasue | 1 | 270 | 17.44 |
| Toshio Suganuma | 2 | 404 | 27.10 |
| Hideaki Komatsu | 3 | 410 | 34.00 |
| Toshio Nakatani | 4 | 741 | 56.80 |