Bitmap storage method

Abstract

The invention provides a bitmap storage method. The bitmap storage method includes the steps that stripes of a redundant array of inexpensive disks raid are evenly distributed according to the number of CPUs, and multiple blocks corresponding to the CPUs one to one are acquired, wherein each block comprises multiple raid stripes; multiple bit pairs are selected from a memory and used for representing the use states of the blocks, and a region bitmap is acquired, wherein the bit pairs comprise first bits and second bits, the first bits are used for representing whether the blocks are written or not, and the second bits are used for representing whether the blocks are initialized. By the adoption of the bitmap storage method, the IO number of the stripe blocks to which a computer has access for the first time after the computer is restarted can be reduced, the first-time IO write speed is higher after the computer is restarted, when the computer is restarted, the initialization and reconstruction progress is kept to a large degree, and multiple restarts are allowed in the reconstruction or initialization process; the storage region of the bitmap is saved, and then the probability that the bitmap in superblocks breaks down is reduced.

Description

technical field [0001] The invention relates to the technical field of computers, in particular to a bitmap storage method. Background technique [0002] In order to use the read-rewrite algorithm in the raid, it must be ensured that the raid has been initialized before the algorithm is performed, and for blocks that have not been initialized, only reconstruction and writing can be used. Therefore, during the operation of the raid, a bitmap is required to represent which stripes or blocks are initialized. [0003] In the existing technologies, there are mainly two kinds, one is to store the whole bitmap, or to store the bitmap in various blocks dispersedly. The first solution has a large area, which is not only time-consuming to access, but also has a high probability of being damaged. The second solution has a large burden on each IO, and needs to be re-read after each restart. Entering block information generally requires the initialization to be completely completed bef...

AI Technical Summary

Problems solved by technology

The first solution has a large area, which is not only time-consuming to access, but also has a high probability of being damaged. The second solution has a large burden on each IO, and needs to be re-read after each restart. Entering block information, generally requires the initialization to be completely completed before it can work normally, and requires more preparations in the early stage

Images