Eun Jung Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Eun Jung Kim has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Abdullah Muzahid
Texas A&M University, College Station, USA
3 shared publications - Chia-Che Tsai
Texas A&M University
2 shared publications - Sungkeun Kim
Samsung Research, Seoul, Republic of Korea
2 shared publications - Farabi Mahmud
Texas A&M University, USA
1 shared publication - Harpreet Singh Chawla
Texas A&M University, USA
1 shared publication - Jaewoo Lee
Texas A&M University, College Station, USA
1 shared publication
Latest Publications
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1640-1655
SuperMesh: Energy-Efficient Collective Communications for Accelerators
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1640-1655
Open AccessSuperMesh: Energy-Efficient Collective Communications for Accelerators
- Open Access
- 25 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Enhancing Program Analysis with Deterministic Distinguishable Calling Context
Calling context is crucial for improving the precision of program analyses in various use cases (clients), such as profiling, debugging, optimization, and security checking. Often the calling context is encoded using a numerical value. We have observed that many clients benefit not only from a deterministic but also globally distinguishable value across runs to simplify bookkeeping and guarantee complete uniqueness. However, existing work only guarantees determinism, not global distinguishability. Clients need to develop auxiliary helpers, which incurs considerable overhead to distinguish encoded values among all calling contexts. In this paper, we propose Deterministic Distinguishable Calling Context Encoding () that can enable both properties of calling context encoding natively. The key idea of is leveraging the static call graph and encoding each calling context as the running call path count. Thereby, a mapping is established statically and can be readily used by the clients. Our experiments with two client tools show that has a comparable overhead compared to two state-of-the-art encoding schemes, PCCE and PCC, and further avoids the expensive overheads of collision detection, up to 2.1× and 50%, for Splash-3 and SPEC CPU 2017, respectively.
- 25 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessEnhancing Program Analysis with Deterministic Distinguishable Calling Context
Calling context is crucial for improving the precision of program analyses in various use cases (clients), such as profiling, debugging, optimization, and security checking. Often the calling context is encoded using a numerical value. We have observed that many clients benefit not only from a deterministic but also globally distinguishable value across runs to simplify bookkeeping and guarantee complete uniqueness. However, existing work only guarantees determinism, not global distinguishability. Clients need to develop auxiliary helpers, which incurs considerable overhead to distinguish encoded values among all calling contexts. In this paper, we propose Deterministic Distinguishable Calling Context Encoding () that can enable both properties of calling context encoding natively. The key idea of is leveraging the static call graph and encoding each calling context as the running call path count. Thereby, a mapping is established statically and can be readily used by the clients. Our experiments with two client tools show that has a comparable overhead compared to two state-of-the-art encoding schemes, PCCE and PCC, and further avoids the expensive overheads of collision detection, up to 2.1× and 50%, for Splash-3 and SPEC CPU 2017, respectively.
- Open Access
- 4 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 691-703
Attack of the Knights:Non Uniform Cache Side Channel Attack
For a distributed last-level cache (LLC) in a large multicore chip, the access time to one LLC bank can significantly differ from that to another due to the difference in physical distance. In this paper, we successfully demonstrate a new distance-based side-channel attack by timing the AES decryption operation and extracting part of an AES secret key on an Intel Knights Landing CPU. We introduce several techniques to overcome the challenges of the attack, including the use of multiple attack threads to ensure LLC hits, to detect vulnerable memory locations, and to obtain fine-grained timing of the victim operations. While operating as a covert channel, this attack can reach a bandwidth of 205 KBPS with an error rate of only 0.02%. We also observed that the side-channel attack can extract 4 bytes of an AES key with 100% accuracy with only 4000 trial rounds of encryption.
- 4 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 691-703
Open AccessAttack of the Knights:Non Uniform Cache Side Channel Attack
For a distributed last-level cache (LLC) in a large multicore chip, the access time to one LLC bank can significantly differ from that to another due to the difference in physical distance. In this paper, we successfully demonstrate a new distance-based side-channel attack by timing the AES decryption operation and extracting part of an AES secret key on an Intel Knights Landing CPU. We introduce several techniques to overcome the challenges of the attack, including the use of multiple attack threads to ensure LLC hits, to detect vulnerable memory locations, and to obtain fine-grained timing of the victim operations. While operating as a covert channel, this attack can reach a bandwidth of 205 KBPS with an error rate of only 0.02%. We also observed that the side-channel attack can extract 4 bytes of an AES key with 100% accuracy with only 4000 trial rounds of encryption.