TY - JOUR
T1 - ROSE
T2 - A novel flash translation layer for nand flash memory based on hybrid address translation
AU - Chiao, Mong Ling
AU - Chang, Da Wei
N1 - Funding Information:
The authors would like to thank the anonymous reviewers and the editor for their helpful comments on this paper. This research was supported in part by grant NSC 97-2221-E-006-138-MY3 from the National Science Council, Taiwan, Republic of China.
PY - 2011
Y1 - 2011
N2 - A Flash Translation Layer (FTL) provides a block device interface on top of flash memory to support disk-based file systems. Due to the erase-before-write feature of flash memory, an FTL usually performs out-of-place updates and uses a cleaning procedure to reclaim stale data. A hybrid address translation (HAT)-based FTL combines coarse-grained and fine-grained address translation to achieve good performance while keeping the size of the mapping information small. In this paper, we propose a new HAT-based FTL, called ROSE, which includes three novel techniques for reducing the cleaning cost. First, it reduces high-cost reclamation by preventing data in an entire-block sequential write from being placed into multiple physical blocks while eliminating the cleaning cost resulting from mispredicting random or semisequential writes as sequential ones. Second, it uses a merge-aware cleaning policy that considers both the block age and the merge cost in a HAT-based FTL for improving the cleaning efficiency. Third, it delays the erasure of obsolete blocks and reuses their free pages for buffering more writes. Simulation results show that the proposed FTL outperforms existing HAT-based FTLs in terms of both cleaning cost and flash write time by up to 47 times and 1.6 times, respectively.
AB - A Flash Translation Layer (FTL) provides a block device interface on top of flash memory to support disk-based file systems. Due to the erase-before-write feature of flash memory, an FTL usually performs out-of-place updates and uses a cleaning procedure to reclaim stale data. A hybrid address translation (HAT)-based FTL combines coarse-grained and fine-grained address translation to achieve good performance while keeping the size of the mapping information small. In this paper, we propose a new HAT-based FTL, called ROSE, which includes three novel techniques for reducing the cleaning cost. First, it reduces high-cost reclamation by preventing data in an entire-block sequential write from being placed into multiple physical blocks while eliminating the cleaning cost resulting from mispredicting random or semisequential writes as sequential ones. Second, it uses a merge-aware cleaning policy that considers both the block age and the merge cost in a HAT-based FTL for improving the cleaning efficiency. Third, it delays the erasure of obsolete blocks and reuses their free pages for buffering more writes. Simulation results show that the proposed FTL outperforms existing HAT-based FTLs in terms of both cleaning cost and flash write time by up to 47 times and 1.6 times, respectively.
UR - http://www.scopus.com/inward/record.url?scp=79955546429&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955546429&partnerID=8YFLogxK
U2 - 10.1109/TC.2011.67
DO - 10.1109/TC.2011.67
M3 - Article
AN - SCOPUS:79955546429
SN - 0018-9340
VL - 60
SP - 753
EP - 766
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
IS - 6
M1 - 5740855
ER -