WO2021027271A1 - Bad block information protection method and apparatus, computer device and storage medium - Google Patents
Bad block information protection method and apparatus, computer device and storage medium Download PDFInfo
- Publication number
- WO2021027271A1 WO2021027271A1 PCT/CN2020/076781 CN2020076781W WO2021027271A1 WO 2021027271 A1 WO2021027271 A1 WO 2021027271A1 CN 2020076781 W CN2020076781 W CN 2020076781W WO 2021027271 A1 WO2021027271 A1 WO 2021027271A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- super
- block
- information
- bad
- bad block
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
Definitions
- This application relates to the technical field of solid state hard disks, and in particular to a method, device, computer equipment and storage medium for protecting bad block information.
- bad blocks will be generated.
- Bad blocks are the broken and no longer used storage blocks generated during SSD card opening or operation.
- the generated bad block information will be recorded on a bad block table.
- the bad block table is used to determine whether the storage block can be used, which plays a vital role in the normal operation of the SSD.
- the bad block table In order to prevent the bad block information from being destroyed, the bad block table generally has two to three backups, which are stored in different storage blocks on the nand flash memory. If the original bad block table is damaged, the bad block information can be restored through the backup of the bad block table.
- the existing solution is to distribute the bad block table and its backup to two to three storage blocks of the nand flash memory. If it happens that all the storage blocks that record the bad block table are damaged, the bad block table that records the bad block information is also lost. Without bad block information, the consistency of the data may be destroyed. After the bad block table and all its backups are lost, if part of the bad block information can be recovered, it will have a positive impact on data consistency. However, due to some abnormal reasons, all the bad block tables are damaged or lost, then all the bad block information is lost, and the SSD cannot distinguish the quality of the memory card, which may cause data consistency errors.
- One of the objectives of the embodiments of this application is to provide a method, device, computer equipment, and storage medium for protecting bad block information, which aims to solve the problem that due to the loss of bad block information, the SSD cannot distinguish between the quality of the memory card and easily cause data consistency. Wrong question.
- a method for protecting bad block information includes:
- a device for protecting bad block information includes:
- the detection unit is used to detect whether the bad block table and its backup are completely damaged
- the acquisition unit is used to detect that the bad block table and its backup are completely damaged, traverse all super blocks, and obtain the local bad block information stored in the super block;
- the recovery unit is used to recover the bad block information of all super blocks according to all the local bad block information.
- a computer device including a memory, a processor, and a computer program that is stored in the memory and can run on the processor, and the processor implements the bad block described in the first aspect when the processor executes the computer program Information protection method steps.
- a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps of the bad block information protection method described in the first aspect are implemented.
- the bad block information protection method, device, computer equipment, and storage medium provided by the embodiments of the application have the following beneficial effects: after the SSD is powered on, when the bad block table and its backup are all damaged, the application traverses all the super blocks, The backup area of the first storage page of the first storage block of all super blocks reads the local bad block information, and obtains the good or bad information of all the super blocks through the partial bad block information, thereby protecting the bad block information of the SSD, which is accurate Determine whether the storage block can be used.
- FIG. 1 is a schematic diagram of the application of the bad block information protection method provided by an embodiment of the application
- FIG. 2 is a schematic flowchart of a method for protecting bad block information according to an embodiment of the application
- FIG. 3 is a schematic flowchart of a method for protecting bad block information according to another embodiment of this application.
- FIG. 4 is a schematic diagram of a sub-flow of a method for protecting bad block information according to another embodiment of this application.
- FIG. 5 is a schematic block diagram of a bad block information protection device provided by an embodiment of this application.
- FIG. 6 is a schematic block diagram of a device for protecting bad block information according to another embodiment of this application.
- FIG. 7 is a schematic block diagram of a pre-storage unit of a device for protecting bad block information according to another embodiment of this application.
- FIG. 8 is a schematic block diagram of a computer device provided by an embodiment of the application.
- FIG. 1 is a schematic diagram of the application of the bad block information protection method provided by an embodiment of this application.
- FIG. 2 is a schematic flowchart of a method for protecting bad block information according to an embodiment of the application.
- FIG. 2 is a schematic flowchart of a method for protecting bad block information according to an embodiment of the present application. As shown in Fig. 2, the method includes steps S110 to S130.
- the nand flash memory is composed of many storage blocks (block), each storage block contains many storage pages (page), each storage page is divided into a spare area (spare) and main Area (main), the main area stores user data, the spare area generally stores the system management data of the SSD, and the bad block table can be stored in the spare area.
- bad blocks will be generated, and the information of these bad blocks will be recorded on a bad block table.
- the bad block table In order to prevent the bad block information from being destroyed, the bad block table generally has two to three backups, which are stored in different storage blocks on the Nand flash memory. If the original bad block table is damaged, you can use the bad block table to The backups in other different storage blocks restore the bad block information to ensure the consistency of the data in the SSD.
- the bad block information of all storage blocks can be directly restored through the backup. If due to abnormal reasons, all the bad block tables and corresponding backups are correspondingly damaged, then the bad block information cannot be restored according to the existing scheme. Therefore, when restoring bad block information in this application, it is necessary to first detect whether the bad block table and its backup are completely damaged, and perform subsequent recovery operations when it is completely damaged. If the bad block table and its backup are not completely damaged, then follow The undamaged backup directly restores the bad block information to ensure the normal use of the SSD.
- a super block is a collection of multiple storage blocks that can be read and written in parallel.
- any storage block in the super block may change from a good block to a bad block. If all the storage blocks in the super block become bad blocks, this super block is a bad super block and can no longer be used. It is necessary to record the good and bad information corresponding to the super block, and writing in the bad super block is not allowed data.
- this solution further records the quality information of the super block in the adjacent super block, and records the quality of the super block in a local range in multiple super blocks. Then, the complete record of the good and bad information of all super blocks is stored in multiple different super blocks, and the good and bad information of all super blocks can be obtained by integrating the good and bad information stored in different super blocks. Ensure the data consistency of SSD.
- Range table is a bitmap containing 5 bits (bits). Each bit corresponds to a specific super block for recording. If a bit is set to 1, it means that the super block at the corresponding position is bad; on the contrary, if a bit One bit is set to 0, indicating that the super block at the corresponding position is good.
- the quality information of the selected central super block is recorded in the middle position of the bitmap, which is the second position.
- the quality information of the super block in the direction of decreasing number is recorded in the 1st and 0th bits of the bitmap.
- the quality information of the super block in the direction of increasing number is recorded in the 3rd and 4th bits of the bitmap.
- Fill in their good and bad information in turn. Enter the range table, and then write the range table to the backup area of the first storage page of the first storage block of super block 7.
- S130 Restore the bad block information of all super blocks according to all the local bad block information.
- each super block that can write data records the quality information of adjacent super blocks, and all the quality information obtained removes the repeated parts, and the quality of all super blocks in the nand flash memory can be obtained. information. That is, after the bad block table and its backup saved in the conventional scheme are all lost, the bad block information of the SSD can be directly obtained according to all the local bad block information.
- This application reads the local bad block information from the backup area of the first storage page of the first storage block of all super blocks by traversing all super blocks when the bad block table and its backup are all damaged after the SSD is powered on , Obtain the good and bad information of all super blocks through the local bad block information, thereby protecting the bad block information of the SSD, and accurately judging whether the storage block can be used.
- FIG. 3 is a schematic flowchart of a method for protecting bad block information according to another embodiment of the present application.
- the bad block information protection method of this embodiment includes steps S210-S240.
- the steps S220-S240 are similar to the steps S110-S130 in the foregoing embodiment, and will not be repeated here.
- the step S210 added in this embodiment will be described in detail below.
- the NAND flash memory after the NAND flash memory saves the bad block table and its backup, it further records the quality information of the super block in the adjacent super block, and records the quality of the super block in a local range in multiple super blocks. Bad information, and then store a complete record of the good and bad information of all super blocks in multiple different super blocks, and then integrate the good and bad information stored in different super blocks to get the good and bad information of all super blocks , To ensure the data consistency of the SSD.
- step S210 includes steps S211-S215.
- the super blocks are sequentially numbered according to the positions of the super blocks, and the specific numbers are numbered starting from 0, the number difference between adjacent super blocks is 1, and the super blocks are sequentially numbered 0, 1, 2, 3... n. Subsequently, the location of the super block can be judged according to the super block number, and at the same time, the quality information of a specific super block can be determined according to the number.
- the distance between any two super blocks is defined to be equal to the difference of the corresponding numbers.
- the distance between the number 6 super block and the number 9 super block corresponds to 3
- the number 6 super block The distance between the block and the super block numbered 5 is 1, and we can clearly understand the super block adjacent to any super block through the distance data, so that the quality information of the super block can be recorded in the adjacent super block.
- a super block is selected as the central super block, and the quality information of the super block within a certain distance is obtained with the super block as the center, and the quality information of the neighboring super blocks is stored.
- the quality information of all super blocks is recorded.
- any super block is selected as the center, and the quality information of all super blocks whose distance from this super block is less than or equal to 2 is recorded in a range table (local range bad super block table) )in.
- Range table is a bitmap containing 5 bits (bits). Each bit corresponds to a specific super block for recording. If a bit is set to 1, it means that the super block at the corresponding position is bad; on the contrary, if a bit One bit is set to 0, indicating that the super block at the corresponding position is good.
- the quality information of the selected central super block is recorded in the middle position of the bitmap, which is the second position.
- the quality information of the super block in the direction of decreasing number is recorded in the 1st and 0th bits of the bitmap.
- the quality information of the super block in the direction of increasing number is recorded in the 3rd and 4th bits of the bitmap.
- Fill in their good and bad information in turn. Enter the range table, and then write the range table to the backup area of the first storage page of the first storage block of super block 7.
- Step S215 is specifically: recording the super block quality information in the local range bad super block table in the central super block as the local bad block information.
- This application reads the local bad block information from the backup area of the first storage page of the first storage block of all super blocks by traversing all super blocks when the bad block table and its backup are all damaged after the SSD is powered on , Obtain the good and bad information of all super blocks through the local bad block information, thereby protecting the bad block information of the SSD, and accurately judging whether the storage block can be used.
- Fig. 5 is a schematic block diagram of a bad block information protection device provided by an embodiment of the present application. As shown in FIG. 5, corresponding to the above bad block information protection method, this application also provides a bad block information protection device.
- the bad block information protection device includes a unit for executing the above bad block information protection method, and the device can be configured in a desktop computer, a tablet computer, a laptop computer, and other terminals. Specifically, referring to FIG. 5, the device for protecting bad block information includes a detecting unit 10, an acquiring unit 20, and a restoring unit 30.
- the detection unit 10 is used to detect whether the bad block table and its backup are completely damaged.
- the nand flash memory is composed of many storage blocks, each storage block contains many storage pages (page), each storage page is divided into a spare area (spare) and a main area (main), the main The area stores user data, the spare area generally stores the system management data of the SSD, and the bad block table can be stored in the spare area.
- bad blocks will be generated, and the information of these bad blocks will be recorded on a bad block table.
- the bad block table In order to prevent the bad block information from being destroyed, the bad block table generally has two to three backups, which are stored in different storage blocks on the Nand flash memory. If the original bad block table is damaged, you can use the bad block table to The backups in other different storage blocks restore the bad block information to ensure the consistency of the data in the SSD.
- the bad block information of all storage blocks can be directly restored through the backup. If due to abnormal reasons, all bad block tables and corresponding backups are correspondingly damaged, then the bad block information cannot be restored according to the existing scheme. Therefore, when restoring bad block information in this application, it is necessary to first detect whether the bad block table and its backup are completely damaged, and perform subsequent recovery operations when it is completely damaged. If the bad block table and its backup are not completely damaged, then follow The undamaged backup directly restores the bad block information to ensure the normal use of the SSD.
- the obtaining unit 20 is used to detect that the bad block table and its backup are completely damaged, traverse all the super blocks, and obtain the partial bad block information stored in the super block.
- a super block is a collection of multiple storage blocks that can be read and written in parallel.
- any storage block in the super block may change from a good block to a bad block. If all the storage blocks in the super block become bad blocks, this super block is a bad super block and can no longer be used. It is necessary to record the good and bad information corresponding to the super block, and writing in the bad super block is not allowed data.
- this solution further records the quality information of the super block in the adjacent super block, and records the quality of the super block in a local range in multiple super blocks. Then, the complete record of the good and bad information of all super blocks is stored in multiple different super blocks, and the good and bad information of all super blocks can be obtained by integrating the good and bad information stored in different super blocks. Ensure the data consistency of SSD.
- Range table is a bitmap containing 5 bits (bits). Each bit corresponds to a specific super block for recording. If a bit is set to 1, it means that the super block at the corresponding position is bad; on the contrary, if a bit One bit is set to 0, indicating that the super block at the corresponding position is good.
- the quality information of the selected central super block is recorded in the middle position of the bitmap, which is the second position.
- the quality information of the super block in the direction of decreasing number is recorded in the 1st and 0th bits of the bitmap.
- the quality information of the super block in the direction of increasing number is recorded in the 3rd and 4th bits of the bitmap.
- Fill in their good and bad information in turn. Enter the range table, and then write the range table to the backup area of the first storage page of the first storage block of super block 7.
- the recovery unit 30 is configured to recover the bad block information of all super blocks according to all the local bad block information.
- each super block that can write data records the quality information of adjacent super blocks, and all the quality information obtained removes the repeated parts, and the quality of all super blocks in the nand flash memory can be obtained. information. That is, after the bad block table and its backup saved in the conventional scheme are all lost, the bad block information of the SSD can be directly obtained according to all the local bad block information.
- This application reads the local bad block information from the backup area of the first storage page of the first storage block of all super blocks by traversing all super blocks when the bad block table and its backup are all damaged after the SSD is powered on , Obtain the good and bad information of all super blocks through the local bad block information, thereby protecting the bad block information of the SSD, and accurately judging whether the storage block can be used.
- FIG. 6 is a schematic block diagram of a bad block information protection device provided by another embodiment of the present application. As shown in FIG. 6, the bad block information protection device of this embodiment adds a pre-storage unit 40 on the basis of the foregoing embodiment.
- the pre-storage unit 40 is used to pre-store the quality information of any super block in a super block within a set range.
- the NAND flash memory after the NAND flash memory saves the bad block table and its backup, it further records the quality information of the super block in the adjacent super block, and records the quality of the super block in a local range in multiple super blocks. Bad information, and then store a complete record of the good and bad information of all super blocks in multiple different super blocks, and then integrate the good and bad information stored in different super blocks to get the good and bad information of all super blocks , To ensure the data consistency of the SSD.
- the pre-storage unit 40 includes a numbering module 41, a distance defining module 42, a center selection module 43, an information acquisition module 44, and an information storage module 45.
- the numbering module 41 is used to sequentially number the super blocks according to their positions, and the number difference between adjacent super blocks is 1.
- the super blocks are sequentially numbered according to the positions of the super blocks, and the specific numbers are numbered starting from 0, the number difference between adjacent super blocks is 1, and the super blocks are sequentially numbered 0, 1, 2, 3... n. Subsequently, the location of the super block can be judged according to the super block number, and at the same time, the quality information of a specific super block can be determined according to the number.
- the distance definition module 42 is used to define the difference between the numbers of any two super blocks as the distance between the two super blocks.
- the distance between any two super blocks is defined to be equal to the difference of the corresponding numbers.
- the distance between the number 6 super block and the number 9 super block corresponds to 3
- the number 6 super block The distance between the block and the super block numbered 5 is 1, and we can clearly understand the super block adjacent to any super block through the distance data, so that the quality information of the super block can be recorded in the adjacent super block.
- the center selection module 43 is used to sequentially select a super block as the center super block.
- a super block is selected as the central super block, and the quality information of the super block within a certain distance is obtained with the super block as the center, and the quality information of the neighboring super blocks is stored.
- the quality information of all super blocks is recorded.
- the information obtaining module 44 is used to obtain the quality information of the super block whose distance from the central super block is less than or equal to 2.
- the information storage module 45 is used to pre-store the corresponding good and bad information in the central super block as local bad block information.
- any super block is selected as the center, and the quality information of all super blocks whose distance from this super block is less than or equal to 2 is recorded in a range table (local Range bad super block table).
- Range table is a bitmap containing 5 bits (bits). Each bit corresponds to a specific super block for recording. If a bit is set to 1, it means that the super block at the corresponding position is bad; on the contrary, if a bit One bit is set to 0, indicating that the super block at the corresponding position is good.
- the quality information of the selected central super block is recorded in the middle position of the bitmap, which is the second position.
- the quality information of the super block in the direction of decreasing number is recorded in the 1st and 0th bits of the bitmap.
- the quality information of the super block in the direction of increasing number is recorded in the 3rd and 4th bits of the bitmap.
- Fill in their good and bad information in turn. Enter the range table, and then write the range table to the backup area of the first storage page of the first storage block of super block 7.
- the information storage module 45 is also used to record the super block quality information in the local range bad super block table in the central super block as the local bad block information.
- This application reads the local bad block information from the backup area of the first storage page of the first storage block of all super blocks by traversing all super blocks when the bad block table and its backup are all damaged after the SSD is powered on , Obtain the good and bad information of all super blocks through the local bad block information, thereby protecting the bad block information of the SSD, and accurately judging whether the storage block can be used.
- FIG. 8 is a schematic block diagram of a computer device according to an embodiment of the present application.
- the computer device 500 may be a terminal or a server, where the terminal may be an electronic device with communication functions such as a smart phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant, and a wearable device.
- the server can be an independent server or a server cluster composed of multiple servers.
- the computer device 500 includes a processor 502, a memory, and a network interface 505 connected through a system bus 501, where the memory may include a non-volatile storage medium 503 and an internal memory 504.
- the non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032.
- the computer program 5032 includes program instructions. When the program instructions are executed, the processor 502 can execute a method for protecting bad block information.
- the processor 502 is used to provide calculation and control capabilities to support the operation of the entire computer device 500.
- the internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503.
- the processor 502 can execute a bad block information protection method.
- the network interface 505 is used for network communication with other devices.
- FIG. 8 is only a block diagram of part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device 500 to which the solution of the present application is applied.
- the specific computer device 500 may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.
- the processor 502 may be a central processing unit (Central Processing Unit, CPU), and the processor 502 may also be other general-purpose processors, digital signal processors (Digital Signal Processors, DSPs), Application Specific Integrated Circuit (ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
- the general-purpose processor may be a microprocessor or the processor may also be any conventional processor.
- the computer program includes program instructions, and the computer program can be stored in a storage medium, which is a computer-readable storage medium.
- the program instructions are executed by at least one processor in the computer system to implement the process steps of the foregoing method embodiments.
- the storage medium may be a computer-readable storage medium.
- the storage medium stores a computer program.
- the storage medium may be a U disk, a mobile hard disk, a read-only memory (Read-Only Memory, ROM), a magnetic disk or an optical disk, and other computer-readable storage media that can store program codes.
- ROM Read-Only Memory
- the disclosed device and method can be implemented in other ways.
- the device embodiments described above are only illustrative.
- the division of each unit is only a logical function division, and there may be other division methods in actual implementation.
- multiple units or components can be combined or integrated into another system, or some features can be omitted or not implemented.
- the steps in the method of the embodiment of the present application can be adjusted, merged, and deleted in order according to actual needs.
- the units in the devices in the embodiments of the present application may be combined, divided, and deleted according to actual needs.
- the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
- the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a storage medium.
- the technical solution of this application is essentially or the part that contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium It includes several instructions to make a computer device (which may be a personal computer, a terminal, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present application.
Abstract
Description
Claims (16)
- 一种坏块信息保护方法,其特征在于,所述方法包括:A method for protecting bad block information, characterized in that the method includes:检测坏块表及其备份是否完全损坏;Check whether the bad block table and its backup are completely damaged;若完全损坏,则遍历所有的超级块,获取存储于超级块中的局部坏块信息;If it is completely damaged, traverse all super blocks to obtain the local bad block information stored in the super block;根据所有的局部坏块信息恢复所有超级块的坏块信息。Restore the bad block information of all super blocks according to all the local bad block information.
- 根据权利要求1所述的坏块信息保护方法,其特征在于,所述遍历所有的超级块,获取存储于超级块中的局部坏块信息的步骤之前包括:The method for protecting bad block information according to claim 1, wherein before the step of traversing all super blocks and obtaining local bad block information stored in the super block comprises:将任一超级块的好坏信息预存储于设定范围内的超级块中。Pre-store the quality information of any super block in the super block within the set range.
- 根据权利要求2所述的坏块信息保护方法,其特征在于,所述将任一超级块的好坏信息预存储于设定范围内的超级块中的步骤包括:The method for protecting bad block information according to claim 2, wherein the step of pre-storing the quality information of any super block in a super block within a set range comprises:将超级块按所处位置依次编号,相邻超级块之间的编号差值为1;Number the super blocks in sequence according to their positions, and the number difference between adjacent super blocks is 1;将任两个超级块的编号的差值设为两个超级块之间的距离;Set the difference between the numbers of any two super blocks as the distance between the two super blocks;依次选定一超级块为中心超级块;Select a super block in turn as the central super block;获取与中心超级块距离小于等于2的超级块的好坏信息;Get information about the quality of super blocks whose distance from the central super block is less than or equal to 2;将对应的好坏信息预存储于中心超级块作为局部坏块信息。The corresponding good and bad information is pre-stored in the central super block as local bad block information.
- 根据权利要求3所述的坏块信息保护方法,其特征在于,所述将对应的好坏信息预存储于中心超级块作为局部坏块信息的步骤包括:The method for protecting bad block information according to claim 3, wherein the step of pre-storing the corresponding good or bad information in the central super block as local bad block information comprises:将超级块的好坏信息记录于中心超级块中的局部范围坏超级块表作为局部坏块信息。The quality information of the super block is recorded in the local range bad super block table in the central super block as the local bad block information.
- 一种坏块信息保护装置,其特征在于,所述装置包括:A device for protecting bad block information, characterized in that the device includes:检测单元,用于检测坏块表及其备份是否完全损坏;The detection unit is used to detect whether the bad block table and its backup are completely damaged;获取单元,用于检测坏块表及其备份完全损坏时,遍历所有的超级块,获取存储于超级块中的局部坏块信息;The acquisition unit is used to detect that the bad block table and its backup are completely damaged, traverse all super blocks, and obtain the local bad block information stored in the super block;恢复单元,用于根据所有的局部坏块信息恢复所有超级块的坏块 信息。The recovery unit is used to recover the bad block information of all super blocks according to all the local bad block information.
- 根据权利要求5所述的坏块信息保护装置,其特征在于,还包括预存单元,用于将任一超级块的好坏信息预存储于设定范围内的超级块中。The device for protecting bad block information according to claim 5, further comprising a pre-storage unit for pre-storing the quality information of any super block in a super block within a set range.
- 根据权利要求6所述的坏块信息保护装置,其特征在于,所述预存单元包括编号模块,距离定义模块,中心选定模块,信息获取模块和信息存储模块;The bad block information protection device according to claim 6, wherein the pre-storage unit includes a numbering module, a distance definition module, a center selection module, an information acquisition module and an information storage module;所述编号模块,用于将超级块按所处位置依次编号,相邻超级块之间的编号差值为1;The numbering module is used to sequentially number the super blocks according to their positions, and the number difference between adjacent super blocks is 1;所述距离定义模块,用于将任两个超级块的编号的差值定义为两个超级块之间的距离;The distance definition module is used to define the difference between the numbers of any two super blocks as the distance between the two super blocks;所述中心选定模块,用于依次选定一超级块为中心超级块;The center selection module is used to sequentially select a super block as the center super block;所述信息获取模块,用于获取与中心超级块距离小于等于2的超级块的好坏信息;The information acquiring module is used to acquire the quality information of the super block whose distance from the central super block is less than or equal to 2;所述信息存储模块,用于将对应的好坏信息预存储于中心超级块作为局部坏块信息。The information storage module is used to pre-store the corresponding good and bad information in the central super block as local bad block information.
- 根据权利要求7所述的坏块信息保护装置,其特征在于,所述信息存储模块,用于将超级块好坏信息记录于中心超级块中的局部范围坏超级块表作为局部坏块信息。8. The bad block information protection device according to claim 7, wherein the information storage module is used to record the super block quality information in the local range bad super block table in the central super block as the local bad block information.
- 一种计算机设备,包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序,其特征在于,所述处理器执行所述计算机程序时实现如下步骤:A computer device comprising a memory, a processor, and a computer program stored on the memory and running on the processor, characterized in that the processor implements the following steps when the processor executes the computer program:检测坏块表及其备份是否完全损坏;Check whether the bad block table and its backup are completely damaged;若完全损坏,则遍历所有的超级块,获取存储于超级块中的局部坏块信息;If it is completely damaged, traverse all super blocks to obtain the local bad block information stored in the super block;根据所有的局部坏块信息恢复所有超级块的坏块信息。Restore the bad block information of all super blocks according to all the local bad block information.
- 根据权利要求9所述的计算机设备,其特征在于,所述处理器执行所述计算机程序时还实现如下步骤:The computer device according to claim 9, wherein the processor further implements the following steps when executing the computer program:将任一超级块的好坏信息预存储于设定范围内的超级块中。Pre-store the quality information of any super block in the super block within the set range.
- 根据权利要求10所述的计算机设备,其特征在于,所述处理器执行所述计算机程序时还实现如下步骤:The computer device according to claim 10, wherein the processor further implements the following steps when executing the computer program:将超级块按所处位置依次编号,相邻超级块之间的编号差值为1;Number the super blocks in sequence according to their positions, and the number difference between adjacent super blocks is 1;将任两个超级块的编号的差值设为两个超级块之间的距离;Set the difference between the numbers of any two super blocks as the distance between the two super blocks;依次选定一超级块为中心超级块;Select a super block in turn as the central super block;获取与中心超级块距离小于等于2的超级块的好坏信息;Get information about the quality of super blocks whose distance from the central super block is less than or equal to 2;将对应的好坏信息预存储于中心超级块作为局部坏块信息。The corresponding good and bad information is pre-stored in the central super block as local bad block information.
- 根据权利要求11所述的计算机设备,其特征在于,所述处理器执行所述计算机程序时还实现如下步骤:The computer device according to claim 11, wherein the processor further implements the following steps when executing the computer program:将超级块的好坏信息记录于中心超级块中的局部范围坏超级块表作为局部坏块信息。The quality information of the super block is recorded in the local range bad super block table in the central super block as the local bad block information.
- 一种计算机可读存储介质,其上存储有计算机程序,其特征在于,所述计算机程序被处理器执行时实现如下步骤:A computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor to implement the following steps:检测坏块表及其备份是否完全损坏;Check whether the bad block table and its backup are completely damaged;若完全损坏,则遍历所有的超级块,获取存储于超级块中的局部坏块信息;If it is completely damaged, traverse all super blocks to obtain the local bad block information stored in the super block;根据所有的局部坏块信息恢复所有超级块的坏块信息。Restore the bad block information of all super blocks according to all the local bad block information.
- 根据权利要求13所述的计算机可读存储介质,其特征在于,所述计算机程序被处理器执行时还实现如下步骤:The computer-readable storage medium according to claim 13, wherein the computer program further implements the following steps when being executed by the processor:将任一超级块的好坏信息预存储于设定范围内的超级块中。Pre-store the quality information of any super block in the super block within the set range.
- 根据权利要求14所述的计算机可读存储介质,其特征在于,所述计算机程序被处理器执行时还实现如下步骤:The computer-readable storage medium of claim 14, wherein the computer program further implements the following steps when being executed by the processor:将超级块按所处位置依次编号,相邻超级块之间的编号差值为1;Number the super blocks in sequence according to their positions, and the number difference between adjacent super blocks is 1;将任两个超级块的编号的差值设为两个超级块之间的距离;Set the difference between the numbers of any two super blocks as the distance between the two super blocks;依次选定一超级块为中心超级块;Select a super block in turn as the central super block;获取与中心超级块距离小于等于2的超级块的好坏信息;Get information about the quality of super blocks whose distance from the central super block is less than or equal to 2;将对应的好坏信息预存储于中心超级块作为局部坏块信息。The corresponding good and bad information is pre-stored in the central super block as local bad block information.
- 根据权利要求15所述的计算机可读存储介质,其特征在于,所述计算机程序被处理器执行时还实现如下步骤:The computer-readable storage medium according to claim 15, wherein the computer program further implements the following steps when being executed by the processor:将超级块的好坏信息记录于中心超级块中的局部范围坏超级块表作为局部坏块信息。The quality information of the super block is recorded in the local range bad super block table in the central super block as the local bad block information.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910751842.3 | 2019-08-15 | ||
CN201910751842.3A CN110471625B (en) | 2019-08-15 | 2019-08-15 | Bad block information protection method and device, computer equipment and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021027271A1 true WO2021027271A1 (en) | 2021-02-18 |
Family
ID=68511808
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/076781 WO2021027271A1 (en) | 2019-08-15 | 2020-02-26 | Bad block information protection method and apparatus, computer device and storage medium |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN110471625B (en) |
WO (1) | WO2021027271A1 (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110471625B (en) * | 2019-08-15 | 2021-04-20 | 深圳忆联信息系统有限公司 | Bad block information protection method and device, computer equipment and storage medium |
CN111026332B (en) * | 2019-12-09 | 2024-02-13 | 深圳忆联信息系统有限公司 | SSD bad block information protection method, SSD bad block information protection device, computer equipment and storage medium |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090216832A1 (en) * | 2008-02-26 | 2009-08-27 | Quinn Steven C | Array-based distributed storage system with parity |
CN108804045A (en) * | 2018-06-28 | 2018-11-13 | 郑州云海信息技术有限公司 | A kind of bad block table method for building up and relevant apparatus |
CN109582239A (en) * | 2018-12-03 | 2019-04-05 | 郑州云海信息技术有限公司 | A kind of store method, device, equipment and the storage medium of SSD bad block table |
CN110471625A (en) * | 2019-08-15 | 2019-11-19 | 深圳忆联信息系统有限公司 | Bad block message guard method, device, computer equipment and storage medium |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101510445B (en) * | 2009-03-19 | 2012-11-21 | 无锡中星微电子有限公司 | Method and apparatus for storing and reading bad block meter of memory |
CN103593303A (en) * | 2013-10-29 | 2014-02-19 | 福建星网视易信息系统有限公司 | Bad block table storage method and device and NAND gate nonvolatile memory |
CN103530069A (en) * | 2013-11-05 | 2014-01-22 | 浪潮(北京)电子信息产业有限公司 | Method for processing bad sectors of RAID5 disk array |
CN104731674B (en) * | 2015-02-02 | 2020-09-01 | 北京忆恒创源科技有限公司 | Method and apparatus for storing electronic system firmware using MLC NVM |
US10372355B2 (en) * | 2017-12-29 | 2019-08-06 | Micron Technology, Inc. | Managing partial superblocks in a NAND device |
-
2019
- 2019-08-15 CN CN201910751842.3A patent/CN110471625B/en active Active
-
2020
- 2020-02-26 WO PCT/CN2020/076781 patent/WO2021027271A1/en active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090216832A1 (en) * | 2008-02-26 | 2009-08-27 | Quinn Steven C | Array-based distributed storage system with parity |
CN108804045A (en) * | 2018-06-28 | 2018-11-13 | 郑州云海信息技术有限公司 | A kind of bad block table method for building up and relevant apparatus |
CN109582239A (en) * | 2018-12-03 | 2019-04-05 | 郑州云海信息技术有限公司 | A kind of store method, device, equipment and the storage medium of SSD bad block table |
CN110471625A (en) * | 2019-08-15 | 2019-11-19 | 深圳忆联信息系统有限公司 | Bad block message guard method, device, computer equipment and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN110471625B (en) | 2021-04-20 |
CN110471625A (en) | 2019-11-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2017228544B2 (en) | Nonvolatile media dirty region tracking | |
US7509567B1 (en) | System and method for resolving data inconsistencies with a data majority | |
US7103811B2 (en) | Mechanisms for detecting silent errors in streaming media devices | |
CN114579340A (en) | Memory error processing method and device | |
CN102135925B (en) | Method and device for detecting error check and correcting memory | |
CN109496292B (en) | Disk management method, disk management device and electronic equipment | |
WO2021027271A1 (en) | Bad block information protection method and apparatus, computer device and storage medium | |
CN110333971B (en) | SSD bad block table backup method and device, computer equipment and storage medium | |
US9086990B2 (en) | Bitline deletion | |
CN113223583A (en) | Method for rereading data in NAND Flash bad block, electronic equipment and storage medium | |
US20100169572A1 (en) | Data storage method, apparatus and system for interrupted write recovery | |
CN110729014A (en) | Method and device for backing up erase count table in SSD (solid State disk) storage, computer equipment and storage medium | |
CN110865772A (en) | Method and device for protecting system data physical block erasure count value, computer equipment and storage medium | |
EP3794451A1 (en) | Parity log with by-pass | |
CN113849123B (en) | Method, system, equipment and medium for processing data of slow disk | |
CN111026332B (en) | SSD bad block information protection method, SSD bad block information protection device, computer equipment and storage medium | |
CN113485872A (en) | Fault processing method and device and distributed storage system | |
US11221773B2 (en) | Method and apparatus for performing mapping information management regarding redundant array of independent disks | |
CN108231134B (en) | RAM yield remediation method and device | |
KR860002027B1 (en) | Key memory error processing system | |
CN112562774B (en) | Storage device mounting method and device, computer device and storage medium | |
CN114879916B (en) | Method and device for managing storage unit | |
TWI768476B (en) | Method and apparatus for performing mapping information management regarding redundant array of independent disks, and associated storage system | |
CN106874161B (en) | Method and device for processing cache exception | |
US20080247282A1 (en) | Method of Data Protection |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20852255 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20852255 Country of ref document: EP Kind code of ref document: A1 |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC DATED 12.08.2022 (EPO FORM 1205A) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20852255 Country of ref document: EP Kind code of ref document: A1 |