E±cient Allocation Algorithms for FLASH File Systems
Date Issued
2004
Date
2004
Author(s)
Chou, Li-Fu
DOI
en-US
Abstract
Embedded systems have been developing rapidly in recent years, and flash memory technology has become an essential building block because of its shock-resistance, low power consumption, and non-volatile nature. Since flash memory is a write-once and bulk-erase medium, an intelligent allocation algorithm is essential to providing applications
efficient storage service. In this paper, we propose three allocation algorithms { a First Come First Serve (FCFS) method, a First Re-arrival First Serve (FRFS) method, and an
Online First Re-arrival First Serve (OFRFS) method. Both FCFS and OFRFS are on-line allocation mechanisms which provide a deterministic performance for hard real-time
systems. In addition, the FRFS method, which serves as an on-line mechanism, is taken as the standard of comparison. The capability of the proposed mechanisms is demonstrated by a series of experiments and simulations. The experimental results indicate that FRFS
provide superior performance when the data access patter is analyzed in advance, and
the on-line OFRFS method provides good performance by run-time estimation of access
patterns.
Subjects
快閃記憶體
儲存格配置
algorithm
allocation
flash memory
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-93-R91922087-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):987afd78d17479ebc018e9b100b443a8