Super block management method and device and electronic equipment

Abstract

The invention provides a super block management method, a super block management device and electronic equipment. The super block management method comprises the following steps: acquiring target storage blocks in storage units in a plurality of NandFlash; the block numbers of the target storage blocks are the same; initializing a minimum reactor container; constructing a super block according to the target storage block; writing a first data structure of a first sub-super block which is fully written with data in the super block into a first minimum heap in the minimum heap container; writing a second data structure of a second sub-super block in the super block, the state of which is unwritten data, into a second minimum heap in the minimum heap container; and managing a write operation and a garbage collection operation of the super block through the first minimum heap and the second minimum heap. According to the method, the garbage collection and wear leveling algorithm efficiency of the SSD firmware is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of data storage, and in particular to a super block management method, device and electronic equipment. Background Art

[0002] Solid-state drives (SSDs) are widely used in consumer and enterprise storage. Currently, SSDs use Nand Flash as the medium. Due to the physical characteristics of Nand Flash, the firmware in the industry's solid-state drives needs to perform wear leveling and garbage collection tasks regularly.

[0003] Currently, the technical problem of how to improve the efficiency of garbage collection and wear leveling algorithms in SSD firmware needs to be solved urgently. Summary of the invention

[0004] The purpose of the present invention is to provide a super block management method, device and electronic device to solve the technical problem of improving the efficiency of garbage collection and wear leveling algorithms of SSD firmware, thereby improving the garbage collection and wear leveling performance of SSD firmware.

[0005] In the first aspect, an embodiment of the present invention provides a super block management method, including: obtaining target storage blocks in storage units in multiple NandFlash; the block numbers of the above target storage blocks are the same; initializing a minimum heap container; constructing a super block according to the above target storage block; writing a first data structure of a first sub-super block in the above super block that is in a state of being full of data into a first minimum heap in the above minimum heap container; and writing a second data structure of a second sub-super block in the above super block that is in a state of not having written data into a second minimum heap in the above minimum heap container; managing the write operation and garbage collection operation of the above super block through the first minimum heap and the second minimum heap.

[0006] In a preferred embodiment of the present invention, the key of the above-mentioned first minimum heap is the number of available resources of the above-mentioned first data structure; the minimum heap header of the above-mentioned first minimum heap is the target first sub-super block with the smallest number of available resources in the above-mentioned first data structure; the key of the above-mentioned second minimum heap is the number of erasures of the above-mentioned second data structure; the minimum heap header of the above-mentioned second minimum heap is the target second sub-super block with the smallest number of erasures in the above-mentioned second data structure.

[0007] In a preferred embodiment of the present invention, the step of managing the write operation of the super block through the first minimum heap and the second minimum heap includes: when a write command is received, retrieving the target second sub-super block from the second minimum heap; according to the write command, performing a write operation on the target second sub-super block until the target second sub-super block is full, thereby obtaining a target second sub-super block full of data; and placing the target second sub-super block full of data into the first minimum heap.

[0008] In a preferred embodiment of the present invention, after the step of retrieving the target second sub-super block from the second minimum heap, the method includes: placing the target third sub-super block with the smallest number of erase times in the second data structure into the minimum heap head of the second minimum heap.

[0009] In a preferred embodiment of the present invention, the step of placing the target second sub-super block filled with data into the first minimum heap includes: running a minimum heap push operation to place the target second sub-super block filled with data into the first minimum heap.

[0010] In a preferred embodiment of the present invention, the step of managing the garbage collection operation of the super block through the first minimum heap and the second minimum heap includes: when it is detected that the super block reaches the preset garbage collection condition, retrieving the target first sub-super block from the first minimum heap; based on the preset garbage collection operation instruction, performing garbage collection operation on the target first sub-super block to obtain the target first sub-super block after garbage collection; and placing the target first sub-super block after garbage collection into the second minimum heap.

[0011] In a preferred embodiment of the present invention, after the step of retrieving the target first sub-super block from the first minimum heap, the method includes: placing the target fourth sub-super block with the smallest number of available resources in the first data structure into the minimum heap head of the first minimum heap.

[0012] In a preferred embodiment of the present invention, the step of placing the target first sub-super block after garbage collection into the second minimum heap includes: running a minimum heap push operation to place the target first sub-super block after garbage collection into the second minimum heap.

[0013] In the second aspect, an embodiment of the present invention provides a super block management method, including: a storage block acquisition module, used to acquire target storage blocks in storage units in multiple NandFlash; the block numbers of the above target storage blocks are the same; a minimum heap container initialization module, used to initialize the minimum heap container; a super block construction module, used to construct a super block according to the above target storage block; a data structure writing module, used to write the first data structure of the first sub-super block in the above super block that is full of data into the first minimum heap in the above minimum heap container; and, write the second data structure of the second sub-super block in the above super block that is not written to data into the second minimum heap in the above minimum heap container; a management module, used to manage the write operation and garbage collection operation of the above super block through the first minimum heap and the second minimum heap.

[0014] In a third aspect, an embodiment of the present invention further provides an electronic device, comprising a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the super block management method.

[0015] The embodiments of the present invention have the following beneficial technical effects:

[0016] The embodiment of the present invention provides a super block management method, device and electronic device, including: obtaining target storage blocks in storage units in multiple NandFlash; the block numbers of the above target storage blocks are the same; initializing a minimum heap container; constructing a super block according to the above target storage block; writing the first data structure of the first sub-super block in the super block that is full of data into the first minimum heap in the above minimum heap container; and writing the second data structure of the second sub-super block in the super block that is not written data into the second minimum heap in the above minimum heap container; managing the write operation and garbage collection operation of the super block through the first minimum heap and the second minimum heap. The method manages and optimizes the super block write and garbage collection operations in multiple NandFlash through the minimum heap container, thereby improving the efficiency of the garbage collection and wear leveling algorithm of the SSD firmware. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0018] Figure 1 A schematic diagram of a process flow of a super block management method provided by an embodiment of the present invention;

[0019] Figure 2 A schematic diagram of a flow chart of another super block management method provided by an embodiment of the present invention;

[0020] Figure 3 A schematic diagram of the structure of a super block management device provided by an embodiment of the present invention;

[0021] Figure 4 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention.

[0022] Icons: 31 - storage block acquisition module; 32 - minimum heap container initialization module; 33 - super block construction module; 34 - data structure writing module; 35 - management module; 41 - memory; 42 - processor; 43 - bus; 44 - communication interface. DETAILED DESCRIPTION

[0023] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Generally, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.

[0024] Currently, the technical problem of how to improve the efficiency of garbage collection and wear leveling algorithms in SSD firmware needs to be solved urgently.

[0025] Based on this, the embodiment of the present invention provides a super block management method, device and electronic device, which improves the efficiency of garbage collection and wear leveling algorithm of SSD firmware by managing and optimizing super block writing and garbage collection operations in multiple NandFlash through a minimum heap container. For ease of understanding, a super block management method is first introduced in detail.

[0026] Example 1

[0027] In this embodiment, Figure 1 A schematic flow chart of a super block management method provided by an embodiment of the present invention.

[0028] Depend on Figure 1 As can be seen, the method includes:

[0029] Step S101: obtaining target storage blocks in storage units in a plurality of NandFlash; the block numbers of the target storage blocks are the same.

[0030] Step S102: Initialize the minimum heap container.

[0031] Step S103: construct a super block according to the target storage block.

[0032] In this embodiment, the data structure of the super block includes: the block number, valid count, PE count and super block status of the super block.

[0033] Step S104: write the first data structure of the first sub-super block in the super block that is full of data into the first minimum heap in the minimum heap container; and write the second data structure of the second sub-super block in the super block that is not written with data into the second minimum heap in the minimum heap container.

[0034] Among them, the key of the above-mentioned first minimum heap is the number of available resources in the above-mentioned first data structure; the minimum heap header of the above-mentioned first minimum heap is the target first sub-super block with the smallest number of available resources in the above-mentioned first data structure; the key of the above-mentioned second minimum heap is the number of erasures of the above-mentioned second data structure; the minimum heap header of the above-mentioned second minimum heap is the target second sub-super block with the smallest number of erasures in the above-mentioned second data structure.

[0035] Step S105: managing the write operation and garbage collection operation of the super block through the first minimum heap and the second minimum heap.

[0036] The embodiment of the present invention provides a super block management method, including: obtaining target storage blocks in storage units in multiple NandFlash; the block numbers of the target storage blocks are the same; initializing a minimum heap container; constructing a super block according to the target storage block; writing a first data structure of a first sub-super block in the super block that is full of data into a first minimum heap in the minimum heap container; and writing a second data structure of a second sub-super block in the super block that is not written data into a second minimum heap in the minimum heap container; managing the write operation and garbage collection operation of the super block through the first minimum heap and the second minimum heap. The method manages and optimizes the super block write and garbage collection operations in multiple NandFlashes through the minimum heap container, thereby improving the efficiency of the garbage collection and wear leveling algorithm of the SSD firmware.

[0037] Example 2

[0038] Based on the above embodiments, Figure 2 A schematic flow chart of another super block management method provided by an embodiment of the present invention.

[0039] Depend on Figure 2 As can be seen, the method includes:

[0040] Step S201: Acquire target storage blocks in storage units in multiple NandFlash; the block numbers of the above target storage blocks are the same.

[0041] Step S202: Initialize the minimum heap container.

[0042] Step S203: construct a super block according to the target storage block.

[0043] Step S204: write the first data structure of the first sub-super block in the super block that is full of data into the first minimum heap in the minimum heap container; and write the second data structure of the second sub-super block in the super block that is not written with data into the second minimum heap in the minimum heap container.

[0044] Step S205: When a write command is received, the target second sub-super block is retrieved from the second minimum heap.

[0045] Step S206: According to the write command, a write operation is performed on the target second sub-super block until the target second sub-super block is full, thereby obtaining a target second sub-super block full of data.

[0046] Step S207: putting the target second sub-super block filled with data into the first minimum heap.

[0047] In this embodiment, after the step of retrieving the target second sub-super block from the second minimum heap, the method includes: placing the target third sub-super block with the smallest number of erase times in the second data structure into the minimum heap head of the second minimum heap.

[0048] Furthermore, the step of placing the target second sub-super block filled with data into the first minimum heap includes: executing a minimum heap push operation to place the target second sub-super block filled with data into the first minimum heap.

[0049] Furthermore, after the above step S204, the method further includes managing the garbage collection operation of the above super block through the above first minimum heap and the above second minimum heap.

[0050] Furthermore, the step of managing the garbage collection operation of the super block through the first minimum heap and the second minimum heap includes: when it is detected that the super block reaches the preset garbage collection condition, retrieving the target first sub-super block from the first minimum heap; based on the preset garbage collection operation instruction, performing garbage collection operation on the target first sub-super block to obtain the target first sub-super block after garbage collection; and placing the target first sub-super block after garbage collection into the second minimum heap.

[0051] Furthermore, after the step of retrieving the target first sub-super block from the first minimum heap, the method includes: placing the target fourth sub-super block with the smallest number of available resources in the first data structure into the minimum heap head of the first minimum heap.

[0052] Furthermore, the step of placing the target first sub-super block after garbage collection into the second minimum heap includes: running a minimum heap push operation to place the target first sub-super block after garbage collection into the second minimum heap.

[0053] The embodiment of the present invention provides a super block management method, including: obtaining target storage blocks in storage units in multiple NandFlash; the block numbers of the above target storage blocks are the same; initializing a minimum heap container; constructing a super block according to the above target storage block; writing the first data structure of the first sub-super block in the super block that is full of data into the first minimum heap in the above minimum heap container; and writing the second data structure of the second sub-super block in the super block that is not written data into the second minimum heap in the above minimum heap container; when receiving a write command, calling the above target second sub-super block from the above second minimum heap; according to the above write command, performing a write operation on the above target second sub-super block until the above target second sub-super block is full of data, and obtaining the target second sub-super block full of data; putting the above target second sub-super block full of data into the above first minimum heap. The method improves the efficiency of garbage collection and wear leveling algorithms of SSD firmware by managing and optimizing super block write operations in multiple NandFlash through a minimum heap container.

[0054] Example 3

[0055] Based on the above embodiments, Figure 3 A schematic diagram of the structure of a super block management device provided by an embodiment of the present invention.

[0056] Depend on Figure 3 As can be seen, the device includes:

[0057] The storage block acquisition module 31 is used to acquire target storage blocks in storage units in multiple NandFlash; the block numbers of the above target storage blocks are the same.

[0058] The minimum heap container initialization module 32 is used to initialize the minimum heap container.

[0059] The super block construction module 33 is used to construct a super block according to the target storage block.

[0060] The data structure writing module 34 is used to write the first data structure of the first sub-super block in the above-mentioned super block, which is in a state of being full of data, into the first minimum heap in the above-mentioned minimum heap container; and write the second data structure of the second sub-super block in the above-mentioned super block, which is in a state of not writing data, into the second minimum heap in the above-mentioned minimum heap container.

[0061] The management module 35 is used to manage the write operation and garbage collection operation of the super block through the first minimum heap and the second minimum heap.

[0062] Among them, the storage block acquisition module 31, the minimum heap container initialization module 32, the super block construction module 33, the data structure writing module 34 and the management module 35 are connected in sequence.

[0063] In one embodiment, the management module 35 is also used to retrieve the target second sub-super block from the second minimum heap when a write command is received; perform a write operation on the target second sub-super block according to the write command until the target second sub-super block is full, thereby obtaining a target second sub-super block full of data; and place the target second sub-super block full of data into the first minimum heap.

[0064] In one embodiment, the management module 35 is further configured to place the target third sub-super block having the smallest number of erasures in the second data structure into the minimum heap head of the second minimum heap.

[0065] In one embodiment, the management module 35 is further configured to execute a minimum heap push operation to put the target second sub-super block filled with data into the first minimum heap.

[0066] In one embodiment, the management module 35 is also used to retrieve the target first sub-super block from the first minimum heap when it is detected that the super block reaches a preset garbage collection condition; perform a garbage collection operation on the target first sub-super block based on a preset garbage collection operation instruction to obtain the target first sub-super block after garbage collection; and place the target first sub-super block after garbage collection into the second minimum heap.

[0067] In one embodiment, the management module 35 is also used to place the target fourth sub-super block with the smallest number of available resources in the first data structure into the minimum heap head of the first minimum heap after the step of retrieving the target first sub-super block from the first minimum heap.

[0068] In one embodiment, the management module 35 is further configured to execute a minimum heap push operation to place the target first sub-super block after garbage collection into the second minimum heap.

[0069] The super block management device provided in the embodiment of the present invention has the same technical features as the super block management method provided in the above embodiment, so it can also solve the same technical problems and achieve the same technical effects. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the device described above can refer to the corresponding process in the above method embodiment, and will not be repeated here.

[0070] Example 4

[0071] This embodiment provides an electronic device, including a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the steps of the super block management method.

[0072] This embodiment provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the steps of the super block management method are implemented.

[0073] See also Figure 4 The structure diagram of an electronic device shown in the figure includes: a memory 41 and a processor 42. The memory 41 stores a computer program that can be run on the processor 42. When the processor executes the computer program, the steps provided by the above-mentioned super block management method are implemented.

[0074] like Figure 4 As shown, the device further includes: a bus 43 and a communication interface 44, a processor 42, a communication interface 44 and a memory 41 are connected via the bus 43; the processor 42 is used to execute executable modules stored in the memory 41, such as computer programs.

[0075] The memory 41 may include a high-speed random access memory (RAM), and may also include a non-volatile memory, such as at least one disk memory. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 44 (which may be wired or wireless), and the Internet, wide area network, local area network, metropolitan area network, etc. may be used.

[0076] The bus 43 may be an ISA bus, a PCI bus, or an EISA bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 4 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0077] Among them, the memory 41 is used to store the program, and the processor 42 executes the program after receiving the execution instruction. The method performed by the super block management device disclosed in any embodiment of the present invention can be applied to the processor 42, or implemented by the processor 42. The processor 42 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit in the processor 42 or the instruction in the form of software. The above processor 42 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiments of the present invention can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present invention can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 41, and the processor 42 reads the information in the memory 41 and completes the steps of the above method in combination with its hardware.

[0078] Furthermore, an embodiment of the present invention also provides a machine-readable storage medium, which stores machine-executable instructions. When the machine-executable instructions are called and executed by the processor 42, the machine-executable instructions prompt the processor 42 to implement the above-mentioned super block management method.

[0079] The electronic device and computer-readable storage medium provided by the embodiments of the present invention have the same technical features, and therefore can solve the same technical problems and achieve the same technical effects.

[0080] In addition, in the description of the embodiments of the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0081] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

Claims

1. A super block management method, characterized in that: include: Acquire target storage blocks in storage units in multiple NandFlash; the block numbers of the target storage blocks are the same; Initialize the minimum heap container; Constructing a super block according to the target storage block; Writing a first data structure of a first sub-super block in the super block that is full of data into a first minimum heap in the minimum heap container; and writing a second data structure of a second sub-super block in the super block that is not written with data into a second minimum heap in the minimum heap container; The write operation and garbage collection operation of the super block are managed through the first minimum heap and the second minimum heap.

2. The super block management method according to claim 1, characterized in that: The key of the first minimum heap is the number of available resources of the first data structure; the minimum heap header of the first minimum heap is the target first sub-super block with the smallest number of available resources in the first data structure; the key of the second minimum heap is the number of erases of the second data structure; the minimum heap header of the second minimum heap is the target second sub-super block with the smallest number of erases in the second data structure.

3. The super block management method according to claim 2, characterized in that: The step of managing the write operation of the super block by using the first minimum heap and the second minimum heap includes: When receiving a write command, retrieving the target second sub-super block from the second minimum heap; According to the write command, a write operation is performed on the target second sub-super block until the target second sub-super block is full, thereby obtaining a target second sub-super block full of data; The target second sub-super block filled with data is placed into the first minimum heap.

4. The super block management method according to claim 3, characterized in that: After the step of retrieving the target second sub-super block from the second minimum heap, the method comprises: The target third sub-super block with the smallest number of erasures in the second data structure is placed at the minimum heap head of the second minimum heap.

5. The super block management method according to claim 3, characterized in that: The step of placing the target second sub-super block filled with data into the first minimum heap comprises: Run the minimum heap push operation to put the target second sub-super block filled with data into the first minimum heap.

6. The super block management method according to claim 2, characterized in that: The step of managing the garbage collection operation of the super block by using the first minimum heap and the second minimum heap includes: When it is detected that the super block reaches a preset garbage collection condition, the target first sub-super block is retrieved from the first minimum heap; Based on a preset garbage collection operation instruction, performing a garbage collection operation on the target first sub-super block to obtain a garbage collected target first sub-super block; The target first sub-super block after garbage collection is placed into the second minimum heap.

7. The super block management method according to claim 6, characterized in that: After the step of retrieving the target first sub-super block from the first minimum heap, the method comprises: The target fourth sub-super block with the smallest amount of available resources in the first data structure is placed at the minimum heap head of the first minimum heap.

8. The super block management method according to claim 7, characterized in that: The step of placing the garbage collected target first sub-super block into the second minimum heap comprises: Run the minimum heap push operation to put the target first sub-super block after garbage collection into the second minimum heap.

9. A super block management method, characterized in that: include: A storage block acquisition module is used to acquire target storage blocks in storage units in multiple NandFlash; the block numbers of the target storage blocks are the same; The minimum heap container initialization module is used to initialize the minimum heap container; A super block construction module, used for constructing a super block according to the target storage block; A data structure writing module is used to write a first data structure of a first sub-super block in the super block that is in a state of being full of data into a first minimum heap in the minimum heap container; and write a second data structure of a second sub-super block in the super block that is in a state of not having data written into a second minimum heap in the minimum heap container; A management module is used to manage the write operation and garbage collection operation of the super block through the first minimum heap and the second minimum heap.

10. An electronic device, characterized in that: The electronic device includes a processor and a memory, the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the super block management method according to any one of claims 1 to 8.

Images