EDBT 2026 Demo / reviewers in the wild / expert
SungKook Kim
dblp:207/7231
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 50% Runtime systems and virtual machines · 25% Software maintenance and evolution · 25% | |
| Network and information security
1 paper |
Web and mobile security · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › compiler construction
ahead-of-time compilation |
0.4 | 1 | 2019 | Reusing the Optimized Code for JavaScript Ahead-of-Time Compilation · ACM Trans. Archit. Code Optim. 2019 |
Software maintenance and evolution
code reuse |
0.4 | 1 | 2019 | Reusing the Optimized Code for JavaScript Ahead-of-Time Compilation · ACM Trans. Archit. Code Optim. 2019 |
Runtime systems and virtual machines › virtual machine implementation
javascript engine |
0.4 | 1 | 2019 | Reusing the Optimized Code for JavaScript Ahead-of-Time Compilation · ACM Trans. Archit. Code Optim. 2019 |
Compilers and program optimization › dynamic optimization
profile-guided optimization |
0.4 | 1 | 2019 | Reusing the Optimized Code for JavaScript Ahead-of-Time Compilation · ACM Trans. Archit. Code Optim. 2019 |
Methods — techniques the papers use, named apart from their topics
profile-based optimization · 0.8ahead-of-time compilation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Reusing the Optimized Code for JavaScript Ahead-of-Time CompilationabstractAs web pages and web apps increasingly include heavy JavaScript code, JavaScript performance has been a critical issue. Modern JavaScript engines achieve a remarkable performance by employing tiered-execution architecture based on interpreter, baseline just-in-time compiler (JITC), and optimizing JITC. Unfortunately, they suffer from a substantial compilation overhead, which can take more than 50% of the whole running time. A simple idea to reduce the compilation overhead is ahead-of-time compilation (AOTC), which reuses the code generated in the previous run. In fact, existing studies that reuse the bytecode generated by the interpreter or the machine code generated by the baseline JITC have shown tangible performance benefits [12, 31, 41]. However, there has been no study to reuse the machine code generated by the optimizing JITC, which heavily uses profile-based optimizations, thus not easily reusable. We propose a novel AOTC that can reuse the optimized machine code for high-performance JavaScript engines. Unlike previous AOTCs, we need to resolve a few challenging issues related to reusing profile-based optimized code and relocating dynamic addresses. Our AOTC improves the performance of a commercial JavaScript engine by 6.36 times (max) and 1.99 times (average) for Octane benchmarks, by reducing the compilation overhead and by running the optimized code from the first invocation of functions. It also improves the loading time of six web apps by 1.28 times, on average. Hyukwoo Park, SungKook Kim, Jung-Geun Park, Soo-Mook Moon |
ACM Trans. Archit. Code Optim. | 2 |
| 2017 | Advanced ahead-of-time compilation for Javascript engine: work-in-progressabstractJavaScript1 is heavily used in the web, yet it is much slower than other languages. To improve the JavaScript performance, ahead-of-time compilation (AOTC) has been used, either to reuse the bytecode or the machine code generated by the baseline just-in-time compilation (JITC). JavaScript engines today employ high-performance optimizing JITC. So, we propose an AOTC that reuses the code generated by the optimizing JITC. It is more challenging than existing AOTCs since we need to handle more complex address relocation issues. Our preliminary evaluation shows that the proposed AOTC is promising, though. Hyukwoo Park, SungKook Kim, Soo-Mook Moon |
CASES | 2 |