D. Das (Eds.) International Journal on Network Security, 2 (4):
5(October 2011)
Abstract
Flash memory is a non-volatitle memory that offers
several superior advantages as a data storage device in many
electronic gadgets. However its two operational characteristics,
namely 1) Out-place updating and 2) Cleaning process will affect
its performance as an efficient storage sub-system if not
managed wisely. This paper proposes a new block cleaning
scheme, called Greedy and Frequency-based (GR-FB). The
scheme combines the victim block selection procedure and
the valid-data re-organizing procedure to improve the block
cleaning process performance. The trace-driven simulations
have shown the GR-FB scheme performs better than existing
cleaning process schemes where the cleaning cost is reduced
at least by 8% and the wear-leveling level for all blocks in the
memory array are nearly equal.
%0 Journal Article
%1 das2011block
%D 2011
%E Das, Dr. Vinu V
%J International Journal on Network Security
%K cleaning_process data flash_memory frequency simulation wear-leveling
%N 4
%P 5
%T GR-FB Block Cleaning Scheme in Flash Memory
%U http://doi.searchdl.org/01.IJNS.2.4.512
%V 2
%X Flash memory is a non-volatitle memory that offers
several superior advantages as a data storage device in many
electronic gadgets. However its two operational characteristics,
namely 1) Out-place updating and 2) Cleaning process will affect
its performance as an efficient storage sub-system if not
managed wisely. This paper proposes a new block cleaning
scheme, called Greedy and Frequency-based (GR-FB). The
scheme combines the victim block selection procedure and
the valid-data re-organizing procedure to improve the block
cleaning process performance. The trace-driven simulations
have shown the GR-FB scheme performs better than existing
cleaning process schemes where the cleaning cost is reduced
at least by 8% and the wear-leveling level for all blocks in the
memory array are nearly equal.
@article{das2011block,
abstract = {Flash memory is a non-volatitle memory that offers
several superior advantages as a data storage device in many
electronic gadgets. However its two operational characteristics,
namely 1) Out-place updating and 2) Cleaning process will affect
its performance as an efficient storage sub-system if not
managed wisely. This paper proposes a new block cleaning
scheme, called Greedy and Frequency-based (GR-FB). The
scheme combines the victim block selection procedure and
the valid-data re-organizing procedure to improve the block
cleaning process performance. The trace-driven simulations
have shown the GR-FB scheme performs better than existing
cleaning process schemes where the cleaning cost is reduced
at least by 8% and the wear-leveling level for all blocks in the
memory array are nearly equal.},
added-at = {2012-09-25T09:28:02.000+0200},
biburl = {https://www.bibsonomy.org/bibtex/2b561ef9743422c2fce70c61d59f8156f/ideseditor},
editor = {Das, Dr. Vinu V},
interhash = {4c32f9de6e3d4d1734bf56f99f8a5cb7},
intrahash = {b561ef9743422c2fce70c61d59f8156f},
journal = {International Journal on Network Security},
keywords = {cleaning_process data flash_memory frequency simulation wear-leveling},
month = {October},
number = 4,
pages = 5,
timestamp = {2012-09-25T09:28:02.000+0200},
title = {GR-FB Block Cleaning Scheme in Flash Memory},
url = {http://doi.searchdl.org/01.IJNS.2.4.512},
volume = 2,
year = 2011
}