A Design of Flash Memory File System for Embedded Systems

Noritaka Ishizumi, Keizo Saisho, Akira Fukuda

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Flash memory, which has advantages of nonvolatility, high density, little power consumption, and low cost, has been employed as memory device for small and portable embedded devices. Flash memory, however, is slower in writing data compared with volatile semiconductor memory such as DRAM, and requires a time-consuming block erase operation for data rewriting. The block erase operation should be avoided as far as possible because there is a limit in the number of erases. In this paper, a file system for flash memory that realizes high-speed data access and high durability is proposed, and designed and implemented. Specifically speaking, the life of flash memory is prolonged by using linked lists for file management to avoid concentration of rewriting on specific erase blocks. Furthermore, write operations are speeded-up by writing only the difference in update, and the number of block erase operations is reduced by updating links through appending operations. The result of experiments showed that concentration of block erase operations on specific blocks, which is normal in conventional table management methods, could be avoided by using linked lists for file management. Appending operations produced little degradation of storage usage even if the file size was fairly smaller compared with the size of an erase block. However, there were cases where multiple garbage collections were required in file writing, and it took several times longer than usual cases. Thus, it is necessary to improve file writing for practical application.

Original languageEnglish
Pages (from-to)91-100
Number of pages10
JournalSystems and Computers in Japan
Volume35
Issue number1
DOIs
Publication statusPublished - Jan 1 2004

Fingerprint

Flash Memory
Flash memory
File System
Embedded systems
Embedded Systems
Data storage equipment
Rewriting
Dynamic random access storage
Durability
Electric power utilization
Garbage Collection
Semiconductor materials
Degradation
Volatiles
Design
Power Consumption
Updating
Semiconductors
Table
High Speed

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

A Design of Flash Memory File System for Embedded Systems. / Ishizumi, Noritaka; Saisho, Keizo; Fukuda, Akira.

In: Systems and Computers in Japan, Vol. 35, No. 1, 01.01.2004, p. 91-100.

Research output: Contribution to journalArticle

Ishizumi, Noritaka ; Saisho, Keizo ; Fukuda, Akira. / A Design of Flash Memory File System for Embedded Systems. In: Systems and Computers in Japan. 2004 ; Vol. 35, No. 1. pp. 91-100.
@article{3e6c8f9680be401fa4156c6f2c4e31d2,
title = "A Design of Flash Memory File System for Embedded Systems",
abstract = "Flash memory, which has advantages of nonvolatility, high density, little power consumption, and low cost, has been employed as memory device for small and portable embedded devices. Flash memory, however, is slower in writing data compared with volatile semiconductor memory such as DRAM, and requires a time-consuming block erase operation for data rewriting. The block erase operation should be avoided as far as possible because there is a limit in the number of erases. In this paper, a file system for flash memory that realizes high-speed data access and high durability is proposed, and designed and implemented. Specifically speaking, the life of flash memory is prolonged by using linked lists for file management to avoid concentration of rewriting on specific erase blocks. Furthermore, write operations are speeded-up by writing only the difference in update, and the number of block erase operations is reduced by updating links through appending operations. The result of experiments showed that concentration of block erase operations on specific blocks, which is normal in conventional table management methods, could be avoided by using linked lists for file management. Appending operations produced little degradation of storage usage even if the file size was fairly smaller compared with the size of an erase block. However, there were cases where multiple garbage collections were required in file writing, and it took several times longer than usual cases. Thus, it is necessary to improve file writing for practical application.",
author = "Noritaka Ishizumi and Keizo Saisho and Akira Fukuda",
year = "2004",
month = "1",
day = "1",
doi = "10.1002/scj.1227",
language = "English",
volume = "35",
pages = "91--100",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "1",

}

TY - JOUR

T1 - A Design of Flash Memory File System for Embedded Systems

AU - Ishizumi, Noritaka

AU - Saisho, Keizo

AU - Fukuda, Akira

PY - 2004/1/1

Y1 - 2004/1/1

N2 - Flash memory, which has advantages of nonvolatility, high density, little power consumption, and low cost, has been employed as memory device for small and portable embedded devices. Flash memory, however, is slower in writing data compared with volatile semiconductor memory such as DRAM, and requires a time-consuming block erase operation for data rewriting. The block erase operation should be avoided as far as possible because there is a limit in the number of erases. In this paper, a file system for flash memory that realizes high-speed data access and high durability is proposed, and designed and implemented. Specifically speaking, the life of flash memory is prolonged by using linked lists for file management to avoid concentration of rewriting on specific erase blocks. Furthermore, write operations are speeded-up by writing only the difference in update, and the number of block erase operations is reduced by updating links through appending operations. The result of experiments showed that concentration of block erase operations on specific blocks, which is normal in conventional table management methods, could be avoided by using linked lists for file management. Appending operations produced little degradation of storage usage even if the file size was fairly smaller compared with the size of an erase block. However, there were cases where multiple garbage collections were required in file writing, and it took several times longer than usual cases. Thus, it is necessary to improve file writing for practical application.

AB - Flash memory, which has advantages of nonvolatility, high density, little power consumption, and low cost, has been employed as memory device for small and portable embedded devices. Flash memory, however, is slower in writing data compared with volatile semiconductor memory such as DRAM, and requires a time-consuming block erase operation for data rewriting. The block erase operation should be avoided as far as possible because there is a limit in the number of erases. In this paper, a file system for flash memory that realizes high-speed data access and high durability is proposed, and designed and implemented. Specifically speaking, the life of flash memory is prolonged by using linked lists for file management to avoid concentration of rewriting on specific erase blocks. Furthermore, write operations are speeded-up by writing only the difference in update, and the number of block erase operations is reduced by updating links through appending operations. The result of experiments showed that concentration of block erase operations on specific blocks, which is normal in conventional table management methods, could be avoided by using linked lists for file management. Appending operations produced little degradation of storage usage even if the file size was fairly smaller compared with the size of an erase block. However, there were cases where multiple garbage collections were required in file writing, and it took several times longer than usual cases. Thus, it is necessary to improve file writing for practical application.

UR - http://www.scopus.com/inward/record.url?scp=0346686124&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346686124&partnerID=8YFLogxK

U2 - 10.1002/scj.1227

DO - 10.1002/scj.1227

M3 - Article

AN - SCOPUS:0346686124

VL - 35

SP - 91

EP - 100

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 1

ER -