K Partition-Based Even Wear-Leveling Policy for Flash Memory 


Vol. 13,  No. 3, pp. 377-382, Jun.  2006
10.3745/KIPSTD.2006.13.3.377


PDF
  Abstract

Advantageous features of flash memory are stimulating its exploitation in mobile and ubiquitous related devices. The hardware characteristics of flash memory however place restrictions upon this current trend. In this paper, a cleaning policy for flash memory is proposed in order to decrease the necessary penalty for recycling of memory minimizing the degradation of performance at the same time. The proposed cleaning algorithm is based on partitioning of candidate memory regions, to be reclaimed as free, into a number of groups. In addition, in order to improve the balanced utilization of the entire flash memory space in terms of “wearing-out', a free segment selection algorithm is discussed. The impact of the proposed algorithms is evaluated through a number of experiments. Moreover, the composition of the optimal configuration featuring the proposed methods is tested through experiments.

  Statistics
  Cite this article

[IEEE Style]

J. H. Park, "K Partition-Based Even Wear-Leveling Policy for Flash Memory," The KIPS Transactions:PartD, vol. 13, no. 3, pp. 377-382, 2006. DOI: 10.3745/KIPSTD.2006.13.3.377.

[ACM Style]

Je Ho Park. 2006. K Partition-Based Even Wear-Leveling Policy for Flash Memory. The KIPS Transactions:PartD, 13, 3, (2006), 377-382. DOI: 10.3745/KIPSTD.2006.13.3.377.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals