Sungkeun Kim

Sungkeun Kim

Auto-generated profile, based on publicly available information

Sungkeun Kim

Samsung Research, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 October 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
PMPritam Majumder
Pritam Majumder
SKSungkeun Kim
Sungkeun Kim
JHJiayi Huang
Jiayi Huang
KYKi Hwan Yum
Ki Hwan Yum
EKEun Jung Kim
Eun Jung Kim
Ever increasing performance demand and shrinking in the transistor size together result in complex and dense packing in large chips. That motivates designers to opt for many small specialized hardware modules in a chip to extract maximum performance benefits with relatively lower complexity and cost. These altogether opens up new directions for heterogeneous modular System-on-Chip(SoC) research, where a large system is built by assembling small independently designed chiplets(small chips). We focus on the communication aspect of such SoCs, especially newly observed deadlock among chiplets. Even though deadlock is a classic problem in networks and many solutions are available, the modular SoC design demands customized solutions that preservesthe design flexibility for chiplet designers. We propose Remote Control(RC), a simple routing oblivious deadlock avoidance scheme based on selective injection-control mechanism. Along with guarantee on deadlock freedom, RC aims to provide a methodology to make each independently designed chiplet seamlessly integrate in any modular SoCs. We achieve up to 56.34% throughput and15.49% zero load latency improvements on synthetic traffic and up to 20% on real workloads taken from vast range of benchmark suites, over the state-of-the-art turn restriction based technique applied in modular SoC domain.

3 March 2021 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JHJiayi Huang
Jiayi Huang
PMPritam Majumder
Pritam Majumder
SKSungkeun Kim
Sungkeun Kim
TFTroy Fulton
Troy Fulton
RPRamprakash Reddy Puli
Ramprakash Reddy Puli
EKEun Jung Kim
Eun Jung Kim
The data explosion and faster data analysis demand have spawned emerging applications that operate over myriads of data and exhibit large memory footprints with low data reuse rate. Such characteristics lead to enormous data movements across the memory hierarchy and pose significant pressure on modern communication fabrics and memory subsystems. To mitigate the worsening gap between high processor computation density and deficient memory bandwidth, memory networks and near-data processing techniques are proposed to keep improving system performance and energy efficiency. In this work, we propose Active-Routing, an in-network near-data processing architecture for data-flow execution, which enables computation en-route by exploiting patterns of aggregation over intermediate results. The proposed architecture leverages the massive memory cube- and vault-level parallelism as well as network concurrency to optimize the aggregation operations along a dynamically built Active-Routing Tree. It also introduces page granular computation offloading to amortize the offloading overhead and improve the throughput. Compared to the state-of-the-art processing-in-memory architecture, the evaluations show that the baseline Active-Routing can achieve up to 7 speedup with an average of 60% performance improvement, and reduce the energy-delay product by 80% across various benchmarks. Further optimizations with vault-level parallelism and page granular offloading can achieve an extra order of magnitude improvement.

8 June 2022 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
SKSungkeun Kim
Sungkeun Kim
FMFarabi Mahmud
Farabi Mahmud
JHJiayi Huang
Jiayi Huang
PMPritam Majumder
Pritam Majumder
CTChia-Che Tsai
Chia-Che Tsai
EKEun Jung Kim
Eun Jung Kim
Memory safety invariants extracted from a program can help defend and detect against both software and hardware memory violations. For instance, by allowing only specific instructions to access certain memory locations, system can detect out-of-bound or illegal pointer dereferences that lead to correctness and security issues. In this paper, we propose CPU abstractions, called, to specify and check program invariants to provide defense mechanism against both software and hardware memory violations at runtime. ensures that the invariants must be satisfied at every memory accesses. We present a fast invariant address translation and retrieval scheme using a specialized cache. It stores and checks invariants related to global, stack and heap objects. The invariant checks can be performed synchronously or asynchronously. uses synchronous checking for high security-critical programs, while others are protected by asynchronous checking. A fast exception is proposed to alert any violations as soon as possible in order to close the gap for transient attacks. Our evaluation shows that can detect both software and hardware, spatial and temporal memory violations. incurs 53% overhead when checking synchronously, or 15% overhead when checking asynchronously.

4 December 2023
Verified
Conference Paper
Open access
FMFarabi Mahmud
Farabi Mahmud
SKSungkeun Kim
Sungkeun Kim
HCHarpreet Singh Chawla
Harpreet Singh Chawla
EKEun Jung Kim
Eun Jung Kim
CTChia-Che Tsai
Chia-Che Tsai
AMAbdullah Muzahid
Abdullah Muzahid
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.

25 February 2025
Verified
Conference Paper
Open access
SKSungkeun Kim
Sungkeun Kim
KNKhanh Nguyen
Khanh Nguyen
CTChia-Che Tsai
Chia-Che Tsai
JLJaewoo Lee
Jaewoo Lee
AMAbdullah Muzahid
Abdullah Muzahid
EKEun Jung Kim
Eun Jung Kim
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.