請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/34105
標題: | 快閃記憶體區塊配置方法 Block Allocation Algorithms for FLASH File Systems |
作者: | Chung-Hao Chuang 莊中豪 |
指導教授: | 劉邦鋒 |
關鍵字: | 快閃記憶體,線上演算法,配置, adversary,online,offline,allocation,Flash memory, |
出版年 : | 2006 |
學位: | 碩士 |
摘要: | Embedded systems have been developing rapidly in recent years, and flash memory technology has become a major part of embedded systems because of its shock-resistance, low power consumption, and non-volatile nature. Since flash memory has write-once and bulk-erase properties, an intelligent allocation algorithm is essential to providing applications efficient storage service. In this paper, we first demonstrate that the online version of FLASH allocation problem is difficult, since we can find an adversary that makes every online algorithm to use as many number of blocks as a naive and inefficient algorithm.
As a result this paper will focus on the offline version of the FLASH allocation problem, and we propose an allocation algorithm called Best Match (BestM) for allocating blocks in FLASH file systems. The performance of the proposed BestM algorithm is compared with a previously proposed First Re-arrival First Serve (FRFS) method through a series of experiments. The experimental results indicate that BestM deliver better performance than FRFS, especially when the length of the page access sequence scales up, or when the number of cells in every block increases. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/34105 |
全文授權: | 有償授權 |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-95-1.pdf 目前未授權公開取用 | 174.18 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。