Abstract
NAND ash memory has many advantages such as low-power consumption, shock-resistance, and non-volatility. For these reasons, NAND ash memory is used for data storage purposes in mobile, personal and even enterprise computer systems. When we use NAND ash memory as a means of data storage, it requires a garbage collection procedure due to its erase-before-write characteristic. The efficiency of this garbage collection is an important issue because it affects the performance of the NAND ash memory. In this paper, we propose an efficient garbage collection scheme that can be combined with previous hybrid FTLs. Our garbage collection scheme considers the associativity of the blocks when selecting a victim block. The proposed scheme effectively reduces the number of time-consuming block erasures. Our trace-driven simulation results show that the proposed garbage collection scheme can reduce the number of block erasures by as much as 14%. It can also reduce the average response time and maximum response time by nearly 10% and 70%, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
