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

Taeseok Kim

dblp:34/4112 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2015
0000-0002-4200-2384ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSystems, architecture and hardware · 1Databases, 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
1 paper
Storage systems · 54% Memory systems · 46%

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

TopicWeightPapersLastEvidence papers
Storage systems
file systems
0.212013
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory · IEEE Trans. Knowl. Data Eng. 2013
Memory systems
non-volatile memory
0.212013
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory · IEEE Trans. Knowl. Data Eng. 2013
Memory systems › non-volatile memory
phase change memory
0.212013
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory · IEEE Trans. Knowl. Data Eng. 2013
Storage systems › file systems › versioning
versioning file system
0.212013
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory · IEEE Trans. Knowl. Data Eng. 2013
Storage systems › file systems
snapshot
0.012013
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory · IEEE Trans. Knowl. Data Eng. 2013
YearPublicationVenuePosition
2015 Modeling and analysis of non beacon mode for low-rate WPAN
abstract
Non-beacon mode operation is included in IEEE 802.1.5.4 due to low overhead, energy efficient transmission and no tight synchronization requirement as compared to the beacon-mode transmissions. We model non beacon mode operation of an 802.15.4 unslotted CSMA/CA using Markov chain analysis for low data rate unsaturated traffic. Our modeling is reasonably detailed to capture an exact 802.15.4 system. The modeling captures various network features in detail, such as channel access probability, packet collision, acknowledged transmissions, exponential backoff with retry limits. The packet generation process at the sensor nodes is considered as periodic. We thoroughly derive the packet delay distribution and study the system throughput and energy efficiency trade off which is often crucial for the low rate networks. Our exact Markov chain based analysis reveals that the service process of the protocol is close to an exponential distribution. Therefore, we approximate it by a single server queue with an exponential service time. We then analyze a D/M/1 queue with an unsaturated periodic traffic and show that it can be a good fit for the 802.15.4 system. Using D/M/1 queue model, we derive an end-to-end delay and analyze the delay performance. We also study a system with non-exponential backoff and compare the optimal network performance with the legacy exponential backoff system. Our simulation results corroborate with the theoretical analysis. Our analysis can be used as a system design tool where various network system parameters can be configured to meet a desired end-to-end delay, energy efficiency and throughput.
Kannan Govindan 0001, Amar Prakash Azad, Kiran Bynam, Patil Sandhya, Taeseok Kim
CCNC5
2013 On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory
abstract
Versioning file systems are widely used in modern computer systems as they provide system recovery and old data access functions by retaining previous file system snapshots. However, existing versioning file systems do not perform well with the emerging PCM (phase-change memory) storage, because they are optimized for hard disks. Specifically, a large amount of additional writes incurred by maintaining snapshot degrades the performance of PCM seriously as write operations are the performance bottleneck of PCM. This paper presents a novel versioning file system, designed for PCM, that reduces the writing overhead of a snapshot significantly. Unlike existing versioning file systems that incur cascade writes up to the file system root, our scheme breaks the recursive update chain at the immediate parent level. The proposed file system is implemented on Linux 2.6 as a prototype. Measurement studies with various I/O benchmarks show that the proposed file system improves the I/O throughput by 144 percent on average, compared to ZFS, a representative versioning file system.
Jee-Eun Jang, Taeseok Kim, Hyokyung Bahn
IEEE Trans. Knowl. Data Eng.3
2011 Performance Improvement of I/O Subsystems Exploiting the Characteristics of Solid State Drives
Byeungkeun Ko, Youngjoo Kim, Taeseok Kim
ICCSA (3)3
2006 B-PIC: A Novel Caching Scheme for Multimedia Streaming Servers
Ohhoon Kwon, Taeseok Kim, Hyokyung Bahn, Kern Koh
HiPC2
2006 G-SCAN: A Novel Real-Time Disk Scheduling Using Grouping and Branch-and-Bound Strategy
Taeseok Kim, Eungkyu Song, Yunji Koh, Youjip Won, Kern Koh
ICCSA (1)1