Sam H. Noh

Sam H. Noh

Auto-generated profile, based on publicly available information

Sam H. Noh

Virginia Tech, Arlington, VA, USA

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
30 March 2025
Verified
Conference Paper
Open access
JLJinshu Liu
Jinshu Liu
HHHamid Hadian
Hamid Hadian
YWYuyue Wang
Yuyue Wang
DBDaniel S. Berger
Daniel S. Berger
MNMarie Nguyen
Marie Nguyen
HLHuaicheng Li
Huaicheng Li

8 March 2009
Verified
Conference Paper
Open access
JLJongmin Lee
Jongmin Lee
EBEujoon Byun
Eujoon Byun
HPHanmook Park
Hanmook Park
JCJongmoo Choi
Jongmoo Choi
DLDong-Hee Lee
Dong-Hee Lee
SNSam H. Noh
Sam H. Noh
NAND flash memory is the most widely used storage medium in embedded systems today due to its many advantages such as light weight, low power consumption, and shock resistance. Recently, solid state drives (SSDs), which use NAND flash memory to store data, are replacing conventional magnetic disks in laptops and some server computers. In the SSDs, to achieve both high performance and large capacity, a number of flash memory chips are connected to multiple buses and SSD firmware exploits parallel accesses by using interleaving and overlapping techniques. However, it is still unclear how many buses or chips should be used and how to drive those chips and buses to satisfy performance that may be required. To help answer these questions, we have developed a clock precision SSD simulator (CPS-SIM) that simulates the internal behavior of an SSD and that reports timing and utilization information. From the accurate timing and utilization results of CPS-SIM, we can discover the optimal hardware configuration including the number of buses and chips and their interconnections in an SSD. Also, it allows for fast development and verification of SSD firmware that runs an FTL (Flash Translation Layer) optimized for an SSD. Unlike FTLs for embedded flash memory, the FTL for an SSD must utilize the concurrency of the multiple chips and buses. By supporting concurrency, our CPS-SIM provides a flexible environment for design of SSD firmware that drives the multiple flash memory chips and also that schedules data transmissions via the multiple buses.

8 July 2024
Verified
Conference Paper
Open access
HYHeejin Yoon
Heejin Yoon
JYJin Yang
Jin Yang
JBJuyoung Bang
Juyoung Bang
SNSam H. Noh
Sam H. Noh
YCYoung-Ri Choi
Young-Ri Choi
In real life, the ratio of write and read operations of key-value (KV) store workloads usually changes over time. In this paper, we present a Dynamic wOrkload Pattern Aware LSM-based KV store (DOPA-DB), which supports dynamic compaction strategies depending on the workload pattern. In particular, DOPA-DB is a tiered LSM-based KV store with multiple key ranges, which enables varying compaction sizes. For write-intensive workloads, DOPA-DB can minimize write stalls while minimizing compaction overhead, and for read-intensive workloads, it can aggressively perform compaction to reduce the number of file accesses. Our preliminary experimental results show the potential benefits of dynamic compaction and provide insight into research directions for dynamic compaction strategies.

1 November 1998
Verified
Conference Paper
Open access
PDF file
HJHeung Seok Jeon
Heung Seok Jeon
SNSam H. Noh
Sam H. Noh

8 May 2023
Verified
Conference Paper
Open access
JYJin Yang
Jin Yang
HYHeejin Yoon
Heejin Yoon
GYGyeongchan Yun
Gyeongchan Yun
SNSam H. Noh
Sam H. Noh
YCYoung-Ri Choi
Young-Ri Choi
Many datasets in real life are complex and dynamic, that is, their key densities are varied over the whole key space and their key distributions change over time. It is challenging for an index structure to efficiently support all key operations for data management, in particular, search, insert, and scan, for such dynamic datasets. In this paper, we present DyTIS (Dynamic dataset Targeted Index Structure), an index that targets dynamic datasets. DyTIS, though based on the structure of Extendible hashing, leverages the CDF of the key distribution of a dataset, and learns and adjusts its structure as the dataset grows. The key novelty behind DyTIS is to group keys by the natural key order and maintain keys in sorted order in each bucket to support scan operations within a hash index. We also define what we refer to as a dynamic dataset and propose a means to quantify its dynamic characteristics. Our experimental results show that DyTIS provides higher performance than the state-of-the-art learned index for the dynamic datasets considered.

29 July 2013
Verified
Conference Paper
Open access
PDF file
JLJongmin Lee
Jongmin Lee
YOYongseok Oh
Yongseok Oh
HKHunki Kwon
Hunki Kwon
JCJongmoo Choi
Jongmoo Choi
DLDong-Hee Lee
Dong-Hee Lee
SNSam H. Noh
Sam H. Noh
In this paper, we focus on firmware design for flash memory cards that have scarce resources such as small amount of SRAM and low performance processors. Our design goals include devising practical, commercial grade features required for commercial flash memory cards and minimizing memory requirements to support these features. To this end, we propose TinyFTL (Flash Translation Layer) that has low memory requirements for implementing full features such as efficient garbage collection, mapping, caching, and fast boot-up. Through implementation and experiments, we show that even with smaller memory footprints TinyFTL performs better in terms of performance and boot-up time than implementations of state-of-the-art FTLs.