Shinnung Jeong

Shinnung Jeong

Auto-generated profile, based on publicly available information

Shinnung Jeong

Yonsei University, South 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
16 October 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BKBongjun Kim
Bongjun Kim
SHSeonyeong Heo
Seonyeong Heo
JLJaeho Lee
Jaeho Lee
SJShinnung Jeong
Shinnung Jeong
YLYongwoo Lee
Yongwoo Lee
HKHanjun Kim
Hanjun Kim
Serverless computing like Function-as-a-Service (FaaS) is attractive for IoT service providers, liberating the providers from server maintenance. Since a data processing function is executed on the cloud instead of a dedicated server in the FaaS platform, the service users send their private data in their IoT devices to the third-party cloud, taking privacy leakage risks. Homomorphic encryption can preserve the privacy by enabling encrypted data processing on the cloud, but using homomorphic encryption for every data item incurs large computation and communication overheads. This work proposes SelectiveCrypt, a compiler-assisted semantic-aware encryption scheme that applies different cryptographic primitives depending on the operations on each data item. SelectiveCrypt homomorphically encrypts data items if arithmetic operations are applied to the data, while SelectiveCrypt encrypts data items with a symmetric key if the data are stored in the cloud without any arithmetic operation. The SelectiveCrypt framework consists of a compiler and its runtime system. The SelectiveCrypt compiler statically analyzes the data processing, determines an appropriate cryptographic primitive for each data item, and automatically transforms arithmetic operations into the homomorphic computation. The SelectiveCrypt runtime encrypts and decrypts the data items according to the static analysis result. This work evaluates the prototype SelectiveCrypt framework with five benchmarks that reflect real-world IoT scenarios. The evaluation results show that the SelectiveCrypt framework successfully reduces response time and communication overhead by 1.59 times and 9.61 times respectively compared with a homomorphic encryption scheme.

12 August 2024
Verified
Conference Paper
Open access
SJShinnung Jeong
Shinnung Jeong
SCSungjun Cho
Sungjun Cho
YLYongwoo Lee
Yongwoo Lee
HPHyunjun Park
Hyunjun Park
SHSeonyeong Heo
Seonyeong Heo
HKHanjun Kim
Hanjun Kim
Thanks to its massive parallel resources, a GPU is a promising platform for graph processing. However, the increasing size and skewed characteristics of the real-world graphs limit the performance improvement. Prior work proposes locality-enhancing graph transformations and load balancing techniques to improve performance, but they still suffer from excessive memory usage and inefficient parallel resource utilization because their graph representations are not fully tailored for a GPU. To efficiently utilize the GPU resource with less memory, this work proposes a new graph representation, called CR2. First, CR2 extracts community-aware subgraphs from a graph by clustering densely-connected vertices together. For the community-aware subgraphs, CR2 decomposes a vertex ID into a cluster ID and a local ID and represents each vertex only with the local ID, thus reducing memory usage. Second, CR2 additionally partitions the graph into multiple degree-ordered subgraphs in which all the vertices have the same regularized number of edges, thus making parallel workload balanced across GPU warps. This work evaluates CR2 with four commonly used graph algorithms and shows that CR2 achieves 1.53 times performance speedup while using 32.1% less memory on the geomean average compared to the state-of-the-art techniques.

28 January 2026
Verified
Conference Paper
Open access
SJShinnung Jeong
Shinnung Jeong
CAChihyo Ahn
Chihyo Ahn
HPHuanzhi Pu
Huanzhi Pu
JZJisheng Zhao
Jisheng Zhao
HKHyesoon Kim
Hyesoon Kim
BTBlaise Tine
Blaise Tine

12 August 2024
Verified
Conference Paper
Open access
SSSeungbin Song
Seungbin Song
JLJu Min Lee
Ju Min Lee
HJHaeeun Jeong
Haeeun Jeong
HKHyunho Kwon
Hyunho Kwon
SJShinnung Jeong
Shinnung Jeong
HKHanjun Kim
Hanjun Kim
Since the increasing complexity of deep learning models, tensor decomposition is one of the promising solutions that reduce computational complexity in deep learning models. By decomposing a convolution layer with a large weight tensor into multiple layers with smaller weight tensors, tensor decomposition can reduce the number of operations and weight memory spaces. However, existing tensor decomposition schemes face difficulties in reducing peak memory usage of the entire inference. The decomposed layers produce the reduced-sized tensors during inference, but the reduced tensors should be restored to their original sizes due to skip connections and non-decomposed activation layers between the decomposed layers. To reduce the peak memory usage of the end-to-end inference of the decomposed models, this work proposes a new tensor memory optimization scheme and its prototype compiler, called TeMCO. TeMCO replaces the original internal tensors used in the skip connections with reduced internal tensors derived by the decomposed layers. In addition, TeMCO fuses the decomposed layers and the non-decomposed activation layer and thus keeps the reduced internal tensors produced without restoring them. Thanks to the optimizations, this work reduces memory usage of internal tensors by 75.7% for 10 models of 5 deep learning architectures.