The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
eNVy: a non-volatile, main memory storage system
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
Improving the performance of log-structured file systems with adaptive methods
Proceedings of the sixteenth ACM symposium on Operating systems principles
Cleaning policies in mobile computers using flash memory
Journal of Systems and Software
A New Flash Memory Management for Flash Storage System
COMPSAC '99 23rd International Computer Software and Applications Conference
Real-time garbage collection for flash-memory storage systems of real-time embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
An implementation of a log-structured file system for UNIX
USENIX'93 Proceedings of the USENIX Winter 1993 Conference Proceedings on USENIX Winter 1993 Conference Proceedings
A flash-memory based file system
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
AD-LRU: An efficient buffer replacement algorithm for flash-based databases
Data & Knowledge Engineering
Hi-index | 0.00 |
Flash memory is becoming increasingly important for embedded systems because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. Although flash memory has attractive features, it should perform garbage collection, which includes erase operations. The erase operations are very slow, and usually decrease the performance of the system. Besides, the number of the erase operations allowed to each block is also limited. To minimize the garbage collection time and evenly wear out, our proposed garbage collection policy focuses on minimizing the garbage collection time and 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. Specifically, we have shown that the performance improvement of our proposed policy against the greedy policy in terms of the endurance of flash memory is as much as 90.6%.