A Study of Purity-based Page Allocation Scheme for Flash Memory File Systems 


Vol. 13,  No. 5, pp. 387-398, Oct.  2006
10.3745/KIPSTA.2006.13.5.387


PDF
  Abstract

In this paper, we propose a new page allocation scheme for flash memory file system. The proposed scheme allocates pages by exploiting the concept of purity, which is defined as the fraction of blocks where valid pages and invalid pages are coexisted. The purity determines the cost of block cleaning, that is, the portion of pages to be copied and blocks to be erased for block cleaning. To enhance the purity, the scheme classifies hot-modified data and cold-modified data and allocates them into different blocks. The hot/cold classification is based on both static properties such as attribute of data and dynamic properties such as the frequency of modifications. We have implemented the proposed scheme in YAFFS and evaluated its performance on the embedded board equipped with 400MHz XScale CPU, 64MB SDRAM, and 64MB NAND flash memory. Performance measurements have shown that the proposed scheme can reduce block cleaning time by up to 15.4 seconds with an average of 7.8 seconds compared to the typical YAFFS. Also, the enhancement becomes bigger as the utilization of flash memory increases.

  Statistics


  Cite this article

[IEEE Style]

S. J. Baek and J. M. Choi, "A Study of Purity-based Page Allocation Scheme for Flash Memory File Systems," The KIPS Transactions:PartA, vol. 13, no. 5, pp. 387-398, 2006. DOI: 10.3745/KIPSTA.2006.13.5.387.

[ACM Style]

Seung Jae Baek and Jong Moo Choi. 2006. A Study of Purity-based Page Allocation Scheme for Flash Memory File Systems. The KIPS Transactions:PartA, 13, 5, (2006), 387-398. DOI: 10.3745/KIPSTA.2006.13.5.387.