Volume 7 Number 3 (Mar. 2012)
Home > Archive > 2012 > Volume 7 Number 3 (Mar. 2012) >
JCP 2012 Vol.7(3): 810-818 ISSN: 1796-203X
doi: 10.4304/jcp.7.3.810-818

Cleaning Process with Efficient Allocation Scheme Improves Flash Memory Performance

Amir Rizaan Rahiman1, Putra Sumari2
1Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang, Selangor, Malaysia
2School of Computer Sciences, Universiti Sains Malaysia, Penang, Malaysia


Abstract—Flash memory is a non-volatile storage device that offers lots of superiority features. However, it has two characteristics namely: 1) Out-place updating and 2) Cleaning process that affects its performance as an efficient storage sub-system. Both characteristics influence the access time requirement in enabling the continuity of data storing and updating. In this paper, we propose an efficient data allocation scheme that takes into account the data popularity as the main indicator in making the allocation decision. Then, we unveil the importance of the allocation scheme in the block cleaning algorithm process. The simulation studies have shown that the integration between the block cleaning algorithm and the proposed data allocation scheme has significant impact on the cleaning process performance in terms of the number of block erasure operation and the number of active block requirements.

Index Terms—Flash memory, cleaning, algorithm, allocation, simulation.

[PDF]

Cite: Amir Rizaan Rahiman, Putra Sumari, "Cleaning Process with Efficient Allocation Scheme Improves Flash Memory Performance," Journal of Computers vol. 7, no. 3, pp. 810-818, 2012.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Feb 22, 2019 News!

    Vol 14, No 2 has been published with online version 8 papers are published in this issue after peer review   [Click]

  • Read more>>