Using data clustering to improve cleaning performance for plash memory
Software—Practice & Experience
Efficient on-line identification of hot data for flash-memory management
Proceedings of the 2005 ACM symposium on Applied computing
A flash-memory based file system
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
A log buffer-based flash translation layer using fully-associative sector translation
ACM Transactions on Embedded Computing Systems (TECS)
A reconfigurable FTL (flash translation layer) architecture for NAND flash-based applications
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the 14th international conference on Architectural support for programming languages and operating systems
Superblock FTL: A superblock-based flash translation layer with a hybrid address translation scheme
ACM Transactions on Embedded Computing Systems (TECS)
ComboFTL: Improving performance and lifespan of MLC flash memory using SLC flash buffer
Journal of Systems Architecture: the EUROMICRO Journal
A Hybrid Approach to NAND-Flash-Based Solid-State Disks
IEEE Transactions on Computers
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
Proceedings of the 50th Annual Design Automation Conference
Analytic Models of SSD Write Performance
ACM Transactions on Storage (TOS)
Wear unleveling: improving NAND flash lifetime by balancing page endurance
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 0.00 |
In the recent years, commodity solid-state disks have started adopting powerful controllers and implemented page-level mapping for flash management. However, many of these models still use primitive garbage-collection algorithms, because prior approaches do not scale up with the dramatic increase of flash capacity. This study introduces Dual Greedy for garbage collection in page-level mapping. Dual Greedy identifies page-accurate data hotness using only block-level information, and adaptively switches its preference of victim selection between block space utilization and block stability. It can run in constant time and use very limited RAM space. Our experimental results show that Dual Greedy outperforms existing approaches in terms of garbage-collection overhead, especially with large flash blocks.