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

Nohhyun Park

dblp:52/10372 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 6 · 1 first-authorDatabases, data management, data science and information retrieval · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 59% Performance modeling and evaluation · 41%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
cache performance modeling
0.312017
Cache Modeling and Optimization using Miniature Simulations · USENIX ATC 2017
Memory systems
cache
0.212015
Efficient MRC Construction with SHARDS · FAST 2015
Memory systems › cache
cache behavior
0.212015
Efficient MRC Construction with SHARDS · FAST 2015
Memory systems › cache › cache performance
miss ratio curve
0.212015
Efficient MRC Construction with SHARDS · FAST 2015
Performance modeling and evaluation
workload characterization
0.212015
Efficient MRC Construction with SHARDS · FAST 2015
Memory systems › cache
cache optimization
0.112017
Cache Modeling and Optimization using Miniature Simulations · USENIX ATC 2017

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

simulation · 0.3
YearPublicationVenuePosition
2017 Cache Modeling and Optimization using Miniature Simulations
Carl A. Waldspurger, Trausti Saemundsson, Irfan Ahmad 0005, Nohhyun Park
USENIX ATC4
2015 Efficient MRC Construction with SHARDS
Carl A. Waldspurger, Nohhyun Park, Alex Garthwaite, Irfan Ahmad 0005
FAST2
2012 Romano: autonomous storage management using performance prediction in multi-tenant datacenters
abstract
Workload consolidation is a key technique in reducing costs in virtualized datacenters. When considering storage consolidation, a key problem is the unpredictable performance behavior of consolidated workloads on a given storage system. In practice, this often forces system administrators to grossly overprovision storage to meet application demands. In this paper, we show that existing modeling techniques are inaccurate and ineffective in the face of heterogenous devices. We introduce Romano, a storage performance management system designed to optimize truly heterogeneous virtualized datacenters. At its core, Romano constructs and adapts approximate workload-specific performance models of storage devices automatically, along with prediction intervals. It then applies these models to allow highly efficient IO load balancing.
Nohhyun Park, Irfan Ahmad 0005, David J. Lilja
SoCC1
2012 Memory module-level testing and error behaviors for phase change memory
abstract
Phase change memory (PCM) is a promising technology to solve energy and performance bottlenecks for memory and storage systems. To help understand the reliability characteristics of PCM devices, we present a simple fault model to categorize four types of PCM errors. Based on our proposed fault model, we conduct extensive experiments on real PCM devices at the memory module level. Numerical results uncover many interesting trends in terms of the lifetime of PCM devices and error behaviors. Specifically, PCM lifetime for the memory chips we tested is greater than 14 million cycles, which is much longer than for flash memory devices. In addition, the distributions for four types of errors are quite different. These results can be used for estimating PCM lifetime and for measuring the fabrication quality of individual PCM memory chips.
Weijun Xiao, Nohhyun Park, David J. Lilja
ICCD3
2012 PASS: A Hybrid Storage System for Performance-Synchronization Tradeoffs Using SSDs
abstract
Recent advances in flash memory show great potential to replace traditional hard drives (HDDs) with flash-based solid state drives (SSDs) from personal computing to distributed systems. However, it is still a long way to go before completely using SSDs for enterprise data storage. Considering the cost, performance, and reliability of SSDs, a practical solution is to combine both SSDs and HDDs together. This paper proposes a hybrid storage system named PASS (Performance-dAta Synchronization - hybrid storage System) to tradeoff between I/O performance and data discrepancy between SSDs and HDDs. PASS includes a high-performance SSD and a traditional HDD to store mirrored data for reliability. All of the I/O requests are redirected to the primary SSD first and then the updated data blocks are copied to the backup HDD asynchronously. In order to hide the latency of copying operations, we use an I/O window to coalesce write requests and maintain an ordered I/O queue to shorten the HDD seek and rotation times. Depending on the charateristics of different I/O workloads, we develop an adaptive policy to dynamically balance the foreground I/O processing and background mirroring. We implement a prototype system of PASS by developing a Linux device driver and conduct experiments on the IoMeter, PostMark, and TPCC benchmarks. Our results show that PASS can achieve up to 12 times the performance of a RAID1 storage system for the IoMeter and PostMark workloads while tolerating less than 2% data discrepancy between the primary SSD and the backup HDD. More interestingly, while PASS does not produce any performance benefit for the TPC-C benchmark, it does allow the system to scale to larger sizes than when using an HDD-based RAID system alone.
Weijun Xiao, Xiaoqiang Lei, Ruixuan Li 0001, Nohhyun Park, David J. Lilja
ISPA4
2011 Chunk Fragmentation Level: An Effective Indicator for Read Performance Degradation in Deduplication Storage
abstract
Data deduplication has recently become commonplace in most secondary storage and even in some primary storage for the capacity optimization purpose. Aside from its write performance, read performance of the deduplication storage has been gaining in significance with a wide range of its deployments. In this paper, we emphasize the importance of read performance in reconstituting a data stream from its unique and shared chunks physically dispersed over deduplication storage. We newly introduce a read performance indicator called Chunk Fragmentation Level (CFL). We also validate that the CFL is very effective to indicate read performance of deduplication storage through a developed theoretical performance model and extensive experiments. Finally, we articulate further research issues.
Youngjin Nam, Guanlin Lu, Nohhyun Park, Weijun Xiao, David Hung-Chang Du
HPCC3