Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sungwoo Yun

dblp:398/0148 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0000-8908-1289ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
bootstrapping management
0.912025
HALO: Loop-aware Bootstrapping Management for Fully Homomorphic Encryption · ASPLOS (1) 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.912025
HALO: Loop-aware Bootstrapping Management for Fully Homomorphic Encryption · ASPLOS (1) 2025
Compilers and program optimization › domain-specific compilation
FHE compiler
0.912025
HALO: Loop-aware Bootstrapping Management for Fully Homomorphic Encryption · ASPLOS (1) 2025

Methods — techniques the papers use, named apart from their topics

loop-aware bootstrapping placement · 1.7compiler optimization · 1.7
YearPublicationVenuePosition
2026 Selene: Cross-Level Barrier-Free Pipelining for Irregular Nested Loops in High-Level Synthesis
abstract
The growing demand for domain-specific accelerators in fields such as machine learning, graph analytics, and scientific computing has highlighted the need for productive and efficient hardware design methodologies. High-level synthesis (HLS) offers an attractive solution by generating hardware from high-level code, with loop pipelining as a cornerstone for maximizing throughput in regular computations. However, existing static and dynamic HLS approaches fail to achieve high pipeline utilization for irregular loop nests characterized by data-dependent bounds, unpredictable memory access patterns, and loop-carried dependencies.To address the pipeline underutilization in irregular loop, this work proposes a new barrier-free pipeline architecture with a cross-level scheduling strategy and the corresponding HLS compiler Selene, that automatically synthesizes the proposed architecture. Our approach introduces a fine-grained pipeline controller and an outer-loop iteration interleaving mechanism, enabling concurrent execution of multiple outer-loop iterations and efficient handling of data dependencies. Implemented within a commercial HLS flow, Vitis HLS, Selene delivers significant speedups of 4.74× and 5.46× over both standard static and dynamic HLS tools on a range of irregular workload benchmarks, demonstrating its effectiveness in overcoming challenges to efficient hardware generation for data-dependent applications.
Sungwoo Yun, Seonyoung Cheon, Dongkwan Kim 0002, Heelim Choi, Kunmo Jeong, Yongwoo Lee 0001, Hanjun Kim 0001
CGO1
2025 HALO: Loop-aware Bootstrapping Management for Fully Homomorphic Encryption
abstract
Thanks to the computation ability on encrypted data, fully homomorphic encryption (FHE) is an attractive solution for privacy-preserving computation. Despite its advantages, FHE suffers from limited applicability in small programs because repeated FHE multiplications deplete the level of a ciphertext, which is finite. Bootstrapping reinitializes the level, thus allowing support for larger programs. However, its high computational overhead and the risk of level underflow require sophisticated bootstrapping placement, thereby increasing the programming burden. Although a recently proposed compiler automatizes the bootstrapping placement, its applicability is still limited due to lack of loop support.
Seonyoung Cheon, Yongwoo Lee 0001, Hoyun Youm, Dongkwan Kim 0002, Sungwoo Yun, Kunmo Jeong, Hanjun Kim 0001
ASPLOS (1)5