• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.537-541
• /
• 2008

Log-Structured File System(LFS) is a disk based file system that is optimized for improving the write performance. LFS gathers dirty data in memory as long as possible, and flushes all dirty data sequentially at once. In a real system, however, maintaining dirty data in memory should be flushed into a disk to meet file system consistency issues even if more memory is still available. This synchronizations increase the cleaner overhead of LFS and make LFS to write down more metadata into a disk. In this paper, by adapting Non-volatile RAM(NV-RAM) we modifies LFS and virtual memory subsystem to guarantee that LFS could gather enough dirty data in the memory and reduce small disk writes. By doing so, we improves the performance of LFS by around 2.5 times than the original LFS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.310-314
• /
• 2007

Log-Structured File system은 쓰기에 최적화한 파일 시스템으로 변경된 데이터를 최대한 모아서 순차적으로 기록하는 방식을 가지고 있다. 그러나 실제 시스템에서는 주기적인 동기화로 인해 작은 크기의 데이터들이 디스크로 쓰여지게 되면서 원래의 디자인 목표를 살리지 못하게 된다. 본 연구에서는 최근 급속도로 발전하고 있는 비휘발성 메모리(NVRAM)를 이용해서 주기적인 동기화를 없애고 작은 단위의 쓰기는 NVRAM을 통해 흡수하도록 하였다. 이를 통하여 DRAM만 있는 LFS에 비해 33% 가량 TPC-C 수행 성능이 향상되고, 더 빠르고 고른 응답 시간을 보일 수 있었다.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.627-635
• /
• 2016

When many processes issue write operations alternately on Log-structured File System (LFS), the created files can be fragmented on the file system layer although LFS sequentially allocates new blocks of each process. Unfortunately, this file fragmentation degrades read performance because it increases the number of block I/Os. Additionally, read-ahead operations which increase the number of data to request at a time exacerbates the performance degradation. In this paper, we suggest a new cleaning method on LFS that minimizes file fragmentation. During a cleaning process of LFS, our method sorts valid data blocks by inode numbers before copying the valid blocks to a new segment. This sorting re-locates fragmented blocks contiguously. Our cleaning method experimentally eliminates 60% of file fragmentation as compared to file fragmentation before cleaning. Consequently, our cleaning method improves sequential read throughput by 21% when read-ahead is applied.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.963-967
• /
• 2009

The Log-structured File System (LFS) collects all modified data into a memory buffer and writes them sequentially to a segment on disk. Therefore, it has the potential to utilize the maximum bandwidth of storage devices where sequential writes are much faster than random writes. However, as disk space is finite, LFS has to conduct cleaning to produce free segments. This cleaning operation is the main reason LFS performance deteriorates when file system utilization is high. To overcome painful cleaning and reduced performance of LFS, we propose the segment space recycling (SSR) scheme that directly writes modified data to invalid areas of the segments and describe the classification method of data and segment to consider locality of reference for optimizing SSR scheme. We implement U-LFS, which employs our segment space recycling scheme in LFS, and experimental results show that SSR scheme increases performance of WOLF by up to 1.9 times in HDD and 1.6 times in SSD when file system utilization is high.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.39-46
• /
• 2007

Recently flash memory is widely accepted as a storage devise of embedded systems for portability and performance reasons. Flash memory has many distinguishing features compared to legacy magnetic disks. Especially, a file system for flash memory usually assumes the form of log-structured file system and it employs garbage collector accordingly. Since the garbage collector can greatly affect the performance of file system, it should be designed carefully considering flash memory features. In this paper, we suggest a new garbage collector for existing JFFS2 (Journaling Flash File System II) file system. By extensive performance evaluation, we show that the proposed garbage collector achieves improved performance in terms of flash memory consumption rate, increased flash memory life time, and improved wear-leveling.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.402-415
• /
• 2001

Advantages of flash memories are their shock resistance and fast read speed, which is much faster than that of a HDD. Because of these characteristics, they are increasingly used in the traditional household electric appliance and portable handset and therefore, development of file systems which use them as storage medium is increasingly needed. But they have two problems as storage medium. First, data stored in them cannot be overwritten: it must be erased before new data can be stored. Unfortunately, this erase operation usually takes about one second. Consequently, updating data in flash memories takes long time. In this paper, their problem is solved by using a data update mechanism like LFS(Log-structured File System). Second, their erase operations are restricted. We propose novel cleaning policy in order to increase the life cycle. We implemented FAT file system, which is suitable to small storage medium and solved problems, which usually happen in implementing FAT. We evaluated the performance of sequential writes and random writes on our implemented flash file system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.239-240
• /
• 2007

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.567-582
• /
• 2000

We propose a new way of managing flash memory space for flash memory-specific file system based on log-structured file system. Flash memory has attractive features such as non-volatility, and fast I/O speed, but it also suffers from inability to update in place and limited usage cycles. These drawbacks require many changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between the two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data. The second goal, cycle-leveling is achieved to the degree where the maximum difference between erase cycles is below the error range of the hardware. Simulation results show that the proposed method has significant benefit over naxve methods: maximum of 35% reduction in cleaning cost with even spreading writes across segments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.885-888
• /
• 2007

본 논문은 무선 센서노드에서 측정되는 데이터들에 대한 저장 및 검색을 효율적으로 하기 위한 플래시 메모리 공간 관리 기법을 제안한다. 플래시 메모리는 외부 충격에 강하고, 비휘발성이며 접근이 빠른 장점이 있지만, 덮어쓰기 및 쓰기 횟수가 제한되는 단점이 있다. 이러한 특성으로 플래시 메모리는 기존의 저장매체와는 다른 관리 방법이 요구되었고 지금까지의 센서노드에서는 플래시 메모리를 사용 하지 않았다. 본 논문에서는 센서노드안의 플래시 메모리에서 순차적으로 측정되는 데이터를 관리하기 위해 LFS(Log-Structured File System)방식을 제안한다. 그리고 순차적으로 정렬된 데이터에 효율적인 검색방법을 제시하고, 이를 ZigbeX Mote의 TinyOS안에서 NesC로 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.193-196
• /
• 2006

파일 시스템의 안정성에 문제가 생긴 경우, 파일 시스템의 동작이 중단되어 수정 중이던 데이터가 손실되거나 기존 데이터의 복구가 불가능하게 되는 상황이 발생 할 수 있다. 데이터의 종류에는 파일의 데이터와 같이 데이터 자체가 중요한 내용을 담고 있는 것과 파일의 데이터를 관리하기 위한 정보를 담고 있는 데이터가 있는데 후자를 메타데이터라고 한다. 단순히 파일의 데이터가 손실된 경우에 약간의 데이터 손실이 발생할 수는 있지만, 파일 시스템은 정상적으로 동작 할 수 있다. 하지만 메타데이터가 손상된 경우에는 파일 시스템이 볼륨에 접근조차 할 수 없게 되어 볼륨 내의 모든 파일을 접근할 수 없게 된다. 이러한 문제점들을 극복하기 위해 DualFS [8], log-structured 파일 시스템 [10], XFS [9] 등의 다양한 저널링 파일 시스템들이 제안되었다. 그 중 Ext$_3$ 파일 시스템은 가장 안정적이고 치명적인 문제점이 없는 것으로 알려져 있다.[7] 하지만 Ext$_3$ 파일 시스템에서 기본적으로 사용되고 있는 ordered mode 저널링은 메타데이터의 복사가 이루어져야 하기 때문에 속력의 저하가 발생한다. 본 논문에서는 ordered mode의 메타데이터의 복사 작업이 필요 없는 개선된 ordered mode 저널링을 제안한다.