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.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- An Intelligent Garbage Collection Algorithm for Flash Memory Storages
- Springer Berlin Heidelberg
- Sequence number