Seokjoo Cho

Seokjoo Cho

Auto-generated profile, based on publicly available information

Seokjoo Cho

Chung-Ang University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
22 April 2024
Verified
Conference Paper
Open access
KPKiet Tuan Pham
Kiet Tuan Pham
SCSeokjoo Cho
Seokjoo Cho
SLSangjin Benjamin Lee
Sangjin Benjamin Lee
LNLan Anh Nguyen
Lan Anh Nguyen
HYHyeongi Yeo
Hyeongi Yeo
YSYongseok Son
Yongseok Son
This paper presents a scalable page cache called ScaleCache for improving SSD scalability. Specifically, we first propose a concurrent data structure of page cache based on XArray (ccXArray) to enable access and update the page cache concurrently. Second, we introduce a direct page flush (dflush) which directly flushes pages to storage devices in a parallel and opportunistic manner. We implement ScaleCache with two techniques in the Linux kernel and evaluate it on a 64-core machine with eight NVMe SSDs. Our evaluations show that ScaleCache improves the performance of Linux file systems by up to 6.81× and 4.50× compared with the existing scheme and scalable scheme for multiple SSDs, respectively.

19 October 2022
Verified
Conference Paper
Closed access
SLSangjin Benjamin Lee
Sangjin Benjamin Lee
SCSeokjoo Cho
Seokjoo Cho
KPKiet Tuan Pham
Kiet Tuan Pham
SKSunggon Kim
Sunggon Kim
YSYongseok Son
Yongseok Son
Binary Search Tree is the data structure that has fast search speed and easy addition, removal of elements. Due to these advantages, binary search tree (BST) is one of the frequently used data structures of these days. However, most binary search tree schemes use locking technique to support multiple access of multiple threads for synchronization. Unfortunately, this locking techniques significantly reduce the performance of BST. Locking techniques block or spin the threads that has not obtained the lock until the thread that has obtained the lock completes its job. Thus, to improve the performance of BST, efficient concurrent programming technique should be applied, such as lock-free technique. In this paper, we conduct a comparison of existing lock-free/non-blocking BST methods. We analyze operations and evaluate the strengths and weaknesses of each schemes.