Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping 


Vol. 34,  No. 12, pp. 1418-1425, Dec.  2009


PDF
  Abstract

This paper proposes a novel FTL (Flash Translation Layer) algorithm based on sector-level mapping to reduce the number of total erase operations in flash memory accesses. The proposed algorithm can reduce the number of erase operations by utilizing the sector-level mapping table when writing data at flash memory. Sector-level mapping technique reduces flash memory access time and extendsthe life time of the flash memory. In the algorithm, wear-leveling is implemented by selecting victim blocks having the minimal number of erase operations, when empty spaces for write are not available. To evaluate the performance of the proposed FTL algorithm, experiments were performed on several applications, such as MP3 players, MPEG players, web browsers and document editors. The proposed algorithm reduces the number of erase operations by 72.4% and 61.9%, when compared with well-known BAST and FAST algorithms, respectively.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. Yoon, K. Kim, S. Hwang, "Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1418-1425, 2009. DOI: .

[ACM Style]

Tae-Hyun Yoon, Kwang-Soo Kim, and Sun-Young Hwang. 2009. Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping. The Journal of Korean Institute of Communications and Information Sciences, 34, 12, (2009), 1418-1425. DOI: .

[KICS Style]

Tae-Hyun Yoon, Kwang-Soo Kim, Sun-Young Hwang, "Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1418-1425, 12. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880