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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1145/2245276.2232066 | SAC |
Keywords | Field | DocType |
efficient associativity-aware garbage collection,garbage collection scheme,time-consuming block erasure,proposed garbage collection scheme,garbage collection procedure,proposed scheme,efficient garbage collection scheme,victim block,nand ash memory,block erasure,hybrid ftls,garbage collection,data storage | Associative property,Flash memory,Computer science,Computer data storage,Parallel computing,Response time,NAND gate,Garbage collection | Conference |
Citations | PageRank | References |
2 | 0.36 | 9 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bongjae Kim | 1 | 15 | 7.10 |
Minkyu Park | 2 | 97 | 25.21 |
Cheol Jeon | 3 | 9 | 1.70 |
Chang Oan Sung | 4 | 35 | 8.76 |
Yookun Cho | 5 | 1544 | 162.03 |
Jiman Hong | 6 | 2 | 0.36 |