CN108509154B - Method and device for dynamically recombining raid according to bad block distribution - Google Patents
Method and device for dynamically recombining raid according to bad block distribution Download PDFInfo
- Publication number
- CN108509154B CN108509154B CN201810279125.0A CN201810279125A CN108509154B CN 108509154 B CN108509154 B CN 108509154B CN 201810279125 A CN201810279125 A CN 201810279125A CN 108509154 B CN108509154 B CN 108509154B
- Authority
- CN
- China
- Prior art keywords
- die
- read
- hard disk
- raid
- idle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- 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/062—Securing storage systems
-
- 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
- G06F3/0689—Disk arrays, e.g. RAID, JBOD
Abstract
The invention provides a method and a device for dynamically recombining raid according to bad block distribution, which relate to the technical field of computers, and the method comprises the following steps: obtaining a bad block in a first Die in an SSD hard disk, wherein the SSD hard disk has N dice and the SSD hard disk has a Raid of a group N + 1; judging the number of idle blocks in the first Die; setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold; continuing reading and writing by using the rest N-1 Dies; and when the last Die capable of being read and written remains, setting the SSD hard disk to be read only. The technical problems that in the prior art, the service life of a solid state disk is too short along with the aggravation of the wear of Nand Flash under the condition that the capacity of the solid state disk is larger and larger are solved, the service life of the solid state disk can be prolonged, the data validity is ensured, and the technical effect of timely processing of data in the hard disk can be achieved.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for dynamically recombining raid according to bad block distribution.
Background
Due to the fact that the capacity of the Nand Flash is larger and larger, due to the fact that the multi-layer Nand Flash technology is introduced, the Nand Flash is lower and lower in reliability, the error probability is larger and larger, and in order to guarantee that data in the SSD are not lost, the Raid technology is adopted in more and more solid state disks to guarantee data effectiveness.
Under the condition that the capacity of a solid state disk in the prior art is larger and larger, the service life of the hard disk is too short along with the aggravation of the abrasion of Nand Flash.
Disclosure of Invention
The embodiment of the invention provides a method and a device for dynamically recombining raid according to bad block distribution, which solve the technical problem that the service life of a hard disk is too short along with the aggravation of wear of Nand Flash under the condition that the capacity of the solid state disk is larger and larger in the prior art, and achieve the technical effects of prolonging the service life of the solid state disk, ensuring the validity of data and timely processing the data in the hard disk.
In view of the above problem, the present application has been made to provide a method and apparatus for dynamically reorganizing raid according to bad block distribution.
In a first aspect, the invention provides a method for dynamically recombining Raid according to bad block distribution, the method comprises the steps of obtaining bad blocks in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice and is provided with Raid of a group N + 1; judging the number of idle blocks in the first Die; setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold; continuing reading and writing by using the rest N-1 Dies; and when the last Die capable of being read and written remains, setting the SSD hard disk to be read only.
Further, the method also comprises that when the read-write is continued by using the rest N-1 Dies, the SSD hard disk has the Raid of the group (N-2) + 1.
Further, the method also comprises the step of replacing the bad block with a free good block after the first Die is set to be in a read-only state.
Further, the method further comprises: and if the first Die is the Die storing the check data, re-performing the Raid.
In a second aspect, the present invention provides an apparatus for dynamically reorganizing raid according to bad block distribution, the apparatus comprising:
the device comprises a first sending unit, a second sending unit and a control unit, wherein the first sending unit is used for obtaining a bad block in a first Die in an SSD hard disk, the SSD hard disk is provided with N dice, and the SSD hard disk is provided with Raid of a group N + 1;
a first judgment unit, configured to judge the number of idle blocks in the first Die;
a first setting unit configured to set the first Die to a read-only state when the number of free blocks is less than a predetermined threshold;
the first read-write unit is used for continuing reading and writing by using the rest N-1 Dies;
and the first read-only unit is used for setting the whole SSD hard disk to be read only when the last Die capable of being read and written remains.
Preferably, the apparatus further comprises:
and the second reading and writing unit is used for enabling the SSD hard disk to have the Raid of the group (N-2) +1 when the rest N-1 Dies are used for continuing reading and writing.
Preferably, the apparatus further comprises:
a first replacement unit, configured to set the first Die to a read-only state, and then replace the bad block with an idle good block.
Preferably, the apparatus further comprises:
a first Raid unit configured to perform Raid again if the first Die is a Die storing check data.
In a third aspect, the invention provides a device for dynamically recombining Raid according to bad block distribution, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the program to realize the following steps of obtaining a bad block in a first Die in an SSD hard disk, wherein the SSD hard disk has N dice and the SSD hard disk has Raid of a group N + 1; judging the number of idle blocks in the first Die; setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold; continuing reading and writing by using the rest N-1 Dies; and when the last Die capable of being read and written remains, setting the SSD hard disk to be read only.
One or more technical solutions in the embodiments of the present application have at least one or more of the following technical effects:
according to the method and the device for dynamically recombining Raid according to bad block distribution, provided by the embodiment of the application, by obtaining bad blocks in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice, and the SSD hard disk is provided with Raid of a group N + 1; judging the number of idle blocks in the first Die; setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold; continuing reading and writing by using the rest N-1 Dies; and when the last Die capable of being read and written remains, setting the SSD hard disk to be read only. The technical problems that in the prior art, the service life of a solid state disk is too short along with the aggravation of the wear of Nand Flash under the condition that the capacity of the solid state disk is larger and larger are solved, the service life of the solid state disk can be prolonged, the data validity is ensured, and the technical effect of timely processing of data in the hard disk can be achieved.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
FIG. 1 is a flowchart illustrating a method for dynamically reorganizing raid according to bad block distribution according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of an apparatus for dynamically reorganizing raid according to bad block distribution according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of another apparatus for dynamically reorganizing raid according to bad block distribution according to an embodiment of the present invention.
The reference numbers illustrate: a bus 300, a receiver 301, a processor 302, a transmitter 303, a memory 304, a bus interface 306.
Detailed Description
The embodiment of the invention provides a method and a device for dynamically recombining raid according to bad block distribution, which are used for solving the technical problems that in the prior art, under the condition that the capacity of a solid state disk is larger and larger, the service life of the hard disk is too short along with the aggravation of the wear of Nand Flash, and the technical scheme provided by the invention has the following general ideas:
in the technical scheme of the embodiment of the invention, by obtaining a bad block in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice and the SSD hard disk is provided with a Raid of a group N + 1; judging the number of idle blocks in the first Die; setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold; continuing reading and writing by using the rest N-1 Dies; and when the last Die capable of being read and written remains, setting the SSD hard disk to be read only. The service life of the solid state disk can be prolonged, the data validity is guaranteed, and the technical effect of timely processing the data in the hard disk is achieved.
The technical solutions of the present invention are described in detail below with reference to the drawings and specific embodiments, and it should be understood that the specific features in the embodiments and examples of the present invention are described in detail in the technical solutions of the present application, and are not limited to the technical solutions of the present application, and the technical features in the embodiments and examples of the present application may be combined with each other without conflict.
The term "and/or" is used herein to describe only one association relationship of the associated objects, which means that there may be three relationships, for example, a and/or B, and that there may be three cases, i.e., a exists alone, a and B exist simultaneously, and B exists alone. In addition, the character 7 "herein generally indicates that the former and latter related objects are in an" or "relationship.
In order to more clearly disclose a method and an apparatus for dynamically reorganizing raid according to bad block distribution provided by the embodiments of the present application, some terms are described below.
The Solid State Drives (Solid State Drives), referred to as fixed disks for short, are hard disks made of Solid State Drive (Solid State Drives) by using Solid electronic storage chip arrays, and are composed of a control unit and a storage unit (FLASH chip, DRAM chip). The specification, definition, function and use method of the interface of the solid state disk are completely the same as those of a common hard disk, and the appearance and size of the product are also completely consistent with those of the common hard disk. The method is widely applied to the fields of military affairs, vehicle-mounted, industrial control, video monitoring, network terminals, electric power, medical treatment, aviation, navigation equipment and the like.
Die, the interior of the NAND chip is divided into dice, plane, block, page, and dice are small squares on the wafer, several dice may be packaged in one chip, and one chip includes N dice
Raid, a disk array (Raid), and "array with redundancy capability made of Independent Disks".
Example one
FIG. 1 is a flowchart illustrating a method for dynamically reorganizing raid according to bad block distribution according to an embodiment of the present invention. As shown in fig. 1, the method includes:
110, obtaining a bad block in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice and the SSD hard disk is provided with a Raid group of N + 1;
specifically, the SSD hard disk is a solid state hard disk, and during a life cycle of the solid state hard disk, the life cycle of the solid state hard disk refers to a service life of the solid state hard disk, in other words, the solid state hard disk can be read and written normally within a time period in which the solid state hard disk can be used normally, the SSD hard disk has a Raid of group n +1, and the Raid is a disk array (Redundant array of Independent Disks, Raid) and has a "array with redundancy capability made of Independent Disks". The disk array is a disk group with a large capacity composed of a plurality of inexpensive disks, and the performance of the entire disk system is improved by the additive effect of providing data by individual disks. With this technique, data is divided into a plurality of sectors, each of which is stored on a respective hard disk.
Step 120: judging the number of idle blocks in the first Die;
step 130: setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold;
further, the method also comprises the step of replacing the bad block with a free good block after the first Die is set to be in a read-only state.
Specifically, in steps 120 and 130, first, determining the number of idle blocks in the first Die, where an idle block refers to a memory block that is not read or written and can normally perform a read or write operation, and obtaining a predetermined threshold of the idle block, where the predetermined threshold may be set according to an actual situation, and this application does not limit this, and it should be noted that the number of idle blocks in the first Die is determined; and obtaining the predetermined threshold value is not in sequence, can be obtained simultaneously or can be obtained sequentially. When the number of free blocks is less than a predetermined threshold, that is, when a bad block occurs, if the free blocks are sufficient, the bad block is replaced with a good block. When the free block available to the first Die disappears, the Die enters a read-only state, rather than the entire hard disk entering a read-only state, so that the technical effect that the hard disk can still write data under the condition that a certain Die has too many bad blocks and cannot write data can be achieved.
Step 140: continuing reading and writing by using the rest N-1 Dies;
step 150: when the last Die capable of being read and written remains, the SSD hard disk is set to be read only; and if the first Die is the Die storing the check data, re-performing the Raid.
Specifically, after a Die enters a read-only state, the remaining Die is automatically used for Raid, and if the Die is the Die storing the check data, Raid needs to be performed again.
Further, the method also comprises that when the read-write is continued by using the rest N-1 Dies, the SSD hard disk has the Raid of the group (N-2) + 1.
Specifically, the remaining n-1 dice are used to continue reading and writing the Raid of the group (n-2) +1, when the last readable and writable Die remains, full disk read-only is performed, and the service life of the solid state disk is terminated.
Example 2
Based on the same inventive concept as the method for dynamically reorganizing raid according to bad block distribution in the foregoing embodiment, the present invention further provides an apparatus for dynamically reorganizing raid according to bad block distribution, as shown in fig. 2, including:
the device comprises a first sending unit, a second sending unit and a control unit, wherein the first sending unit is used for obtaining a bad block in a first Die in an SSD hard disk, the SSD hard disk is provided with N dice, and the SSD hard disk is provided with Raid of a group N + 1;
a first judgment unit, configured to judge the number of idle blocks in the first Die;
a first setting unit configured to set the first Die to a read-only state when the number of free blocks is less than a predetermined threshold;
the first read-write unit is used for continuing reading and writing by using the rest N-1 Dies;
and the first read-only unit is used for setting the whole SSD hard disk to be read only when the last Die capable of being read and written remains.
Further, the apparatus further comprises:
and the second reading and writing unit is used for enabling the SSD hard disk to have the Raid of the group (N-2) +1 when the rest N-1 Dies are used for continuing reading and writing.
Further, the apparatus further comprises:
a first replacement unit, configured to set the first Die to a read-only state, and then replace the bad block with an idle good block.
Further, the apparatus further comprises:
a first Raid unit configured to perform Raid again if the first Die is a Die storing check data.
Various changes and specific examples of the method for dynamically reorganizing raid according to bad block distribution in embodiment 1 of fig. 1 are also applicable to the apparatus for dynamically reorganizing raid according to bad block distribution in this embodiment, and through the foregoing detailed description of the method for dynamically reorganizing raid according to bad block distribution, those skilled in the art can clearly know the implementation method of the apparatus for dynamically reorganizing raid according to bad block distribution in this embodiment, so for the brevity of description, detailed description is omitted here.
Example 3
Based on the same inventive concept as the method for dynamically reorganizing raid according to bad block distribution in the previous embodiment, the present invention further provides an apparatus for dynamically reorganizing raid according to bad block distribution, including a memory, a processor, and a computer program stored on the memory and running on the processor, where the computer program, when executed by the processor, implements the steps of any one of the methods for dynamically reorganizing raid according to bad block distribution.
Where in fig. 3 a bus architecture (represented by bus 300), bus 300 may include any number of interconnected buses and bridges, bus 300 linking together various circuits including one or more processors, represented by processor 302, and memory, represented by memory 304. The bus 300 may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface 306 provides an interface between the bus 300 and the receiver 301 and transmitter 303. The receiver 301 and the transmitter 303 may be the same element, i.e., a transceiver, providing a means for communicating with various other apparatus over a transmission medium.
The processor 302 is responsible for managing the bus 300 and general processing, and the memory 304 may be used for storing information used by the processor 302 in performing operations.
One or more technical solutions in the embodiments of the present application have at least one or more of the following technical effects:
according to the method and the device for dynamically recombining Raid according to bad block distribution, provided by the embodiment of the application, by obtaining bad blocks in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice, and the SSD hard disk is provided with Raid of a group N + 1; judging the number of idle blocks in the first Die; setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold; continuing reading and writing by using the rest N-1 Dies; and when the last Die capable of being read and written remains, setting the SSD hard disk to be read only. The technical problems that in the prior art, the service life of a solid state disk is too short along with the aggravation of the wear of Nand Flash under the condition that the capacity of the solid state disk is larger and larger are solved, the service life of the solid state disk can be prolonged, the data validity is ensured, and the technical effect of timely processing of data in the hard disk can be achieved.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable information processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable information processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable information processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable information processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (3)
1. A method for dynamically reorganizing raid according to bad block distribution, the method comprising:
obtaining a bad block in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice and the SSD hard disk is provided with Raid of a group N + 1;
judging the number of idle blocks in the first Die;
setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold;
continuing reading and writing by using the rest N-1 Dies;
when the last Die capable of being read and written remains, the SSD hard disk is set to be read only;
specifically, the number of idle blocks in the first Die is determined, where an idle block refers to a memory block that is not read or written and can normally perform read or write operations, a predetermined threshold of the idle block is obtained, the predetermined threshold may be set according to an actual situation, and the number of idle blocks in the first Die and the obtained predetermined threshold are not in sequence, and may be obtained simultaneously or sequentially; when a bad block occurs, if the number of the idle blocks is more than or equal to the preset threshold value, replacing the bad block by a good block; if the number of the idle blocks is smaller than a preset threshold value, the Die enters a read-only state, but not the whole hard disk enters the read-only state, so that the hard disk can still write data under the condition that one Die has too many bad blocks and cannot write data;
the method further comprises the following steps: when continuing to read and write using the remaining N-1 Dies, the SSD hard disk has a Raid of group (N-2) + 1;
the method further comprises the following steps: after the first Die is set to be in a read-only state, replacing the bad block with an idle good block;
the method further comprises the following steps:
if the first Die is the Die storing the check data, re-performing Raid;
specifically, the remaining N-1 dice are used to continue reading and writing the Raid of the group (N-2) +1, when the last readable and writable Die remains, full disk read-only is performed, the service life of the solid state disk is terminated, and the written data can continue until the last two dice remain.
2. An apparatus for dynamically reorganizing raid according to bad block distribution, the apparatus comprising:
the device comprises a first sending unit, a second sending unit and a control unit, wherein the first sending unit is used for obtaining a bad block in a first Die in an SSD hard disk, the SSD hard disk is provided with N dice, and the SSD hard disk is provided with Raid of a group N + 1;
a first judgment unit, configured to judge the number of idle blocks in the first Die;
a first setting unit configured to set the first Die to a read-only state when the number of free blocks is less than a predetermined threshold;
the first read-write unit is used for continuing reading and writing by using the rest N-1 Dies;
the SSD hard disk drive comprises a first read-only unit, a second read-only unit and a third read-only unit, wherein the first read-only unit is used for setting the whole SSD hard disk to be read only when the last Die capable of being read and written remains;
specifically, the number of idle blocks in the first Die is determined, where an idle block refers to a memory block that is not read or written and can normally perform read or write operations, a predetermined threshold of the idle block is obtained, the predetermined threshold may be set according to an actual situation, and the number of idle blocks in the first Die and the obtained predetermined threshold are not in sequence, and may be obtained simultaneously or sequentially; when a bad block occurs, if the number of the idle blocks is more than or equal to the preset threshold value, replacing the bad block by a good block; if the number of the idle blocks is smaller than a preset threshold value, the Die enters a read-only state, but not the whole hard disk enters the read-only state, so that the hard disk can still write data under the condition that one Die has too many bad blocks and cannot write data;
when continuing to read and write using the remaining N-1 Dies, the SSD hard disk has a Raid of group (N-2) + 1; after the first Die is set to be in a read-only state, replacing the bad block with an idle good block; if the first Die is the Die storing the check data, re-performing Raid; specifically, the remaining N-1 dice are used to continue reading and writing the Raid of the group (N-2) +1, when the last readable and writable Die remains, full disk read-only is performed, the service life of the solid state disk is terminated, and the written data can continue until the last two dice remain.
3. An apparatus for dynamically reorganizing raid according to bad block distribution, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor executes the program to perform the steps of:
obtaining a bad block in a first Die in an SSD hard disk, wherein the SSD hard disk is provided with N dice and the SSD hard disk is provided with Raid of a group N + 1;
judging the number of idle blocks in the first Die;
setting the first Die to a read-only state when the number of free blocks is less than a predetermined threshold;
continuing reading and writing by using the rest N-1 Dies;
when the last Die capable of being read and written remains, the SSD hard disk is set to be read only;
specifically, the number of idle blocks in the first Die is determined, where an idle block refers to a memory block that is not read or written and can normally perform read or write operations, a predetermined threshold of the idle block is obtained, the predetermined threshold may be set according to an actual situation, and the number of idle blocks in the first Die and the obtained predetermined threshold are not in sequence, and may be obtained simultaneously or sequentially; when a bad block occurs, if the number of the idle blocks is more than or equal to the preset threshold value, replacing the bad block by a good block; if the number of the idle blocks is smaller than a preset threshold value, the Die enters a read-only state, but not the whole hard disk enters the read-only state, so that the hard disk can still write data under the condition that one Die has too many bad blocks and cannot write data;
when continuing to read and write using the remaining N-1 Dies, the SSD hard disk has a Raid of group (N-2) + 1; after the first Die is set to be in a read-only state, replacing the bad block with an idle good block; if the first Die is the Die storing the check data, re-performing Raid; specifically, the remaining N-1 dice are used to continue reading and writing the Raid of the group (N-2) +1, when the last readable and writable Die remains, full disk read-only is performed, the service life of the solid state disk is terminated, and the written data can continue until the last two dice remain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810279125.0A CN108509154B (en) | 2018-03-31 | 2018-03-31 | Method and device for dynamically recombining raid according to bad block distribution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810279125.0A CN108509154B (en) | 2018-03-31 | 2018-03-31 | Method and device for dynamically recombining raid according to bad block distribution |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108509154A CN108509154A (en) | 2018-09-07 |
| CN108509154B true CN108509154B (en) | 2021-07-13 |
Family
ID=63379547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810279125.0A Active CN108509154B (en) | 2018-03-31 | 2018-03-31 | Method and device for dynamically recombining raid according to bad block distribution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108509154B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110989930B (en) * | 2019-11-22 | 2023-07-18 | 浪潮(北京)电子信息产业有限公司 | Pool space data processing method, device, equipment and storage medium |
| CN112927749B (en) * | 2021-03-09 | 2022-07-05 | 杭州海康威视数字技术股份有限公司 | Solid state disk management method and device, electronic equipment and solid state disk |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6917544B2 (en) * | 2002-07-10 | 2005-07-12 | Saifun Semiconductors Ltd. | Multiple use memory chip |
| JP5002719B1 (en) * | 2011-03-10 | 2012-08-15 | 株式会社東芝 | Information processing device, external storage device, host device, relay device, control program, and information processing device control method |
| CN105468291B (en) * | 2014-08-21 | 2019-09-20 | 腾讯科技（深圳）有限公司 | Dynamic and static wear balance control method and device |
| CN107544925B (en) * | 2016-06-24 | 2020-05-08 | 爱思开海力士有限公司 | Memory system and method for accelerating boot time |
| CN107632940A (en) * | 2017-08-11 | 2018-01-26 | 记忆科技(深圳)有限公司 | A kind of solid state hard disc RAID rubbish recovering methods |
-
2018
- 2018-03-31 CN CN201810279125.0A patent/CN108509154B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN108509154A (en) | 2018-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107943421B (en) | Partition division method and device based on distributed storage system | |
| CN107220148B (en) | Reconstruction method and device for redundant array of independent disks | |
| CN103136074B (en) | Data storage method and data storage system of multiple disk array systems | |
| US8266475B2 (en) | Storage management device, storage management method, and storage system | |
| US10452315B2 (en) | Block priority information | |
| CN111124263B (en) | Method, electronic device and computer program product for managing a plurality of discs | |
| CN110333971B (en) | SSD bad block table backup method and device, computer equipment and storage medium | |
| CN108509154B (en) | Method and device for dynamically recombining raid according to bad block distribution | |
| US10324794B2 (en) | Method for storage management and storage device | |
| CN111124264A (en) | Method, apparatus and computer program product for reconstructing data | |
| CN110837444B (en) | Memory fault processing method and device | |
| US20150067285A1 (en) | Storage control apparatus, control method, and computer-readable storage medium | |
| CN116501259A (en) | Disk group dual-activity synchronization method and device, computer equipment and storage medium | |
| US20150278299A1 (en) | External merge sort method and device, and distributed processing device for external merge sort | |
| CN106708445A (en) | Link selection method and device | |
| CN108108131B (en) | Data processing method and device for SSD (solid State disk) | |
| US20180246788A1 (en) | Method and apparatus for recovering in-memory data processing system | |
| CN111221681A (en) | Memory repairing method and device | |
| CN113805800B (en) | RAID stripe-based IO writing method, device, equipment and readable medium | |
| CN109542687B (en) | RAID level conversion method and device | |
| CN113687977A (en) | Data processing device based on RAID controller to realize calculation performance improvement | |
| CN103064803B (en) | A kind of data read-write method of NAND Flash storage device and device | |
| CN102508738B (en) | Backup method of service information of multi-core processor, inner core and backup inner core | |
| US20120210061A1 (en) | Computer and method for testing redundant array of independent disks of the computer | |
| CN110147298A (en) | Virtual tape library backup system, equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190812 Address after: 518067 Dongjiaotou Workshop D24/F-02, Houhai Avenue, Shekou Street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: Shenzhen Yi Lian Information System Co., Ltd. Address before: 100176 Beijing Daxing District Beijing Economic and Technological Development Zone No. 58 Jinghai Road, No. 5 Building No. 3, No. 305 Applicant before: Beijing legend core technology Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |