CN109284237A - A kind of full rubbish recovering method and system dodged in storage array - Google Patents
A kind of full rubbish recovering method and system dodged in storage array Download PDFInfo
- Publication number
- CN109284237A CN109284237A CN201811124070.2A CN201811124070A CN109284237A CN 109284237 A CN109284237 A CN 109284237A CN 201811124070 A CN201811124070 A CN 201811124070A CN 109284237 A CN109284237 A CN 109284237A
- Authority
- CN
- China
- Prior art keywords
- space
- relation information
- mapping
- mapping relation
- data
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0891—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches using clearing, invalidating or resetting means
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System (AREA)
Abstract
This application provides a kind of full rubbish recovering methods dodged in storage array, it include: to delete the HP mapping relation information in mapping relation information when the initial LP mapping for being mapped to the first space is not present according to the corresponding mapping relation information judgement in complete the first space dodged in storage array；According to mapping relation information inquiry with the presence or absence of the LP mapping for being mapped to the first space；If so, the Data Migration in the first space to second space is established the corresponding mapping relation information of second space.Wherein, it inquires in the presence of the LP mapping for being mapped to the first space, illustrates there is host IO to write identical data when deleting HP mapping relation information, need not wait for and delete the completion of HP mapping relation information.Therefore can to avoid allow host IO wait, and then not traffic affecting respond.The application also provides a kind of full garbage retrieving system dodged in storage array, full sudden strain of a muscle storage array and computer readable storage medium, all has above-mentioned beneficial effect.
Description
Technical field
Dodge field of storage this application involves complete, in particular to a kind of full rubbish recovering method dodged in storage array, system,
It is complete to dodge storage array and computer readable storage medium.
Background technique
The full storage array that dodges is to guarantee the service life of SSD disk in an array, and host IO is often write using redirection instead of covering
It the mode write and needs to do garbage reclamation and carrys out Free up Memory；Again since SSD disk price is relatively high, and to be further ensured that
The service life of SSD disk often opens to delete function again and be actually written into data volume reducing SSD disk and improves space utilization rate.Thus
It will appear problem of mutual exclusion, i.e., when garbage reclamation (GC, Garbage Collection) recycles space, for not had effectively
The space of host data is mapped to this without LP mapping (mapping of the physical location of volume volumes of logic LBA to storing data)
Space, needing will be mapped to the HP mapping in the space, (unlatching is when deleting again, the physical location of the hash value of data to storing data
Mapping) it deletes, and at the same time, it is possible to business can newly generate one or more newly write identical with the spatial data content and ask
It asks.
For the problem of mutual exclusion, existing processing mode is often that GC makes marks to the hash value of data when deleting HP mapping,
And after host IO discovery GC makes marks to hash value: host IO writes data to new position after the completion of waiting GC to delete HP mapping
It sets, remaining write request generates new LP mapping relations and is mapped to the position later.But which can allow host IO to wait,
And then traffic affecting response.
Therefore, how to avoid that host IO is allowed to wait, and then traffic affecting response is not that those skilled in the art need to solve
Certainly the technical issues of.
Summary of the invention
The purpose of the application is to provide the full rubbish recovering method dodged in storage array of one kind, system, dodges storage array entirely
And computer readable storage medium, it can be avoided and host IO is allowed to wait, and then traffic affecting does not respond.
In order to solve the above technical problems, the application provides a kind of full rubbish recovering method dodged in storage array, comprising:
When according to the complete corresponding mapping relation information judgement in the first space dodged in storage array, there is no be mapped to
When the initial LP mapping in first space, the HP mapping relation information in the mapping relation information is deleted；
According to mapping relation information inquiry with the presence or absence of the LP mapping for being mapped to first space；
If so, by the Data Migration in first space to second space, establish that the second space is corresponding to be reflected
Penetrate relation information.
Preferably, after deleting the HP mapping relation information in the mapping relation information, further includes:
Judge that the host IO writes data identical with the data according to the corresponding count results of the quantity of host IO
Enter whether the full sudden strain of a muscle storage array is completed；Wherein, the host IO starts to write at the time of the data correspond to and reflect in the HP
Before penetrating at the time of relation information deletion completes corresponding；
If so, executing the LP that whether there is according to mapping relation information inquiry and be mapped to first space
The step of mapping.
Preferably, it is corresponding to establish the second space to second space for the Data Migration by first space
Mapping relation information, comprising:
After the data are read from first space, the second space is written；
Establish the corresponding LP mapping relation information of the second space.
Preferably, this dodges the rubbish recovering method in storage array entirely further include:
It is mapped to the LP mapping in first space if it does not exist, then completes the recycling to first space.
The application also provides a kind of full garbage retrieving system dodged in storage array, is applied to dodge storage array entirely, comprising:
HP mapping relation information removing module, for being reflected when according to complete first space dodged in storage array is corresponding
Relation information judgement is penetrated there is no when the initial LP mapping for being mapped to first space, is deleted in the mapping relation information
HP mapping relation information；
LP map query module is mapped to first space for whether there is according to mapping relation information inquiry
LP mapping；
Data Migration module, the LP for being mapped to first space if it exists maps, then empty by described first
Between in Data Migration to second space, establish the corresponding mapping relation information of the second space.
Preferably, this dodges the garbage retrieving system in storage array entirely further include:
Judgment module is completed in write-in, judges that the host IO will be with for the corresponding count results of quantity according to host IO
Whether the identical data write-in of the data full sudden strain of a muscle storage array is completed；Wherein, the host IO starts to write the data
At the time of corresponding before the HP mapping relation information is deleted at the time of completion corresponds to；
The LP map query module be specially work as the host IO will the write-in of identical with data data it is described complete
When dodging storage array completion, mapped according to mapping relation information inquiry with the presence or absence of the LP for being mapped to first space.
Preferably, the Data Migration module, comprising:
The second space is written after reading the data from first space in read-write cell；
Mapping relation information establishes unit, for establishing the corresponding LP mapping relation information of the second space.
Preferably, this dodges the garbage retrieving system in storage array entirely further include:
Module is completed in recycling, and the LP for being mapped to first space if it does not exist maps, then is completed to described
The recycling in the first space.
The application also provides a kind of full sudden strain of a muscle storage array, comprising:
Memory and processor；Wherein, the memory is for storing computer program, and the processor is for executing institute
The step of rubbish recovering method in full sudden strain of a muscle storage array described above is realized when stating computer program.
The application also provides a kind of computer readable storage medium, and the computer-readable recording medium storage has computer
Program, the computer program realize the rubbish recovering method in full sudden strain of a muscle storage array described above when being executed by processor
Step.
The full rubbish recovering method dodged in storage array of one kind provided herein, comprising: when according to the full flash memory
There is no the initial LP mappings for being mapped to first space for the corresponding mapping relation information judgement in the first space in storage array
When, delete the HP mapping relation information in the mapping relation information；It whether there is according to mapping relation information inquiry and reflect
It is mapped to the LP mapping in first space；If so, by the Data Migration in first space to second space, described in foundation
The corresponding mapping relation information of second space.
Storage array is dodged in this method entirely and is judging that there is no be mapped to first space according to mapping relation information
After initial LP mapping, the HP mapping relation information in the mapping relation information is deleted.It is looked into further according to the mapping relation information
After asking out in the presence of the LP mapping in first space is mapped to, by the Data Migration in first space to second space, build
Found the corresponding mapping relation information of the second space.Wherein, it inquires in the presence of the LP mapping for being mapped to the first space, illustrates
There is host IO to write identical data when deleting HP mapping relation information, it is complete to need not wait for deletion HP mapping relation information
At.Therefore can to avoid allow host IO wait, and then not traffic affecting respond.In addition, the method reduce same part data to deposit
More parts a possibility that, therefore the writing without increasing data, and then opposite improve the IO performance of system, deletes rate again；Moreover, should
Method deletes HP mapping, therefore avoids the complex process after unerasing HP mapping, and realization is also relatively easy, reduces complexity
Degree.The application also provides a kind of full garbage retrieving system dodged in storage array, full sudden strain of a muscle storage array and computer-readable storage
Medium all has above-mentioned beneficial effect, and details are not described herein.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of application for those of ordinary skill in the art without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is the flow chart for the rubbish recovering method that one kind provided by the embodiment of the present application is dodged entirely in storage array；
Fig. 2 is the entire flow for the rubbish recovering method that one kind provided by the embodiment of the present application is dodged entirely in storage array
Figure；
Fig. 3 is the structural block diagram for the garbage retrieving system that one kind provided by the embodiment of the present application is dodged entirely in storage array.
Specific embodiment
The core of the application is to provide a kind of full rubbish recovering method dodged in storage array, can be avoided and allows host IO etc.
To, and then traffic affecting does not respond.Another core of the application is to provide the full garbage retrieving system dodged in storage array, complete
Dodge storage array and computer readable storage medium.
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application
In attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is
Some embodiments of the present application, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall in the protection scope of this application.
The mode of the relevant technologies processing problem of mutual exclusion makes marks to the hash value of data when being often GC deletion HP mapping, and
After host IO discovery GC makes marks to hash value: host IO writes data to new position after the completion of waiting GC to delete HP mapping
It sets, remaining write request generates new LP mapping relations and is mapped to the position later.But which can allow host IO to wait,
And then traffic affecting response.The embodiment of the present application just has host IO to write when dodging storage array entirely and deleting HP mapping relation information
Data need not wait for and delete HP mapping relation information and complete, can be avoided and host IO is allowed to wait, and then not traffic affecting
Response.Therefore the executing subject of the embodiment of the present application is full sudden strain of a muscle storage array, specifically referring to FIG. 1, Fig. 1 is the embodiment of the present application institute
The full flow chart for dodging the rubbish recovering method in storage array of one kind of offer, this dodges the rubbish recovering method in storage array entirely
It specifically includes:
S101, there is no be mapped to the corresponding mapping relation information judgement in the first space dodged in storage array when basis is complete
When the initial LP mapping in the first space, the HP mapping relation information in mapping relation information is deleted.
The full storage array that dodges is the independent storage array being made of completely solid storage medium or equipment, these systems are
It may be comprising the performance of the environment of disk array, or for replacing all traditional hard-disc storage arrays for enhancing.Herein
The full brand parameter for dodging storage array is not especially limited, should be made according to the actual situation by those skilled in the art corresponding
Setting, such as can be Dell Equal Logic PS6210S.In addition, (per second for the capacity and IOPS that dodge storage array entirely
Input/output number) also it is not especially limited.Above-mentioned first space is the full space dodged in storage array and be used to store data,
It is not especially limited for dodging in storage array the quantity for storing the space of data and space size entirely, it should be by art technology
Personnel make corresponding setting according to the actual situation.
Above-mentioned mapping relation information generally includes initial LP mapping relation information and HP mapping relation information, for mapping
The existence form of relation information is not especially limited, and corresponding setting should be made according to the actual situation by those skilled in the art,
Exist usually in the form of mapping table.Correspondingly, initial LP mapping relation information and HP mapping relation information are generally also to reflect
The form of firing table exists.According to the corresponding mapping relation information judgement in complete the first space dodged in storage array, there is no be mapped to
Data in the initial LP mapping in the first space namely the first space are invalid data, but calculated using the data
There is also mapping relations, that is, HP to map for hash value and the first space, therefore needs to delete mapping relations letter before recycling the first space
HP mapping relation information in breath deletes HP mapping.
S102, it is mapped according to mapping relation information inquiry with the presence or absence of the LP for being mapped to the first space.
The full storage array that dodges is looked into after deleting the HP mapping relation information in mapping relation information according to mapping relation information
It askes with the presence or absence of the LP mapping for being mapped to the first space.Specifically, inquiring whether there is LP mapping relations in mapping relation information
Information, there are two types of situations altogether: there are LP mapping relation informations in mapping relation information；There is no LP to map in mapping relation information
Relation information.It is the presence of the LP mapping for being mapped to the first space for the previous case, illustrates that dodge storage array entirely reflects in deletion
During penetrating the HP mapping relation information in relation information, host IO prepares to write and the in some space for dodging storage array entirely
The identical data of data in one space.It often opens due to dodging storage array entirely and deletes function again and improve space utilization rate, namely
For identical data, dodged in storage array entirely save it is a, a possibility that reducing same part data there are more parts,
Therefore the writing without increasing data, and then improve the IO performance of system relatively, delete rate again.Deleting HP mapping relation information
In the process, data in the first space or existing, therefore do not need to write data in some above-mentioned space, directly with first
LP mapping is established in space.For latter situation, illustrate to be not mapped into first during deleting HP mapping relation information
The LP in space maps, and the data in the first space are still invalid data.
S103, the LP mapping for being mapped to the first space if it exists, then by the Data Migration in the first space to second space,
Establish the corresponding mapping relation information of second space.
It is mapped to the LP mapping in the first space if it exists, illustrates that the data in the first space are valid data.But full sudden strain of a muscle
Storage array still will continue to the first space of recycling, therefore by the Data Migration in the first space to second space, establish second space
Corresponding mapping relation information.Above-mentioned second space is also dodging in storage array entirely, and the space size of second space is being expired
Foot is also not especially limited under the premise of storing above-mentioned data, should be made according to the actual situation by those skilled in the art corresponding
Setting.
In addition, being mapped to the LP mapping in the first space if it does not exist, then storage array is dodged entirely and executes corresponding operation, specifically
Which kind of it is not especially limited for operation, it will usually complete the recycling to the first space.The full garbage reclamation side dodged in storage array
The complete procedure of method is as shown in Fig. 2, Fig. 2 is that one kind provided by the embodiment of the present application dodges the garbage reclamation side in storage array entirely
The entire flow figure of method.As seen from the figure, when according to the corresponding mapping relation information judgement in complete the first space dodged in storage array
When mapping there is no the initial LP for being mapped to the first space, the HP mapping relation information in mapping relation information is deleted；According to reflecting
Relation information inquiry is penetrated with the presence or absence of the LP mapping for being mapped to the first space；If so, extremely by the Data Migration in the first space
Second space establishes the corresponding mapping relation information of second space；If it is not, then completing the recycling to the first space.
Storage array is dodged in the present embodiment entirely and is judging that there is no be mapped to the first of the first space according to mapping relation information
After the mapping of beginning LP, the HP mapping relation information in mapping relation information is deleted.It inquires to exist further according to mapping relation information and reflect
After being mapped to the LP mapping in the first space, by the Data Migration in the first space to second space, establish that second space is corresponding to be reflected
Penetrate relation information.Wherein, it inquires in the presence of the LP mapping for being mapped to the first space, illustrates when deleting HP mapping relation information
There is host IO to write identical data, needs not wait for and delete the completion of HP mapping relation information.Therefore it can be to avoid allowing host IO etc.
To, and then traffic affecting does not respond.In addition, the method reduce same part data there are more parts a possibility that, therefore do not increase
The writing of addend evidence, and then improve the IO performance of system relatively, delete rate again；Moreover, this method deletes HP mapping, therefore avoid
Unerase the complex process after HP mapping, realizes also relatively easy, reduces complexity.Further, for backstage industry
Problem of mutual exclusion between business and front desk service, it may be considered that similar mode reduces the influence to front desk service.At this to backstage
Business and front desk service are not especially limited, and Batch Processing is commonly referred to as the business that host is not felt by, such as garbage reclamation；
Front desk service is commonly referred to as the business that host can be experienced, such as host IO writes the speed situation of data.
Based on the above embodiment, it after the HP mapping relation information in mapping relation information is deleted in the present embodiment, also wraps
It includes: judging that host IO will the full sudden strain of a muscle storage array of data write-in identical with data according to the corresponding count results of the quantity of host IO
Whether complete；Wherein, host IO start to write at the time of data correspond to HP mapping relation information delete complete corresponding at the time of it
Before；If so, executing the step of mapping according to mapping relation information inquiry with the presence or absence of the LP for being mapped to the first space.It leads herein
The corresponding hash value of the data that machine IO writes i.e. data identical as the data in above-mentioned first space be it is identical, at this to host IO
Quantity and the process that obtains of the quantity be not especially limited, it usually needs the quantity of statistics host IO in advance.Into
One step, a counting is done to the quantity, is completed whenever a host IO writes data, which subtracts 1 until being zero.
Judge that full flash memory is written in data identical with data by host IO according to the corresponding count results of the quantity of host IO
Whether storage array is completed, and there are two types of situations altogether: if count results are not zero, host IO, which writes data into the full storage array that dodges, not to be had
There is completion；If count results are zero, host IO writes data into the full storage array that dodges and completes.It is complete to dodge for the previous case
Storage array waits host IO to write data into the full storage array that dodges and completes；For latter situation, the full storage array that dodges is executed
The step of according to mapping relation information inquiry with the presence or absence of the LP mapping for being mapped to the first space.HP mapping relation information is waited to delete
It is such in order to prevent happen except the host IO for writing identical data before at the time of completing corresponding is completed: according to reflecting
Relation information inquiry is penetrated there is no the LP mapping for being mapped to the first space, as a result actually but there is the LP for being mapped to the first space
Mapping.Because may generate the LP mapping for being mapped to the first space when inquiry, i.e. inquiry may be inquired not too early
It is mapped to the LP for being mapped to the first space.
Based on the above embodiment, the Data Migration in the first space to second space is established into the second sky in the present embodiment
Between corresponding mapping relation information, generally include: by data from the first space read after, be written second space；Establish the second sky
Between corresponding LP mapping relation information.The corresponding mapping relation information of above-mentioned second space includes at least the corresponding LP of second space
Mapping relation information, because being exactly in the presence of the LP mapping for being mapped to second space there are LP mapping relation information, it is meant that second
Data in space are valid data, and then second space will not be fallen by garbage reclamation.In addition, the mapping relation information can be with
Including the corresponding HP mapping relation information of second space.
Below to a kind of full garbage retrieving system dodged in storage array provided by the embodiments of the present application, dodge storage array entirely
And computer readable storage medium is introduced, garbage retrieving system, the storage of full flash memory in full sudden strain of a muscle storage array described below
Array and computer readable storage medium can correspond to each other ginseng with the above-described full rubbish recovering method dodged in storage array
According to.
Referring to FIG. 3, Fig. 3 is the garbage retrieving system that one kind provided by the embodiment of the present application is dodged entirely in storage array
Structural block diagram；This it is complete dodge storage array in garbage retrieving system include:
HP mapping relation information removing module 301, for being reflected when according to complete the first space dodged in storage array is corresponding
Relation information judgement is penetrated there is no when the initial LP mapping for being mapped to the first space, the HP mapping deleted in mapping relation information is closed
It is information；
LP map query module 302, for whether there is the LP for being mapped to the first space according to mapping relation information inquiry
Mapping；
Data Migration module 303, the LP for being mapped to the first space if it exists maps, then by the data in the first space
It migrates to second space, establishes the corresponding mapping relation information of second space.
Based on the above embodiment, which also typically includes:
Judgment module is completed in write-in, judges that host IO will be with data for the corresponding count results of quantity according to host IO
Identical data write-in is complete to dodge whether storage array is completed；Wherein, host IO starts to write to map at the time of data correspond in HP and close
Before at the time of being information deletion completion correspondence；
LP map query module be specially when host IO by the write-in of identical with data data is complete dodge storage array and complete when,
According to mapping relation information inquiry with the presence or absence of the LP mapping for being mapped to the first space.
Based on the above embodiment, Data Migration module generally includes:
Second space is written after reading data from the first space in read-write cell；
Mapping relation information establishes unit, for establishing the corresponding LP mapping relation information of second space.
Based on above-mentioned any embodiment, which is also typically included:
Module is completed in recycling, and the LP for being mapped to the first space if it does not exist maps, then completes to go back to the first space
It receives.
The application also provides a kind of full sudden strain of a muscle storage array, comprising:
Memory and processor；Wherein, memory is for storing computer program, and processor is for executing computer program
The step of rubbish recovering method in the full sudden strain of a muscle storage array of the above-mentioned any embodiment of Shi Shixian.
The application also provides a kind of computer readable storage medium, and computer-readable recording medium storage has computer journey
Sequence realizes the rubbish recovering method in the full sudden strain of a muscle storage array of above-mentioned any embodiment when computer program is executed by processor
Step.
The computer readable storage medium may include: USB flash disk, mobile hard disk, read-only memory (Read-Only
Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. is various to deposit
Store up the medium of program code.
Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with other realities
The difference of example is applied, the same or similar parts in each embodiment may refer to each other.For embodiment provide system and
Speech, since it is corresponding with the method that embodiment provides, so being described relatively simple, related place is referring to method part illustration
?.
Professional further appreciates that, unit described in conjunction with the examples disclosed in the embodiments of the present disclosure
And algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to function in the above description.These
Function is implemented in hardware or software actually, the specific application and design constraint depending on technical solution.Profession
Technical staff can use different methods to achieve the described function each specific application, but this realization is not answered
Think beyond the scope of this invention.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
It is complete to one kind provided herein above to dodge the rubbish recovering method in storage array, in full sudden strain of a muscle storage array
Garbage retrieving system, full sudden strain of a muscle storage array and computer readable storage medium are described in detail.Tool used herein
The principle and implementation of this application are described for body example, the above embodiments are only used to help understand this Shen
Method and its core concept please.It should be pointed out that for those skilled in the art, not departing from the application
Under the premise of principle, can also to the application, some improvement and modification can also be carried out, these improvement and modification also fall into the application right
It is required that protection scope in.
Claims (10)
1. a kind of full rubbish recovering method dodged in storage array characterized by comprising
When described there is no being mapped to according to the complete corresponding mapping relation information judgement in the first space dodged in storage array
When the initial LP mapping in the first space, the HP mapping relation information in the mapping relation information is deleted；
According to mapping relation information inquiry with the presence or absence of the LP mapping for being mapped to first space；
If so, establishing the corresponding mapping of the second space and closing the Data Migration in first space to second space
It is information.
2. rubbish recovering method according to claim 1, which is characterized in that the HP deleted in the mapping relation information reflects
It penetrates after relation information, further includes:
Judge that the host IO will data write-in identical with data institute according to the corresponding count results of the quantity of host IO
State whether full sudden strain of a muscle storage array is completed；Wherein, the host IO starts to write to map at the time of the data correspond in the HP and close
Before at the time of being information deletion completion correspondence；
If so, executing the LP mapping that whether there is according to mapping relation information inquiry and be mapped to first space
The step of.
3. rubbish recovering method according to claim 1, which is characterized in that the data by first space are moved
Second space is moved to, the corresponding mapping relation information of the second space is established, comprising:
After the data are read from first space, the second space is written；
Establish the corresponding LP mapping relation information of the second space.
4. rubbish recovering method according to any one of claims 1 to 3, which is characterized in that further include:
It is mapped to the LP mapping in first space if it does not exist, then completes the recycling to first space.
5. a kind of full garbage retrieving system dodged in storage array, is applied to dodge storage array entirely characterized by comprising
HP mapping relation information removing module, for being closed when according to the complete corresponding mapping in the first space dodged in storage array
It is information judgement there is no when the initial LP mapping for being mapped to first space, the HP deleted in the mapping relation information reflects
Penetrate relation information；
LP map query module, for whether there is the LP for being mapped to first space according to mapping relation information inquiry
Mapping；
Data Migration module, the LP for being mapped to first space if it exists map, then will be in first space
Data Migration to second space, establish the corresponding mapping relation information of the second space.
6. garbage retrieving system according to claim 5, which is characterized in that further include:
Write-in complete judgment module, for the corresponding count results of quantity according to host IO judge the host IO will with it is described
The identical data of data are written whether the full sudden strain of a muscle storage array is completed；Wherein, the host IO starts to write the data correspondence
At the time of the HP mapping relation information delete complete corresponding at the time of before；
The LP map query module is specially to work as the host IO the full flash memory is written in data identical with the data
When storing up array completion, according to mapping relation information inquiry with the presence or absence of the mould for the LP mapping for being mapped to first space
Block.
7. garbage retrieving system according to claim 5, which is characterized in that the Data Migration module, comprising:
The second space is written after reading the data from first space in read-write cell；
Mapping relation information establishes unit, for establishing the corresponding LP mapping relation information of the second space.
8. according to the described in any item garbage retrieving systems of claim 5 to 7, which is characterized in that further include:
Module is completed in recycling, and the LP for being mapped to first space if it does not exist maps, then is completed to described first
The recycling in space.
9. a kind of full sudden strain of a muscle storage array characterized by comprising
Memory and processor；Wherein, the memory is for storing computer program, the processor by execute it is described based on
The step of full rubbish recovering methods dodged in storage array as described in any item such as Claims 1-4 are realized when calculation machine program.
10. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has computer journey
Sequence is realized when the computer program is executed by processor as in the described in any item full sudden strain of a muscle storage arrays of Claims 1-4
The step of rubbish recovering method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811124070.2A CN109284237B (en) | 2018-09-26 | 2018-09-26 | Garbage recovery method and system in full flash memory array |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811124070.2A CN109284237B (en) | 2018-09-26 | 2018-09-26 | Garbage recovery method and system in full flash memory array |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109284237A true CN109284237A (en) | 2019-01-29 |
| CN109284237B CN109284237B (en) | 2021-10-29 |
Family
ID=65182274
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811124070.2A Active CN109284237B (en) | 2018-09-26 | 2018-09-26 | Garbage recovery method and system in full flash memory array |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109284237B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111949222A (en) * | 2020-09-18 | 2020-11-17 | 苏州浪潮智能科技有限公司 | Method for data migration in garbage recovery in full-flash disk array |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646069A (en) * | 2012-02-23 | 2012-08-22 | 华中科技大学 | Method for prolonging service life of solid-state disk |
| CN106886370A (en) * | 2017-01-24 | 2017-06-23 | 华中科技大学 | A kind of data safety delet method and system based on SSD duplicate removal technologies |
| CN107003814A (en) * | 2014-10-01 | 2017-08-01 | 邦存科技有限公司 | Effective metadata in storage system |
| CN107329692A (en) * | 2017-06-07 | 2017-11-07 | 杭州宏杉科技股份有限公司 | Method and storage device that a kind of data are deleted again |
-
2018
- 2018-09-26 CN CN201811124070.2A patent/CN109284237B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646069A (en) * | 2012-02-23 | 2012-08-22 | 华中科技大学 | Method for prolonging service life of solid-state disk |
| CN107003814A (en) * | 2014-10-01 | 2017-08-01 | 邦存科技有限公司 | Effective metadata in storage system |
| CN106886370A (en) * | 2017-01-24 | 2017-06-23 | 华中科技大学 | A kind of data safety delet method and system based on SSD duplicate removal technologies |
| CN107329692A (en) * | 2017-06-07 | 2017-11-07 | 杭州宏杉科技股份有限公司 | Method and storage device that a kind of data are deleted again |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111949222A (en) * | 2020-09-18 | 2020-11-17 | 苏州浪潮智能科技有限公司 | Method for data migration in garbage recovery in full-flash disk array |
| CN111949222B (en) * | 2020-09-18 | 2022-09-20 | 苏州浪潮智能科技有限公司 | Method for data migration in garbage recovery in full-flash disk array |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109284237B (en) | 2021-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8495282B2 (en) | Flash-aware storage optimized for mobile and embedded DBMS on NAND flash memory | |
| US7987329B2 (en) | Storage system and method of controlling the same | |
| US11782632B2 (en) | Selective erasure of data in a SSD | |
| US7325112B2 (en) | High-speed snapshot method | |
| US9778860B2 (en) | Re-TRIM of free space within VHDX | |
| CN106326229B (en) | File storage method and device of embedded system | |
| CN111399750B (en) | Flash memory data writing method and computer readable storage medium | |
| US8433871B2 (en) | Data copy management for faster reads | |
| US8019953B2 (en) | Method for providing atomicity for host write input/outputs (I/Os) in a continuous data protection (CDP)-enabled volume using intent log | |
| KR20000022716A (en) | Efficient volume copy using pre-configuration of log structured target storage | |
| US11954346B2 (en) | Using multi-stream storage devices in log structured storage system | |
| CN110309077B (en) | Method and device for constructing flash translation layer of cooperative work of host and equipment | |
| WO2024119775A1 (en) | Raid card node updating method and system, and related apparatus | |
| CN109634873A (en) | Solid-state disk host system log information method, apparatus, equipment and medium | |
| WO2024113717A1 (en) | Zns ssd-based file system control method, apparatus and device | |
| WO2021035555A1 (en) | Data storage method and apparatus for solid state disk and solid state disk (ssd) | |
| WO2020192710A1 (en) | Method for processing garbage based on lsm database, solid state hard disk, and storage apparatus | |
| CN116257460B (en) | Trim command processing method based on solid state disk and solid state disk | |
| CN109284237A (en) | A kind of full rubbish recovering method and system dodged in storage array | |
| WO2024130890A1 (en) | Solid state drive garbage collection method, solid state drive garbage collection acceleration apparatus, and device and computer medium | |
| KR101412885B1 (en) | Method and storage system for controlling materialization in a storage medium using mode setting and delimiter | |
| CN110658999A (en) | Information updating method, device, equipment and computer readable storage medium | |
| KR101426806B1 (en) | Method, computer system and storage system for controlling materialization in a storage medium based on object id and storage system | |
| CN110389706A (en) | A kind of fingerprint recovery method and storage system | |
| WO2022021280A1 (en) | Storage controller, storage control method, solid state disk and storage system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |