Byeong-Gil Jun

dblp:346/9234 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0009-3215-8666ORCID · reported

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

Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Towards Efficient Privacy-Preserving Federated Learning on Edge with Reconfigurable FPGA
abstract
FPGA-based acceleration has been explored to address performance challenges in architectures incorporating federated learning (FL) and homomorphic encryption (HE). However, model updates, which involve HE, are infrequent in FL applications; thus, static allocation of FPGA resources for HE can lead to inefficiency. In response, this paper presents a work-in-progress FPGA-based FL accelerator that leverages dynamic partial reconfiguration to accelerate HE operations flexibly.
Byeong-Gil Jun, Megan Kuo, Aditya A. Krishnan, Hokeun Kim
FDL1
2025 Improving the Efficiency of Coordinating Timed Events in Distributed Systems
Byeong-Gil Jun, Edward A. Lee, Marten Lohstroh, Hokeun Kim
SIGSIM-PADS1
2024 Efficient Coordination for Distributed Discrete-Event Systems
abstract
Timing control while preserving determinism is often a key requirement for ensuring the safety and correctness of distributed cyber-physical systems (CPS). Discrete-event (DE) systems provide a suitable model of computation (MoC) for time-sensitive distributed CPS. The high-level architecture (HLA) is a useful tool for the distributed simulation of DE systems, but its techniques can be adapted for implementing distributed CPS. However, HLA incurs considerable overhead in network messages conveying timing information between the distributed nodes and the centralized run-time infrastructure (RTI). This paper gives a novel approach and implementation that reduces such network messages while preserving DE semantics. An evaluation of our runtime demonstrates that our approach significantly reduces the volume of messages for timing information in HLA.
Byeong-Gil Jun, Edward A. Lee, Marten Lohstroh, Hokeun Kim
MEMOCODE1