Method for file storage in continuous space of flash memory in equal probability manner

Abstract

The invention provides a method for file storage in continuous space of a flash memory in an equal probability manner, wherein the storage times of storage units are controlled by sequencing the storage times, and on the basis, the storage units with same storage times are subjected to continuous space sequencing to control the continuity of file storage and realize the continuous sequencing of the storage units according to the quantity from most to least. The method comprises the following steps of: supervisory sequence storage area formatting, file storage and file deletion. According to the method disclosed by the invention, the storage units with same storage times are sequenced on the basis of the storage times sequencing, the defects that the traditional file storage operation is unbalanced and a speed of a flash file storage system is low are overcome, the service life of the file storage space is prolonged, the access efficiency of the file storage space is improved, and favorable performance and practicability are achieved.

Description

technical field [0001] The invention belongs to the technical field of data storage, in particular to a method for storing files in an equiprobable continuous space of a flash memory. Background technique [0002] Since the life of the flash memory is limited and cannot be written indefinitely, the maximum number of writes to a storage unit is generally 10 5 ~10 6 Second-rate. Therefore, in the application of NAND Flash, a certain mechanism must be adopted to ensure approximately balanced and continuous use of each storage unit, and to improve access efficiency under the premise of avoiding the premature loss of some units to reach the service life. In response to this problem, many researchers have proposed some algorithms: for example, Kawaguchi et al. proposed the Cost-Benefit strategy, Wells et al. proposed a strategy that comprehensively considers recovery efficiency and equal probability, Chiang et al. proposed CAT (Cost Age Times, referred to as CAT ) strategy, etc...

AI Technical Summary

Problems solved by technology

In response to this problem, many researchers have proposed some algorithms: for example, Kawaguchi et al. proposed the Cost-Benefit strategy, Wells et al. proposed a strategy that comprehensively considers recovery efficiency and equal probability, Chiang et al. proposed CAT (Cost Age Times, referred to as CAT ) strategy, etc., these methods mainly realize the optimization of flash memory management through garbage collection, all need to record a large number of data storage time parameters, and the calculation is more complicated, so far there is no mature one suitable for resource-limited embedded systems method of storing files in flash memory

Images