Abstract
This work investigates an efficient garbage collection scheme of the page mapping scheme to improve the performance of NAND-based storages. The greedy replacement scheme is known to deliver a good performance by evicting the NAND block that has the most invalid pages at garbage collection. However, if the NAND blocks are managed by a single list, the computation overhead of searching for the victim block is significant. In this paper, we proposed the scheme to manage the NAND blocks with multiple lists according to the number of invalid pages. A trace-driven simulation shows that the proposed scheme delivers a better performance than the other schemes.
| Translated title of the contribution | Implementing Greedy Replacement Scheme using Multiple List for Page Mapping Scheme |
|---|---|
| Original language | Korean |
| Pages (from-to) | 17-23 |
| Number of pages | 7 |
| Journal | 한국정보기술학회논문지 |
| Volume | 9 |
| Issue number | 6 |
| State | Published - Jun 2011 |