Linked list realization method, device, equipment and readable storage medium

Abstract

The invention discloses a linked list implementation method. The linked list implementation method comprises the steps of acquiring the number of linked lists to be implemented in a current storage system, the number of nodes included in each linked list and virtual disk index values stored in all the nodes in each linked list; recording a virtual disk index value stored by a head node in each linked list to obtain a first array; according to a preset reference value and a virtual disk index value stored by each node in each linked list, calculating an offset corresponding to each node in eachlinked list, and obtaining a second array; and determining the first array and the second array as linked lists in the current storage system. According to the method, the first array and the secondarray are used for replacing a linked list structure in the storage system, so that the linked list structure is simplified, the performance of the storage system is improved, and convenience is provided for linked list maintenance operation. Correspondingly, the invention also discloses a linked list realization device and equipment and a readable storage medium, which also have the above technical effects.

Description

technical field [0001] The present invention relates to the technical field of data storage, and more specifically, to a linked list realization method, device, equipment and readable storage medium. Background technique [0002] The linked list is one of the main data structures used by the cache module in the storage system when storing data. In the storage system, there are generally multiple linked lists, and each linked list includes multiple nodes; when you want to find a node, you need to first determine the linked list to which the node you want to find belongs, and start from the first node of the linked list, according to The next pointer is searched one by one until the node to be searched is found. That is to say, the linked list in the storage system is generally a one-way linked list. [0003] The number of virtual disks in the storage system is large, and each virtual disk needs to correspond to a different linked list, and the number of linked lists is limi...

AI Technical Summary

Problems solved by technology

Therefore, the traditional linked list implementation method is not conducive to maintenance operations such as modification, deletion, and search of the linked list, because each time it is necessary to traverse and search from the first node of a linked list

This will not only take up a lot of memory, but also make the linked list difficult to maintain, and it is easy to make mistakes when operating pointers, thus reducing the performance of the storage system

Images