Affiliation:
1. National Chiao-Tung University, Hsin-Chu, Taiwan
2. National Taiwan University, Taipei, Taiwan
Abstract
Many existing approaches on flash-memory management are based on RAM-resident tables in which one single granularity size is used for both address translation and space management. As high-capacity flash memory is becoming more affordable than ever, the dilemma of how to manage the RAM space or how to improve the access performance is emerging for many vendors. In this article, we propose a tree-based management scheme which adopts multiple granularities in flash-memory management. Our objective is to not only reduce the run-time RAM footprint but also manage the write workload, due to housekeeping. The proposed method was evaluated under realistic workloads, where significant advantages over existing approaches were observed, in terms of the RAM space, access performance, and flash-memory lifetime.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture
Reference25 articles.
1. An information organization algorithm;Adelson-Velskii G. M.;Trans. Sov. Math. Doklady,1962
2. Aleph One Company. 2001. Yet Another Flash Filing System. http://www.aleph1.co.uk/yaffs/.]] Aleph One Company. 2001. Yet Another Flash Filing System. http://www.aleph1.co.uk/yaffs/.]]
3. Real-time garbage collection for flash-memory storage systems of real-time embedded systems
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献