By Topic

A novel reordering write buffer to improve write performance of log-structured file systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun Wang ; Dept. of Comput. Sci. & Eng., Univ. of Nebraska, Lincoln, NE, USA ; Yiming Hu

We present a novel reordering write buffer which improves the performance of log-structured file systems (LFS). While UFS has a good write performance, high garbage-collection overhead degrades its performance under high disk space utilization. Previous research concentrated on how to improve the efficiency of the garbage collector after data is written to disk. We propose a new method that reduces the amount of work the garbage collector would do before data reaches disk. By classifying active and inactive data in memory into different segment buffers and then writing them to different disk segments, we force the disk segments to form a bimodal distribution. Most data blocks in active segments are quickly invalidated, while inactive segments remain mostly intact. Simulation results based on a wide range of both real-world and synthetic traces show that our method significantly reduces the garbage collection overhead, slashing the overall write cost of LFS by up to 53 percent, improving the write performance of LFS by up to 26 percent, and the overall system performance by up to 21 percent.

Published in:

Computers, IEEE Transactions on  (Volume:52 ,  Issue: 12 )