Demo Data from EDBT 2026 / reviewers in the wild / expert
Jun-Yeon Lee
dblp:58/491
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-6147-0588ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 50% Hardware reliability and fault tolerance · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance › proactive fault tolerance
failure prediction |
0.9 | 1 | 2025 | FALL: Prior Failure Detection in Large Scale System Based on Language Model · IEEE Trans. Dependable Secur. Comput. 2025 |
Hardware reliability and fault tolerance
system reliability |
0.9 | 1 | 2025 | FALL: Prior Failure Detection in Large Scale System Based on Language Model · IEEE Trans. Dependable Secur. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
sharpening · 0.9language model · 0.9anomaly detection · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | FALL: Prior Failure Detection in Large Scale System Based on Language ModelabstractAs the scale of high-performance computing systems (HPC) continues to expand, the frequency of failures within the system also increases. The follow-up steps in the event of a failure are necessary because efficient prevention measures are absent. These actions, however, result in decreased operating efficiency as the system normalizes. To solve this problem, recent research has utilized deep learning to predict failures in advance by examining log messages. One common method uses log ID extracted from log messages as input data. However, these methods could lead to information loss in log messages and may not accurately capture log message properties. In this study, we propose the prior failure detection in large-scale systems using language models (FALL) that reflects the properties of log messages. The FALL uses log messages as text data and only uses normal data for training. The FALL makes use of sharpening, which concentrates on the minimal lexical change between normal and abnormal log messages. In addition, by leveraging the characteristics of log messages with limited vocabularies, the FALL utilizes only some tokens for anomaly detection. The experiments' results from log data from real industry-based HPC systems show that the FALL achieves superior performance in early failure detection. Jaeyoon Jeong, Insung Baek, Byungwoo Bang, Jun-Yeon Lee, Uiseok Song, Seoung Bum Kim |
IEEE Trans. Dependable Secur. Comput. | 4 |
| 2022 | CacheRewinder: Revoking Speculative Cache Updates Exploiting Write-Back BufferabstractTransient execution attacks are critical security threats since those attacks exploit speculative execution which is an essential architectural solution that can improve the performance of out-of-order processors significantly. Such attacks change cache state by accessing secret data during speculative executions, then the attackers leak the secret information exploiting cache timing side-channels. Even though software patches against transient execution attacks have been proposed, the software solutions significantly slow down the performance of a system. In this paper, we propose CacheRewinder, an efficient hardware-based defense mechanism against transient execution attacks. CacheRewinder prevents leakage of secret information by revoking the cache updates done by speculative executions. To restore the cache state efficiently, CacheRewinder exploits the underutilized write-back buffer space as the temporary storage for victimized cache blocks evicted during speculative executions. Hence, when speculation fails CacheRewinder can quickly restore the cache state using the victim blocks held in the write-back buffer. Our evaluation exhibits CacheRewinder can effectively defend against transient execution attacks. The performance overhead by CacheRewinder is only 0.6%, which is negligible compared to the unprotected baseline processor. CacheRewinder also requires minimal storage cost since it exploits unused write-back buffer entries as storage for evicted cache blocks. Jun-Yeon Lee, Taeweon Suh, Gunjae Koo |
DATE | 2 |