WO2024119775A1

WO2024119775A1 - Raid card node updating method and system, and related apparatus

Info

Publication number: WO2024119775A1
Application number: PCT/CN2023/101696
Authority: WO
Inventors: 李飞龙; 许永良; 孙明刚
Original assignee: 苏州元脑智能科技有限公司
Priority date: 2022-12-06
Filing date: 2023-06-21
Publication date: 2024-06-13
Also published as: CN115576501B; CN115576501A

Abstract

A RAID card node updating method, which comprises: when detecting a node update instruction, determining an update type of the node update instruction (S101); if the node update instruction is a capacity expansion instruction, applying for an idle cache node from a global idle cache node linked list, and inserting the idle cache node into a designated position corresponding to the capacity expansion instruction (S102); and if the node update instruction is a capacity reduction instruction, deleting from bidirectional linked list metadata a target cache node corresponding to the capacity reduction instruction, and releasing the deleted target cache node back to the global idle cache nodes (S103). The invention greatly reduces CPU resource utilization and greatly increases the rate of RAID array online capacity expansion and online capacity reduction. Additionally provided are a RAID card node updating system, a non-volatile computer readable storage medium, and a storage device.

Description

A node update method, system and related device of RAID card

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to a Chinese patent application filed with the China Patent Office on December 6, 2022, with application number 202211554112.2, and entitled “A node update method, system and related device for a RAID card”, the entire contents of which are incorporated by reference in this application.

Technical Field

The present application relates to the field of data storage, and in particular to a node updating method, system and related device of a RAID card.

Background technique

In the field of storage, there are currently soft RAID storage technology and hard RAID storage technology in the industry. As the name suggests, soft RAID storage technology uses software to manage stripes and blocks in the RAID array, while hard RAID storage technology (i.e. RAID card) manages data through hardware. A RAID card controller is added to the RAID card. The RAID card controller is a chip composed of a series of components such as I/O processor, disk controller, disk connector and cache.

Since the industry uses a one-dimensional linear table metadata organization method to manage cache nodes, the insertion and deletion of cache nodes is very cumbersome and requires a large amount of data movement. This not only reduces the cache performance of the RAID card, but also slows down the online expansion and reduction of the RAID array, affecting user business and causing a decline in user experience.

Summary of the invention

The purpose of the present application is to provide a node update method for a RAID card, a node update system for a RAID card, a computer non-volatile readable storage medium and a storage device, which can improve the update efficiency of a RAID array.

In order to solve the above technical problems, the present application provides a node update method of a RAID card, and the specific technical solution is as follows:

When a node update instruction is detected, determining an update type of the node update instruction;

If the node update instruction is an expansion instruction, apply for an idle cache node from the global idle cache node list, and insert the idle cache node into the specified position corresponding to the expansion instruction;

If the node update instruction is a shrinking instruction, the target cache node corresponding to the shrinking instruction is deleted in the bidirectional linked list metadata, and the deleted target cache node is released back to the global free cache node linked list.

Optionally, before detecting the node update instruction, the following is also included:

Get user command parameters;

Determine a mapping relationship between at least two blocks and a volume;

A lookup table is generated according to the mapping relationship and stored in the cache node; wherein the lookup table is used to maintain the mapping relationship between the logical address of the volume and the physical address in the RAID card.

Optionally, the cache node includes a cache node ID, a lookup table, a pointer to a cache area, a pointer to a previous cache node, and a pointer to a next cache node.

Optionally, also include:

Get the RAID array creation command;

Generate bidirectional linked list metadata according to the RAID array creation command;

Generate a global free cache node list according to the RAID array creation command.

Optionally, after generating the bidirectional linked list metadata and the global free cache node linked list according to the RAID array creation command, the following is further included:

The mapping relationship between volumes and blocks is stored in the lookup table of the corresponding cache node.

Optionally, the command to obtain the RAID array creation command includes:

Use the RAID card controller to obtain the RAID array creation command issued by the host.

Optionally, after inserting the idle cache node into the specified position corresponding to the capacity expansion instruction, the method further includes:

Modify the pointer information in the cache node corresponding to the specified position.

Optionally, modifying the pointer information in the cache node corresponding to the specified position includes:

The front pointer of the cache node to be inserted is pointed to the cache node before the specified position, and the back pointer of the cache node to be inserted is pointed to the cache node after the specified position.

Optionally, modifying the pointer information in the cache node corresponding to the specified position also includes:

Modify the pointer information of the previous cache node and the next cache node at the specified location.

Optionally, after deleting the target cache node corresponding to the shrink instruction in the bidirectional linked list metadata, the following further includes:

Modify the pointer information in the cache nodes before and after the target cache node.

Optionally, the pointer information in the cache node before and after modifying the target cache node includes:

The back pointer of the previous cache node of the target cache node is pointed to the next cache node of the target cache node, and the front pointer of the next cache node of the target cache node is pointed to the previous cache node of the target cache node.

Optionally, the bidirectional linked list metadata generated according to the RAID array creation command includes:

Parse the RAID array creation command and confirm the mapping relationship between volumes and blocks;

Create a bidirectional linked list metadata based on the mapping relationship between volumes and blocks.

Optionally, after creating the bidirectional linked list metadata based on the mapping relationship between volumes and blocks, it also includes:

The doubly linked list metadata is stored in the cache node's lookup table.

Optionally, generating a global free cache node linked list according to a RAID array creation command includes:

The RAID card controller is used to generate a global free cache node linked list according to a RAID array creation command.

Optionally, if the node update instruction is a capacity expansion instruction, applying for an idle cache node from the global idle cache node list includes:

If the node update instruction is an expansion instruction, the number of nodes corresponding to the expansion node is determined, and idle cache nodes that meet the number of nodes are applied for from the global idle cache node list.

If the node update instruction is an expansion instruction, the node parameters corresponding to the expansion node are determined, and an idle cache node that meets the node parameters is applied for from the global idle cache node list.

Optionally, if the node update instruction is a shrink instruction, deleting the target cache node corresponding to the shrink instruction in the bidirectional linked list metadata includes:

If the node update instruction is a shrink instruction, determine the target node position of the target cache node corresponding to the instruction;

Delete the target cache node corresponding to the target node position in the bidirectional linked list metadata.

The present application also provides a node update system for a RAID card, comprising:

A type detection module, which is used to determine the update type of the node update instruction when the node update instruction is intentionally detected;

The expansion module is used to apply for an idle cache node from a global idle cache node list if the node update instruction is an expansion instruction, and insert the idle cache node into a designated position corresponding to the expansion instruction;

The shrinking module is used to delete the target cache node corresponding to the shrinking instruction in the bidirectional linked list metadata if the node update instruction is a shrinking instruction, and release the deleted target cache node back to the global free cache node linked list.

Optionally, also include:

The lookup table generation module is used to obtain user command parameters; determine the mapping relationship between at least two blocks and the volume; generate a lookup table based on the mapping relationship and store it in the cache node; wherein the lookup table is used to maintain the mapping relationship between the logical address of the volume and the physical address in the RAID card.

Optionally, also include:

RAID control module, used to obtain RAID array creation command; generate a bidirectional chain according to the RAID array creation command Table metadata; Generate a global free cache node list according to the RAID array creation command.

Optionally, also include:

The storage module is used to store the mapping relationship between the volume and the block in the lookup table of the corresponding cache node.

Optionally, the RAID control module includes:

The command acquisition unit is used to use the RAID card controller to acquire the RAID array creation command sent by the host.

Optionally, also include:

The pointer modification module is used to modify the pointer information in the cache node corresponding to the specified position.

Optionally, the pointer modification module is a module for pointing the front pointer of the cache node to be inserted into the cache node to the previous cache node at the specified position, and for pointing the back pointer of the cache node to be inserted into the cache node to the next cache node at the specified position.

Optionally, also include:

The second pointer modification module is used to modify the pointer information of the previous cache node and the next cache node of the specified position.

Optionally, also include:

The third pointer modification module is used to modify the pointer information in the cache nodes before and after the target cache node.

Optionally, the pointer modification module is a module for pointing the back pointer of the previous cache node of the target cache node to the next cache node of the target cache node, and pointing the front pointer of the next cache node of the target cache node to the previous cache node of the target cache node.

Optionally, the RAID control module includes:

The bidirectional linked list creation unit is used to parse the RAID array creation command, confirm the mapping relationship between the volume and the block; and create the bidirectional linked list metadata according to the mapping relationship between the volume and the block.

Optionally, also include:

The bidirectional linked list storage unit is used to store the bidirectional linked list metadata in the lookup table of the cache node.

Optionally, the RAID control module includes:

The global free cache node linked list creation unit is used to generate a global free cache node linked list according to a RAID array creation command by using a RAID card controller.

Optionally, the expansion module is a module used to determine the number of nodes corresponding to the expansion node if the node update instruction is an expansion instruction, and to apply for free cache nodes that meet the number of nodes from a global free cache node linked list.

Optionally, the expansion module is a module used to determine node parameters corresponding to the expansion node if the node update instruction is an expansion instruction, and to apply for an idle cache node that meets the node parameters from a global idle cache node linked list.

Optionally, the shrinking module is a module used to determine the target node position of the target cache node corresponding to the instruction if the node update instruction is a shrinking instruction; and to delete the target cache node corresponding to the target node position in the bidirectional linked list metadata.

The present application also provides a computer non-volatile readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the above method are implemented.

The present application also provides a storage device, including a memory and a processor, wherein a computer program is stored in the memory, and the steps of the above method are implemented when the processor calls the computer program in the memory.

The present application provides a node update method for a RAID card, comprising: when a node update instruction is detected, determining the update type of the node update instruction; if the node update instruction is an expansion instruction, applying for a free cache node from a global free cache node linked list, and inserting the free cache node into a specified position corresponding to the expansion instruction; if the node update instruction is a reduction instruction, deleting a target cache node corresponding to the reduction instruction in metadata of a bidirectional linked list, and releasing the deleted target cache node back to the global free cache node linked list.

This application uses a two-way linked list metadata organization method to manage cache nodes. There is no need to move a large amount of data when inserting or deleting cache nodes. It not only simplifies the algorithm, but also greatly reduces the CPU resource utilization rate. At the same time, it can greatly improve the rate of online expansion and online reduction of the RAID array. In addition, since this application can improve the cache performance of the RAID card, it can effectively reduce the risk probability of inconsistency of stripes in the RAID array. And this application is not only applicable to online expansion and online reduction of RAID cards, but also to soft RAID storage technology.

The present application also provides a node update system for a RAID card, a computer non-volatile readable storage medium, and a storage device, which have the above-mentioned beneficial effects and will not be described in detail here.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are merely embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

FIG1 is a schematic diagram of a cache node structure provided by the present application;

FIG2 is a schematic diagram of managing cache nodes using one-dimensional linear table metadata provided by the present application;

FIG3 is a flow chart of a node updating method of a RAID card provided in an embodiment of the present application;

FIG4 is a schematic diagram of an online expansion cache node of a RAID array provided in an embodiment of the present application;

FIG5 is a schematic diagram of the structure of a node update system of a RAID card provided in an embodiment of the present application;

FIG6 is a schematic diagram of the structure of a storage device provided by the present application.

Detailed ways

In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

Refer to FIG. 1 , which is a schematic diagram of managing cache nodes using one-dimensional linear list metadata. In FIG. 1 , cache node [cache node [100 indicates a one-dimensional linear list metadata organization method.

At present, the existing RAID card controller in the industry will generate a cache node for managing cache when creating a RAID array, and manage the cache node in a one-dimensional linear table metadata organization method. As shown in Figure 1, the RAID card controller creates a RAID5 array consisting of 4 member disks, and the mapping relationship between the volume maintained by the cache node and the RAID array is shown by the arrow in Figure 1. It should be noted that at least two strips in the stripe (201 in Figure 1 indicates stripe 0) are located on different physical disks. When creating a RAID array, the mapping relationship between at least two strips and the volume will be determined according to the command parameters entered by the user, and the mapping relationship will be generated into a lookup table and stored in the cache node. In fact, the lookup table maintains the mapping relationship between the host I/O (input/output) request LBA (logical block address) address and the storage medium PBA (physical block address) address in the RAID array. The LBA address of the host I/O request is the LBA address of the volume. When the write strategy is the WB (write-back) strategy, the cache module in the RAID card controller temporarily stores the write I/O data in the cache and immediately sends a data write completion signal to the host. The write I/O data in the cache will be concurrently written to each disk in the RAID array by multiple threads in the thread pool.

Among them, each cache node has its own cache node ID field, which plays an identification role. The cache node maintains a pointer to the cache area, which points to the specific area in the cache where the write I/O data needs to be temporarily stored. When executing the business logic of online expansion or online reduction of the RAID array, the mapping relationship maintained by the lookup table field in the cache node will change. Referring to Figure 2, the one-dimensional linear table metadata indicated by 100 in Figure 2 also needs to first move cache node [3], cache node [4], and cache node [5] backward by one cache node position, that is, it is necessary to write these three cache nodes to adjacent positions in sequence, and then write cache node [6] to the position indicated by 105 in Figure 2. In summary, it can be observed that using a one-dimensional linear table metadata organization method to manage cache nodes not only consumes a large amount of CPU (central processing unit) resources, but also reduces the cache performance of the RAID card, causing the online expansion and online reduction process of the RAID array to slow down, reducing the user experience. At the same time, if the user chooses the WB strategy for writing I/O data in order to reduce the response delay to the host, and does not choose the WT (write-through) strategy, when the RAID card needs to process a large number of host I/O requests, due to the above-mentioned low RAID card cache performance, the risk probability of inconsistency of stripes in the RAID array will eventually increase greatly.

To solve the above technical problem, please refer to FIG. 3 , which is a flow chart of a node update method of a RAID card provided in an embodiment of the present application, the method comprising:

S101: When a node update instruction is detected, determining an update type of the node update instruction;

S102: If the node update instruction is a capacity expansion instruction, apply for an idle cache node from a global idle cache node linked list, and insert the idle cache node into a designated position corresponding to the capacity expansion instruction;

S103: If the node update instruction is a shrink instruction, the target cache node corresponding to the shrink instruction is deleted from the metadata of the bidirectional linked list, and the deleted target cache node is released back to the global free cache node linked list.

There is no limitation on how to detect the node update instruction. It can be automatically generated when there is a node update demand, or the user can send the node update instruction through the host. At the same time, there is no limitation on the specific content of the node update instruction, which should depend on its update type. The update type of the node update instruction should include at least two types: expansion instruction and reduction instruction, that is, increasing cache nodes or reducing cache nodes.

The following describes the expansion and reduction instructions respectively:

When the node update instruction is a capacity expansion instruction, an idle cache node is requested from a global idle cache node linked list, and the idle cache node is inserted into a designated position corresponding to the capacity expansion instruction.

When the node update instruction is a shrinking instruction, the target cache node corresponding to the shrinking instruction is deleted in the bidirectional linked list metadata, and the deleted target cache node is released back to the global free cache node.

This embodiment assumes that before executing the process, a global idle cache node list needs to be generated. There is no limitation on how to generate the global idle cache node list. A feasible method may include the following steps:

Step 1: Get the RAID array creation command;

Step 2: Generate bidirectional linked list metadata according to the RAID array creation command;

Step 3: Generate a global free cache node list according to the RAID array creation command.

When generating the bidirectional linked list metadata, the RAID array creation command can be parsed to confirm the mapping relationship between the volume and the block, and then the bidirectional linked list metadata is created according to the mapping relationship between the volume and the block. Thereafter, the bidirectional linked list metadata can be stored in the lookup table of the cache node.

Of course, in other embodiments, the bidirectional linked list metadata and the global free cache node linked list may not have a predetermined generation order, and the two may be generated one after the other or simultaneously. When creating, the RAID card controller may be used to generate the global free cache node linked list according to the RAID array creation command. Similarly, the bidirectional linked list metadata may also be generated using the RAID card controller.

In addition, the cache node maintains a mapping relationship between the logical address of the volume and the physical address in the RAID card, that is, a lookup table, which can be generated according to user command parameters. The cache node in this embodiment may include a cache node ID, a lookup table, a pointer to the cache area, a pointer to the previous cache node, and a pointer to the next cache node.

The pointer to the next cache node points to the next cache node in the doubly linked list and may also be referred to as a back pointer. Similarly, the pointer to the previous cache node points to the previous cache node in the bidirectional linked list, which can also be called the front pointer. In this way, when expanding the member disk, for example, when expanding the RAID5 array composed of 4 member disks to 5 member disks online, there is no need to move a large number of cache nodes, and only the cache node to be inserted needs to be inserted into the specified position. After inserting the idle cache node into the specified position corresponding to the expansion instruction, the pointer information in the cache node corresponding to the specified position needs to be modified. That is, the front pointer of the cache node to be inserted points to the previous cache node of the specified position, and the back pointer of the cache node to be inserted points to the next cache node of the specified position. Similarly, the pointer information of the front and back cache nodes also needs to be modified, that is, the pointer information of the previous cache node and the next cache node at the specified position is modified respectively. Specifically, the back pointer of the cache node before the target cache node can be pointed to the next cache node of the target cache node, and the front pointer of the cache node after the target cache node can be pointed to the previous cache node of the target cache node.

The RAID card maintains a global free cache node list. When a cache node needs to be inserted during online capacity expansion of the RAID array, an application for a free cache node is made from the global free cache node list. Similarly, when a cache node needs to be deleted during online capacity reduction of the RAID array, the deleted cache node is released back to the global free cache node list.

Specifically, when expanding capacity, the number of nodes corresponding to the expanded node can be determined first, and idle cache nodes that meet the number of nodes can be applied for from the global idle cache node list. Node parameters corresponding to the expanded node can also be determined, and idle cache nodes that meet the node parameters can be applied for from the global idle cache node list.

Similarly, if the node update instruction is a shrinking instruction, the target node position of the target cache node corresponding to the instruction is determined, and the target cache node corresponding to the target node position is deleted in the bidirectional linked list metadata. At this time, the deleted target node can be released back to the global free cache node linked list so that it can continue to be used when the expansion is performed later.

See Figure 4, which is a schematic diagram of a RAID array online expansion cache node provided by an embodiment of the present application. In Figure 4, 200 indicates a lookup table, that is, the lookup_table (field name) field, which is used to maintain the mapping relationship between volume (volume name) and strip blocks in the RAID array. The data cache host indicated by 201 corresponds to the cache_ptr (field name) field, which points to the specific area where write I/O data needs to be temporarily stored in the cache. The front pointer and the back pointer introduced above indicated by 202 can correspond to the pre_pointer (field name) field and the next_pointer (field name) field.

As shown in Figure 4, during the online expansion of the RAID array, cache nodes [3], [4], and [5] do not need to be written to adjacent locations in sequence, that is, there is no need to move a large amount of data. Instead, they are requested from the global free cache node list. The two cache nodes are cache node [6] and cache node [7] in Figure 6. The back pointer of cache node [2] points to cache node [6], and the front pointer of cache node [3] points to cache node [6]. Then the front pointer of cache node [6] points to cache node [2], and the back pointer of cache node [6] points to cache node [3]. It can be seen from this that the method of managing cache nodes using a bidirectional linked list metadata organization method in the present application does not require a large amount of mobile data. Instead, it simplifies the algorithm process through the application of pointers and greatly reduces the CPU usage rate. In addition, when the RAID card executes the online expansion and online reduction business logic, the method proposed in the present application can improve the cache performance of the RAID card, thereby effectively reducing the risk probability of inconsistent stripes in the RAID array.

Based on the above, a specific implementation process of this application can be as follows:

Step 1: The RAID card controller parses the command issued by the user to create a RAID array.

Step 2: The RAID card controller generates a bidirectional linked list metadata and a global free cache node linked list.

Step 3: The RAID card controller stores the mapping relationship between the generated volume and strip blocks in the lookup table of the cache node managed by the bidirectional linked list metadata organization method.

Step 4: When issuing a node update instruction, determine the update type of the node update instruction.

Step 5: If the capacity is expanded online, the RAID card controller generates a new volume-to-strip mapping relationship and stores this mapping relationship in the cache node's lookup table.

Step 6: Apply for an idle cache node from the global idle cache node list maintained by the RAID card.

Step 7: Insert the idle cache node into the specified position of the cache node managed by the bidirectional linked list metadata organization method.

A node updating system for a RAID card provided in an embodiment of the present application is introduced below. The node updating system for a RAID card described below and a node updating method for a RAID card described above can refer to each other.

Referring to FIG. 5 , FIG. 5 is a schematic diagram of a node update system structure of a RAID card provided in an embodiment of the present application. The present application further provides a node update system of a RAID card, including:

The embodiment of the present application realizes the management of cache nodes by using a bidirectional linked list metadata organization method through an application type detection module, a capacity expansion module and a capacity reduction module. When inserting or deleting a cache node, there is no need to move a large amount of data, which not only simplifies the algorithm, but also It not only greatly reduces the CPU resource usage, but also greatly improves the rate of online expansion and online reduction of the RAID array.

Based on the above embodiments, as a preferred embodiment, it also includes:

Based on the above embodiments, as a preferred embodiment, the cache node includes a cache node ID, a lookup table, a pointer to a cache area, a pointer to a previous cache node, and a pointer to a next cache node.

Based on the above embodiments, as a preferred embodiment, it also includes:

The RAID control module is used to obtain a RAID array creation command; generate a bidirectional linked list metadata according to the RAID array creation command; and generate a global free cache node linked list according to the RAID array creation command.

Based on the above embodiments, as a preferred embodiment, it also includes:

Based on the above embodiment, as a preferred embodiment, the RAID control module includes:

Based on the above embodiments, as a preferred embodiment, it also includes:

Based on the above embodiments, as a preferred embodiment, the pointer modification module is a module for pointing the front pointer of the cache node to be inserted into the cache node to the previous cache node at the specified position, and pointing the back pointer of the cache node to be inserted into the cache node to the next cache node at the specified position.

Based on the above embodiments, as a preferred embodiment, it also includes:

Based on the above embodiments, as a preferred embodiment, the pointer modification module is a module used to point the back pointer of the previous cache node of the target cache node to the next cache node of the target cache node, and to point the front pointer of the next cache node of the target cache node to the previous cache node of the target cache node.

The bidirectional linked list creation unit is used to parse the RAID array creation command and confirm the mapping relationship between volumes and blocks; Create a doubly linked list metadata based on the mapping relationship between the blocks.

Based on the above embodiments, as a preferred embodiment, it also includes:

Based on the above embodiments, as a preferred embodiment, the expansion module is a module used to determine the number of nodes corresponding to the expansion node if the node update instruction is an expansion instruction, and apply for free cache nodes that meet the number of nodes from the global free cache node list.

Based on the above embodiments, as a preferred embodiment, the expansion module is a module for determining the node parameters corresponding to the expansion node if the node update instruction is an expansion instruction, and applying for an idle cache node that meets the node parameters from the global idle cache node list.

Based on the above embodiments, as a preferred embodiment, the shrinking module is a module for determining the target node position of the target cache node corresponding to the instruction if the node update instruction is a shrinking instruction; and deleting the target cache node corresponding to the target node position in the bidirectional linked list metadata.

The present application also provides a computer non-volatile readable storage medium, on which a computer program is stored, and when the computer program is executed, the steps provided in the above embodiment can be implemented. The storage medium may include: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and other media that can store program codes.

The present application also provides a storage device, which may include a memory and a processor. A computer program is stored in the memory. When the processor calls the computer program in the memory, the steps of the method provided in the above embodiment can be implemented. Of course, the storage device may also include various network interfaces, power supplies and other components. Please refer to Figure 6, which is a schematic diagram of the structure of a storage device provided in an embodiment of the present application. The storage device of this embodiment may include: a processor 2101 and a memory 2102.

Optionally, the storage device may further include a communication interface 2103 , an input unit 2104 , a display 2105 , and a communication bus 2106 .

The processor 2101 , the memory 2102 , the communication interface 2103 , the input unit 2104 , and the display 2105 all communicate with each other via the communication bus 2106 .

In the embodiment of the present application, the processor 2101 may be a central processing unit (CPU), a specific application integrated circuit, a digital signal processor, a readily available programmable gate array, or other programmable logic device. wait.

The processor may call the program stored in the memory 2102. Specifically, the processor may execute the operations executed by the storage device in the above embodiment.

The memory 2102 is used to store one or more programs, which may include program codes, and the program codes include computer operation instructions. In the embodiment of the present application, the memory at least stores programs for implementing the following functions:

In one possible implementation, the memory 2102 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function, etc.; the data storage area may store data created during the use of the computer.

In addition, the memory 2102 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device or other volatile solid-state storage device.

The communication interface 2103 may be an interface of a communication module, such as an interface of a GSM module.

The present application may further include a display 2105 and an input unit 2104 and the like.

The structure of the storage device shown in FIG6 does not constitute a limitation on the storage device in the embodiment of the present application. In actual applications, the storage device may include more or fewer components than those shown in FIG6, or combine certain components.

The various embodiments in the specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other. For the system provided in the embodiment, since it corresponds to the method provided in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part description.

Specific examples are used herein to illustrate the principles and implementation methods of the present application, and the description of the above embodiments is only used to help understand the method and core ideas of the present application. It should be pointed out that for ordinary technicians in this technical field, without departing from the principles of the present application, several improvements and modifications can be made to the present application, and these improvements and modifications also fall within the scope of protection of the claims of the present application.

It should also be noted that in this specification, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variations thereof are intended to cover non- Exclusive inclusion, so that a process, method, article or device that includes a list of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of more restrictions, an element limited by the phrase "comprising a ..." does not exclude the presence of other identical elements in the process, method, article or device that includes the element.

Claims

A node update method for a RAID card, characterized by comprising:

When a node update instruction is detected, determining an update type of the node update instruction;

If the node update instruction is a capacity expansion instruction, apply for an idle cache node from a global idle cache node linked list, and insert the idle cache node into a designated position corresponding to the capacity expansion instruction;

If the node update instruction is a shrink instruction, the target cache node corresponding to the shrink instruction is deleted from the bidirectional linked list metadata, and the deleted target cache node is released back to the global free cache node linked list.
The node updating method according to claim 1, characterized in that before detecting the node updating instruction, it also includes:

Get user command parameters;

Determine a mapping relationship between at least two blocks and a volume;

A lookup table is generated according to the mapping relationship; wherein the lookup table is used to maintain a mapping relationship between the logical address of the volume and the physical address in the RAID card.
The node update method according to claim 2 is characterized in that the cache node includes a cache node ID, the lookup table, a pointer to the cache area, a pointer to the previous cache node, and a pointer to the next cache node.
The node updating method according to claim 2, further comprising:

Get the RAID array creation command;

Generate the bidirectional linked list metadata according to the RAID array creation command;

A global free cache node linked list is generated according to the RAID array creation command.
The node update method according to claim 4, characterized in that after generating the bidirectional linked list metadata and the global free cache node linked list according to the RAID array creation command, it also includes:

The mapping relationship between volumes and blocks is stored in the lookup table of the corresponding cache node.
The node updating method according to claim 4, wherein obtaining a RAID array creation command comprises:

Use the RAID card controller to obtain the RAID array creation command issued by the host.
The node updating method according to claim 3 is characterized in that after inserting the idle cache node into the specified position corresponding to the expansion instruction, it also includes:

Modify the pointer information in the cache node corresponding to the specified position.
The node updating method according to claim 7, characterized in that modifying the pointer information in the cache node corresponding to the specified position comprises:

The front pointer of the node to be inserted into the cache is pointed to the previous cache node of the specified position, and the back pointer of the node to be inserted into the cache is pointed to the next cache node of the specified position.
The node updating method according to claim 7 is characterized in that when modifying the pointer information in the cache node corresponding to the specified position, it also includes:

The pointer information of the previous cache node and the next cache node of the specified position is modified.
The node updating method according to claim 3 is characterized in that after deleting the target cache node corresponding to the shrink instruction in the bidirectional linked list metadata, it also includes:

Modify the pointer information in the cache nodes before and after the target cache node.
The node updating method according to claim 10, characterized in that modifying the pointer information in the cache nodes before and after the target cache node comprises:

The back pointer of the cache node before the target cache node is pointed to the cache node after the target cache node, and the front pointer of the cache node after the target cache node is pointed to the cache node before the target cache node.
The node update method according to claim 4, characterized in that generating the bidirectional linked list metadata according to the RAID array creation command comprises:

Parsing the RAID array creation command to confirm the mapping relationship between volumes and blocks;

A bidirectional linked list metadata is created according to the mapping relationship between the volume and the block.
The node update method according to claim 12 is characterized in that after creating the bidirectional linked list metadata according to the mapping relationship between the volume and the block, it also includes:

The bidirectional linked list metadata is stored in a lookup table of a cache node.
The node update method according to claim 4, characterized in that generating a global free cache node linked list according to the RAID array creation command comprises:

A RAID card controller is used to generate a global free cache node linked list according to the RAID array creation command.
The node update method according to claim 1, characterized in that if the node update instruction is a capacity expansion instruction, applying for an idle cache node from a global idle cache node linked list comprises:

If the node update instruction is an expansion instruction, the number of nodes corresponding to the expansion node is determined, and idle cache nodes that meet the number of nodes are applied for from a global idle cache node linked list.
The node update method according to claim 1, characterized in that if the node update instruction is a capacity expansion instruction, applying for an idle cache node from a global idle cache node linked list comprises:

If the node update instruction is an expansion instruction, the node parameters corresponding to the expansion node are determined, and an idle cache node that meets the node parameters is applied for from a global idle cache node linked list.
The node update method according to claim 1, characterized in that if the node update instruction is a shrinking instruction, deleting the target cache node corresponding to the shrinking instruction in the bidirectional linked list metadata comprises:

If the node update instruction is a shrink instruction, determining a target node position of a target cache node corresponding to the instruction;

The target cache node corresponding to the target node position is deleted from the bidirectional linked list metadata.
A node update system for a RAID card, characterized by comprising:

A type detection module, for determining an update type of the node update instruction when a node update instruction is intentionally detected;

A capacity expansion module, configured to apply for an idle cache node from a global idle cache node linked list if the node update instruction is an expansion instruction, and insert the idle cache node into a designated position corresponding to the expansion instruction;

The shrinking module is used to delete the target cache node corresponding to the shrinking instruction in the bidirectional linked list metadata if the node update instruction is a shrinking instruction, and release the deleted target cache node back to the global free cache node linked list.
A computer non-volatile readable storage medium having a computer program stored thereon, characterized in that when the computer program is executed by a processor, the steps of the node update method of the RAID card as described in any one of claims 1 to 17 are implemented.
A storage device, characterized in that it includes a memory and a processor, wherein a computer program is stored in the memory, and when the processor calls the computer program in the memory, the steps of the node update method of the RAID card as described in any one of claims 1-17 are implemented.