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
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)
A flash-memory based file system
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Endurance enhancement of flash-memory storage systems: an efficient static wear leveling design
Proceedings of the 44th annual Design Automation Conference
Deterministic service guarantees for nand flash using partial block cleaning
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Proceedings of the 14th international conference on Architectural support for programming languages and operating systems
FRA: a flash-aware redundancy array of flash storage devices
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Hierarchical architecture of flash-based storage systems for high performance and durability
Proceedings of the 46th Annual Design Automation Conference
ACM Transactions on Design Automation of Electronic Systems (TODAES)
FeGC: An efficient garbage collection scheme for flash memory based storage systems
Journal of Systems and Software
Hi-index | 0.00 |
In NAND flash storages, the invalidated pages could occupy the storage space until being erased. In order to preserve sustained write performance and storage capacity, the storage controller must eliminate these pages through garbage collection operations. However, the garbage collection operations may cause high computation overhead while selecting victim blocks, thereby resulting in the host system suffering from unendurable storage-access latency as well as performance degradation. In this paper, we propose an efficient garbage collection mechanism, which not only eliminates the computation overhead in victim block selection, but also improves responsiveness to the host requests by making the garbage collection operation preemptive.