Improving the performance of log-structured file systems with adaptive methods

Matthews, Jeanna; Roselli, Drew; Costello, Adam M.; Wang, Randolph Y.; Anderson, Thomas E.

doi:10.1145/269005.266700

Cited by 30 publications

(27 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This could improve the I/O performance of write intensive workloads in disk based storage systems. Due to the out-place-update property of LFS, garbage collection schemes have already been discussed in the disk storage systems (Blackwell et al, 1995;Matthews et al, 1997;Rosenblum and Ousterhout, 1992;Seltzer et al, 1993). Wu and Zwaenepoel (1994) proposed the Greedy algorithm for garbage collection.…”

Section: Garbage Collection Proceduresmentioning

confidence: 99%

FeGC: An efficient garbage collection scheme for flash memory based storage systems

Kwon

Koh

Lee

et al. 2011

Journal of Systems and Software

View full text Add to dashboard Cite

Section: Garbage Collection Proceduresmentioning

confidence: 99%

FeGC: An efficient garbage collection scheme for flash memory based storage systems

Kwon

Koh

Lee

et al. 2011

Journal of Systems and Software

View full text Add to dashboard Cite

“…LFS writes data to a clean segment and performs segment cleaning to reclaim space occupied by obsolete data just like invalid pages are cleaned in Flash memory [2]. Segment cleaning is a vital issue in the Log-structured File System (LFS) as it greatly affects performance [15][16][17][18]. Blackwell et al use the terms 'on-demand cleaning' and 'background cleaning' separately and try to reduce user-perceived latency by applying heuristics to remove on-demand cleaning [15].…”

Section: Related Workmentioning

confidence: 99%

“…Blackwell et al use the terms 'on-demand cleaning' and 'background cleaning' separately and try to reduce user-perceived latency by applying heuristics to remove on-demand cleaning [15]. Matthews et al propose a scheme that adaptively incorporates hole-plugging into cleaning according to the changes in disk utilization [16]. They also consider how to take advantage of cached data to reduce the cost of cleaning.…”

Section: Related Workmentioning

confidence: 99%

Design and implementation of a uniformity-improving page allocation scheme for flash-based storage systems

Baek

Choi

Ahn

et al. 2008

Des Autom Embed Syst

View full text Add to dashboard Cite

Flash memory is being actively employed in a variety of embedded systems such as digital cameras, MP3 players, cell phones, solid state disks (SSDs), and digital media broadcasting (DMB) devices. This paper considers performance issues in file systems that employ Flash memory as a storage medium. Firstly, it explores the characteristics of Flash memory and identifies the cost of block cleaning as the key performance bottleneck for Flash memory analogous to the seek time in disk storage. Then, it defines three performance parameters, namely, utilization, invalidity, and uniformity and derives a formula for block cleaning cost based on these parameters. It is shown that, of these parameters, uniformity exerts the strongest influence on the cost of cleaning and that uniformity is a file system controllable parameter. Finally, we design a uniformity-aware page allocation scheme and analyze how enhanced uniformity affects the block cleaning cost with various workloads. Real implementation experiments conducted on an embedded system show that the scheme proposed here typically reduces the cleaning time by 20 to 30% compared to the traditional sequential allocation scheme that is used in YAFFS. 6 S. Baek et al.

show abstract

“…Rosenblum et al proposed the Log-Structured File System (LFS) and garbage collection policies have long been discussed in log-based disk storage systems [1][2][3][4]. Fortunately, the Log-Structured File System can be applied to flash memory based storage systems and the garbage collection policies in log-based disk storage also can be applied to flash memory based storage systems.…”

Section: Existing Work On Garbage Collectionmentioning

confidence: 99%

Swap-Aware Garbage Collection for NAND Flash Memory Based Embedded Systems

Kwon

Koh

2007

7th IEEE International Conference on Computer and Information Technology (CIT 2007)

View full text Add to dashboard Cite

Embedded systems use NAND flash memory as a secondary storage device because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. NAND flash memory based embedded systems exploit a "demand paging" to run applications and also use a "swapping" to extend a limited main memory space. Because the embedded systems use NAND flash memory as swap space, it should perform garbage collection, which is a time-consuming operation. Besides, the number of the erase operations allowed to each block is also limited. In this paper, we propose a new garbage collection policy for embedded systems with the swap system. The proposed garbage collection policy focuses on minimizing the garbage collection time and even wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing garbage collection policies in terms of the garbage collection time and the endurance of flash memory.

show abstract

Improving the performance of log-structured file systems with adaptive methods

Cited by 30 publications

References 19 publications

FeGC: An efficient garbage collection scheme for flash memory based storage systems

FeGC: An efficient garbage collection scheme for flash memory based storage systems

Design and implementation of a uniformity-improving page allocation scheme for flash-based storage systems

Swap-Aware Garbage Collection for NAND Flash Memory Based Embedded Systems

Contact Info

Product

Resources

About