Flash memory offers lots of superiority features as secondary storage devices. However, it has two hardware characteristics, called, i) outplace updating scheme and ii) garbage collection policy that will affect flash memory performance. To overcome these limitations, this paper proposes an efficient data allocation scheme in the existing garbage collection policy in order to minimize the number of erasure function. The trace-driven simulation shows that the efficient allocation scheme in garbage collection policy performs better than the existing garbage collection policy in terms of the number of erasure operation. The number of block erasures be reduced at least 8% from the existing schemes.
3rd Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA 2009)
Congress
2009 Global Congress on Communications, Computers and Applications (GC-CCA 2009), 26-28 October 2009, Amman, Jordan
Pages
74-79
Topics
Embedded Systems Computer Architecture
ISSN
2227-331X
DOI
BibTeX
@inproceedings{572CCA2009,
title={Garbage Collection Process with Efficient Data Allocation Scheme in Flash Memory},
author={Rahiman Amir Rizaan, and Putra Sumari},
booktitle={2009 Global Congress on Communications, Computers and Applications (GC-CCA 2009)},
year={2009},
pages={74-79},
doi={}},
organization={Mosharaka for Research and Studies}
}
