Minwoo Jo

Mr. Minwoo Jo

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
22 July 2024 in Electronics
Verified
Journal Article
Open access
PDF file
MJMinwoo Jo
Minwoo Jo
HJHayong Jeong
Hayong Jeong
BSBinwon Song
Binwon Song
HJHeeseung Jo
Heeseung Jo
With the exponential growth of encrypted communication over the internet, research into systems capable of analyzing large volumes of encrypted traffic is essential. This study focuses on evaluating the performance of two prominent tools, ssldump and tshark, in decrypting and inspecting encrypted network traffic, assuming an environment where decryption keys are available. The performance of ssldump and tshark was assessed using various metrics, including execution time, and the ability to handle different file sizes and session counts. The results showed that tshark exhibited faster processing speeds for smaller file sizes and a higher number of sessions, while ssldump demonstrated better performance for larger file sizes and fewer sessions. However, notable performance differences were not observed based solely on the type of cipher suite or encryption method used. To enhance performance, the study proposes the session-based split and conquer (SSC) technique for automating parallelization using a multi-process approach. SSC shows up to a 39× improvement in performance, depending on system capabilities and workload.

7 April 2025 in IEEE Access
Verified
Journal Article
Open access
MJMinwoo Jo
Minwoo Jo
BSBinwon Song
Binwon Song
HJHayong Jeong
Hayong Jeong
HJHeeseung Jo
Heeseung Jo
The least recently used (LRU) algorithm is one of the page replacement algorithms used in the swap mechanism of the Linux kernel. The LRU algorithm has evolved through various modifications and developments, ranging from pseudo LRU to LRU/2, and the multi-generational LRU (MGLRU) is currently being discussed and implemented in recent kernels. MGLRU is a variant of the LRU algorithm that improves upon the limitation of using previous memory access records in traditional inactive and active lists. It was officially merged into the kernel 6.1 and continues to be actively improved since then. This paper introduces the HitShield mechanism, which addresses one of the drawbacks of MGLRU: the lack of consideration for the state of the folio during eviction. HitShield is designed by modifying the internal functions of MGLRU, where a counter is maintained in the function that updates the generation of the folio. When eviction occurs, if HitShield of the folio is activated, it is protected from eviction once by promoting it to the youngest generation, similar to a second-chance algorithm. The implementation of HitShield has demonstrated performance improvements ranging from 1.79% to 6.21% in the situation with insufficient memory of the 7-Zip benchmark, from 2.63% to 12.1% in kernel build tasks, and from 0.83% to 9.02% across workloadAto F inYahoo! cloud serving benchmark (YCSB). Additionally, the number of swap-in and swap-out reduced approximately 2.04% to 3.34% and 1.4% to 3.36% in the 7-Zip benchmark, 2.04% to 14.06% and 2.25% to 8.94% in kernel build tasks, and 71.71% to 89.9% and 71.06% to 88.94% in YCSB, respectively. It is anticipated that the HitShield technique can contribute to solving the folio placement problem between compute express link (CXL) and DRAM in future CXL memory expansion environments.

29 October 2025 in Electronics
Verified
Journal Article
Open access
PDF file
HJHayong Jeong
Hayong Jeong
BSBinwon Song
Binwon Song
MJMinwoo Jo
Minwoo Jo
HJHeeseung Jo
Heeseung Jo
In modern high-performance computing (HPC) and large-scale data processing environments, the efficient utilization and scalability of memory resources are critical determinants of overall system performance. Architectures such as non-uniform memory access (NUMA) and tiered memory systems frequently suffer performance degradation due to remote accesses stemming from shared data among multiple tasks. This paper proposes LACX, a shared data migration technique leveraging Compute Express Link (CXL), to address these challenges. LACX preserves the migration cycle of automatic NUMA balancing (AutoNUMA) while identifying shared data characteristics and migrating such data to CXL memory instead of DRAM, thereby maximizing DRAM locality. The proposed method utilizes existing kernel structures and data to efficiently identify and manage shared data without incurring additional overhead, and it effectively avoids conflicts with AutoNUMA policies. Evaluation results demonstrate that, although remote accesses to shared data can degrade performance in low-tier memory scenarios, LACX significantly improves overall memory bandwidth utilization and system performance in high-tier memory and memory-intensive workload environments by distributing DRAM bandwidth. This work presents a practical, lightweight approach to shared data management in tiered memory environments and highlights new directions for next-generation memory management policies.