Method, system and storage system for organization and management of dirty data in cache

Abstract

The invention discloses a method, system and storage system for organizing and managing dirty data in a cache. The application divides the cache space into multiple cache modules, and determines multiple logical volumes according to the storage capacity of a disk array. The present application allocates a cache module for the logical volume, and the present application also sets an array corresponding to the logical volume one by one, and uses the elements in the array one by one as the root node of the red-black tree. The present application can also determine the address of the dirty block corresponding to any logical volume in the cache module, so as to determine the corresponding address of the dirty block in the corresponding logical volume, and use the corresponding address as the node of the red-black tree corresponding to the logical volume key value. Then, this application can organize the dirty blocks into a red-black tree according to the preset sorting rules of the red-black tree. The sequential access of the disk array increases the speed of flashing, shortens the time of flashing, and improves the access efficiency of the system.

Description

Technical field [0001] The present invention relates to the field of storage technologies, in particular to a tissue management method, system, and storage system for caching interril data. Background technique [0002] In the storage system, multiple disk of the system constitute a disk array, and the data stored in the cache space should be brushed into the disk array. If the data in the cache space is modified by a write operation, the data in the cache space is inconsistent with the data in the disk array, the data modified in the cache space is called dirty data. The prior art organizes the dirty data in the cache space to organize the organization of the list, the linked list is a non-continuous, non-sequential storage structure on the physical storage unit, so the dirty data in the cache space is written to the disk array, It is equivalent to random access to disk arrays, resulting in slow hardware, low efficiency. In addition, for the form of the linked list, even if the ...

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