快閃記憶體區塊配置方法

Abstract

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.