Beating the I/O bottleneck: a case for log-structured file systems
ACM SIGOPS Operating Systems Review
Measurements of a distributed file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Using latency to evaluate interactive system performance
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Improving the performance of log-structured file systems with adaptive methods
Proceedings of the sixteenth ACM symposium on Operating systems principles
Using System-Level Models to Evaluate I/O Subsystem Designs
IEEE Transactions on Computers
A performance comparison of RAID-5 and log-structured arrays
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
PROFS-Performance-Oriented Data Reorganization for Log-Structured File System on Multi-Zone Disks
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
File system logging versus clustering: a performance comparison
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Heuristic cleaning algorithms in log-structured file systems
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
A transactional flash file system for microcontrollers
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Online reorganization of databases
ACM Computing Surveys (CSUR)
SFS: random write considered harmful in solid state drives
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
| Hi-index | 14.98 |
Abstract--This paper presents a novel reordering write buffer which improves the performance of Log-structured File Systems (LFS). While LFS 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.