Approximate Counters for Flash Memory

Jacek Cichon, Wojciech Macyna
2011 2011 IEEE 17th International Conference on Embedded and Real-Time Computing Systems and Applications  
Flash memory becomes the a very popular storage device. Due to its shock -resistance and power economy is adopted in sensor networks and embedded systems. Recently more attention is paid to the data storage in flash memory. This is not a simple issue due to the limitations of flash memory. Data in flash memory should be distributed evenly among data blocks. If the number of writes in a data block is too high, it may cause damage of the block. Requirements for highly reliable storage systems
more » ... storage systems include efficient algorithms to maximize its lifetime and tools to predict it or monitor system status. One way to achieve this goal is to embed a system of counters which could control block usage (especially erasing operations). Some solutions of this kind including necessary algorithms are patented. In this paper we propose an innovative solution involving the use of probabilistic counting of the number of block modifications. Our solution drastically reduces the number of bits needed to memorize counters. We precisely estimate the space requirements for the counter, discuss a series of experiments conforming the correctness of our approach and investigate the evolution system of counters.
doi:10.1109/rtcsa.2011.81 dblp:conf/rtcsa/CichonM11 fatcat:rwqkihtvpnbmdhngfvedwwj5ja