An intelligent garbage collection algorithm for flash memory storages

Authors:
Long-zhe Han;Yeonseung Ryu;Tae-sun Chung;Myungho Lee;Sukwon Hong
Affiliations:
Department of Computer Software, Myongji University, Korea;Department of Computer Software, Myongji University, Korea;College of Information Technology, Ajou University, Korea;Department of Computer Software, Myongji University, Korea;Department of Computer Software, Myongji University, Korea
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 9
Cited 0

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
Using data clustering to improve cleaning performance for plash memory

Software—Practice & Experience
Cleaning policies in mobile computers using flash memory

Journal of Systems and Software
Time Series Analysis, Forecasting and Control

Time Series Analysis, Forecasting and Control
A flash-memory based file system

TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Storage alternatives for mobile computers

OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Improvement of space utilization in NAND flash memory storages

ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
LSTAFF: system software for large block flash memory

AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flash memory cannot be overwritten unless erased in advance. In order to avoid having to erase during every update, non-in-place-update schemes have been used. Since updates are not performed in place, obsolete data are later reclaimed by garbage collection. In this paper, we study a new garbage collection algorithm to reduce the cleaning cost such as the number of erase operations and the number of data copies. The proposed scheme automatically predicts the future I/O workload and intelligently selects the victims according to the predicted I/O workload. Experimental results show that the proposed scheme performs well especially when the degree of locality is high.