Organizing management method and system of dirty data in cache and storage system

Abstract

The invention discloses an organizing management method and system of dirty data in a cache and a storage system. According to the method, cache space is divided into multiple cache modules, and multiple logical volumes are determined according to the storage capacity of a disk array; the cache modules are distributed for the logical volumes, arrays corresponding to the logical volumes in a one-to-one mode are further arranged, and elements in the arrays serve as root nodes of a red-black tree respectively. According to the organizing management method and system of the dirty data in the cacheand the storage system, the address of a dirty block corresponding to any logical volume in the cache modules can also be determined, accordingly the corresponding address of the dirty block in the corresponding logical volume is determined, and the corresponding address serves as a key value of the node of the red-black tree corresponding to the logical volume. Then, the dirty blocks can be organized into the red-black trees according to a preset red-black tree ranking rule, the dirty data in the dirty blocks is written according to a preorder traversal mode when written to the disk array, which is equal to conducting ordered access on the disk array, the writing speed is improved, the writing time is shortened, and the accessing efficiency of the system is improved.

Description

technical field [0001] The invention relates to the field of storage technology, in particular to a method, system and storage system for organizing and managing dirty data in a cache. Background technique [0002] In the storage system, multiple disks of the system form a disk array, and the data stored in the cache space should be flushed to the disk array. If the data in the cache space is modified through a write operation, causing the data in the cache space to be inconsistent with the data in the disk array, the modified data in the cache space is called dirty data. In the prior art, the dirty data in the cache space is organized according to the organization method of the linked list. The linked list is a non-continuous and non-sequential storage structure on the physical storage unit. Therefore, when the dirty data in the cache space is written to the disk array, It is equivalent to random access to the disk array, resulting in slow flashing speed and low efficiency...

AI Technical Summary

Problems solved by technology

In the prior art, the dirty data in the cache space is organized according to the organization method of the linked list. The linked list is a non-continuous and non-sequential storage structure on the physical storage unit. Therefore, when the dirty data in the cache space is written to the disk array, It is equivalent to random access to the disk array, resulting in slow flashing speed and low efficiency

In addition, for the form of linked list, even if the dirty data in the cache space is sorted according to the address, the sorting process will be too cumbersome, resulting in long sorting time, which reduces the access efficiency of the system

Images