CN111858394B - Flow control method and device for garbage collection, computer equipment and storage medium - Google Patents
Flow control method and device for garbage collection, computer equipment and storage medium Download PDFInfo
- Publication number
- CN111858394B CN111858394B CN202010740025.0A CN202010740025A CN111858394B CN 111858394 B CN111858394 B CN 111858394B CN 202010740025 A CN202010740025 A CN 202010740025A CN 111858394 B CN111858394 B CN 111858394B
- Authority
- CN
- China
- Prior art keywords
- calculating
- write amplification
- adj
- free
- garbage collection
- 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
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000003321 amplification Effects 0.000 claims abstract description 54
- 238000003199 nucleic acid amplification method Methods 0.000 claims abstract description 54
- 238000004590 computer program Methods 0.000 claims description 16
- 238000004364 calculation method Methods 0.000 claims description 14
- 239000002699 waste material Substances 0.000 claims description 6
- 238000011084 recovery Methods 0.000 claims description 4
- 239000013589 supplement Substances 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
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/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0253—Garbage collection, i.e. reclamation of unreferenced memory
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System (AREA)
Abstract
The invention relates to a flow control method, a flow control device, a computer device and a storage medium for garbage collection; wherein, the method comprises the following steps: judging whether the selected source flash memory block is carried out when the last garbage collection task exits; if yes, selecting a plurality of new source flash memory blocks to be combined; calculating average write amplification wa according to Trunk; calculating a write amplification coefficient adj; calculating a difference delta between the handling positions; calculating releasable data flow for writing by a host; and carrying the data in the Trunk to obtain available blocks for the host to write the data. According to the invention, by starting flow control after entering the garbage collection task and starting real-time flow control statistics, the space available for writing is calculated in real time, so that more accurate writing flow control is realized, and the balance between the consumption of host writing to the address pool and the supplement of the garbage collection task to the address pool is maintained.
Description
Technical Field
The invention relates to the technical field of garbage collection of solid state disks, in particular to a garbage collection flow control method, a garbage collection flow control device, computer equipment and a storage medium.
Background
Among the SSD firmware tasks is a very critical task: garbage collection (Garbage Collection) is to copy the "valid page" data in a "flash memory block" into a "blank block", then completely erase the block, so as to prevent the block in the address pool from being consumed, and cause command timeout.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a flow control method, a flow control device, computer equipment and a storage medium for garbage collection.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
the flow control method for garbage recovery comprises the following steps:
judging whether the selected source flash memory block is carried out when the last garbage collection task exits;
if yes, selecting a plurality of new source flash memory blocks for combination, and marking the combination as Trunk;
calculating average write amplification according to the Trunk, and recording the average write amplification as wa;
obtaining the number of the rest free blocks in the address pool, calculating a write amplification coefficient according to the number of the free blocks, and recording the write amplification coefficient as adj;
acquiring the carrying position of the current new source flash memory block and the carrying position of the source flash memory block selected when the last garbage collection task exits, calculating the difference between the carrying positions, and recording the difference as delta;
calculating releasable data flow for host writing according to average write amplification, write amplification coefficient and difference;
and carrying the data in the Trunk to obtain available blocks for the host to write the data.
The further technical scheme is as follows: the step "calculate average write amplification from Trunk and record average write amplification as wa", where wa' is calculated as the total number of all pages in Trunk/the total number of all valid pages in Trunk.
The further technical scheme is as follows: the method comprises the steps of acquiring the number of idle blocks remained in an address pool, calculating a write amplification coefficient according to the number of idle blocks, marking the write amplification coefficient as adj', marking the number of the remained idle blocks as free, setting 3 thresholds according to the free, and respectively setting the thresholds GCTH, TH2 and TH1 from large to small; the adj is calculated in the following way: when free is less than TH1, adj is set to 1.2; when free is between TH1 and TH2, adj is set to 1; when free is between TH2 and GCTH, adj is set to 0.8.
The further technical scheme is as follows: in the step of calculating the releasable data stream for writing by the host according to the average write amplification, the write amplification coefficient and the difference value, the calculated releasable data stream for writing by the host is: delta/(wa) adj.
A waste reclamation flow control device comprising: the device comprises a judging unit, a selecting unit, a first calculating unit, a first obtaining calculating unit, a second calculating unit and a carrying unit;
the judging unit is used for judging whether the selected source flash memory block is carried out when the last garbage collection task exits;
the selecting unit is used for selecting a plurality of new source flash memory blocks to be combined and marking the combination as a Trunk;
the first calculation unit is used for calculating average write amplification according to Trunk and recording the average write amplification as wa;
the first obtaining and calculating unit is used for obtaining the number of the rest free blocks in the address pool, calculating a write amplification coefficient according to the number of the free blocks, and recording the write amplification coefficient as an adj;
the second obtaining and calculating unit is used for obtaining the carrying position of the current new source flash memory block and the carrying position of the source flash memory block selected when the last garbage collection task exits, calculating the difference between the carrying positions, and recording the difference as delta;
the second calculating unit is used for calculating a releasable data stream for writing by a host according to the average write amplification, the write amplification coefficient and the difference value;
and the carrying unit is used for carrying the data in the Trunk to obtain an available block for the host to write the data.
The further technical scheme is as follows: in the first calculation unit, the calculation formula of wa is the total number of all pages in Trunk/the total number of all valid pages in Trunk.
The further technical scheme is as follows: in the first acquisition and calculation unit, the number of the rest idle blocks is recorded as free, 3 thresholds are set according to the free, and the thresholds GCTH, TH2 and TH1 are respectively set from large to small; the adj is calculated in the following way: when free is less than TH1, adj is set to 1.2; when free is between TH1 and TH2, adj is set to 1; when free is between TH2 and GCTH, adj is set to 0.8.
The further technical scheme is as follows: in the second calculating unit, the calculated releasable data stream for writing by the host is: delta/(wa) adj.
A computer device comprising a memory and a processor, the memory having stored thereon a computer program, the processor implementing a method of controlling the flow of waste reclamation as described above when the computer program is executed.
A storage medium storing a computer program comprising program instructions which, when executed by a processor, implement a method of flow control for garbage collection as described above.
Compared with the prior art, the invention has the beneficial effects that: by starting flow control after entering the garbage collection task and starting real-time flow control statistics, the space available for writing is calculated in real time, more accurate writing flow control is realized, the balance between the consumption of host writing to an address pool and the supplement of the garbage collection task to the address pool is maintained, and the requirements can be better met.
The invention is further described below with reference to the drawings and specific embodiments.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a prior art garbage collection application;
FIG. 2 is a second schematic diagram of the prior art garbage collection application;
FIG. 3 is a third schematic illustration of an application of conventional garbage collection;
fig. 4 is a flow chart of a flow control method for garbage collection according to an embodiment of the present invention;
FIG. 5 is a schematic block diagram of a flow control device for garbage collection according to an embodiment of the present invention;
fig. 6 is a schematic block diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be understood that the terms "comprises" and "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in the present specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes such combinations.
Referring to fig. 1 to 6, wherein referring to the prior art shown in fig. 1 to 3, when there is insufficient blocks available for writing in the address pool, firmware triggers a garbage collection task, and the firmware selects a certain flash memory block called a source flash memory block, reads valid pages in the source flash memory block one by one and writes the valid pages into a target block, and erases and releases the source flash memory block for writing later; as shown in fig. 1, blk a and blk b are selected source flash blocks, wherein ABCDE is 5 valid pages, the rest is invalid data, the valid pages are transported and rewritten to a target block blk x, empty spaces in blk x represent unwritten pages, after blk a and blk b are transported, all pages are invalid pages, as shown in fig. 2, and after erasure, the unwritten pages are released for rewriting.
Wherein, as shown in FIG. 3, the "host write" operation requires that blocks be retrieved from the "address pool" and written, while the "garbage collection" frees blocks available for writing to supplement the "address pool"; under the task of 'garbage collection', the remained resources of an 'address pool' are often not more, if the consumption of the resources by the operation of 'host writing' is larger than the speed of releasing the resources by 'garbage collection', the 'address pool' is consumed, and at the moment, a write command newly entering an SSD is overtime due to insufficient resources; therefore, it is important to limit the current flow of the "host write" task under the "garbage collection" task, and the current firmware tends to limit the current flow of the "host write" operation under the "garbage collection" at an estimated fixed flow limit speed, which tends to be inaccurate.
Referring to fig. 4, the invention discloses a flow control method for garbage recovery, which comprises the following steps:
s1, judging whether the selected source flash memory block is carried out when the last garbage collection task exits; if not, entering S8, and continuing to carry until carrying is completed;
s2, if yes, selecting a plurality of new source flash memory blocks for combination, and marking the combination as Trunk;
wherein, a plurality of is 2-8, and in this embodiment, a plurality of is 4, is convenient for combination and transport.
S3, calculating average write amplification according to the Trunk, and recording the average write amplification as wa;
in this embodiment, wa is calculated as the total number of all pages in the Trunk/the total number of all valid pages in the Trunk.
S4, obtaining the number of the rest free blocks in the address pool, calculating a write amplification coefficient according to the number of the free blocks, and recording the write amplification coefficient as adj;
in this embodiment, the number of remaining idle blocks is denoted as free, and 3 thresholds are set according to free, from large to small, as thresholds GCTH, TH2, and TH1, respectively; when free < GCTH indicates that the residual idle block is less than the threshold GCTH, a garbage collection task needs to be triggered; TH1 and TH2 are thresholds used for calculating the write amplification factor adj; the adj is calculated in the following way: when free is smaller than TH1, the idle block is seriously insufficient, and the adj is set to be 1.2, so that the write amplification is properly amplified, and the writing operation of a host is reduced; when free is between TH1 and TH2, adj is set to 1, maintaining write amplification; when free is between TH2 and GCTH, it indicates that the free block is relatively abundant, the write amplification is reduced, the host write amount is increased, and adj is set to 0.8, so that the calculation aims to feedback adjust the efficiency of flow control according to the number of the remaining free blocks, so that the flow control is more accurate.
Further, in the present embodiment, the threshold values GCTH are 13, TH2 are 9, and TH1 are 5.
S5, acquiring the carrying position of the current new source flash memory block and the carrying position of the source flash memory block selected when the last garbage collection task exits, calculating the difference between the carrying positions, and recording the difference as delta;
in this embodiment, the updating of the conveyance position is performed in real time in the background.
S6, calculating releasable data flow for host writing according to the average write amplification, the write amplification coefficient and the difference value;
and S7, carrying the data in the Trunk to obtain an available block for the host to write the data.
In this embodiment, after the data in the Trunk is carried, the block in the Trunk is erased to obtain an available block for the host to write the data.
The steps S1-S8 are circularly executed to meet the continuous writing requirement of the host.
According to the invention, by starting flow control after entering the garbage collection task and starting real-time flow control statistics, the space available for writing is calculated in real time, so that more accurate writing flow control is realized, the balance between the consumption of host writing to the address pool and the supplement of the garbage collection task to the address pool is maintained, and the requirements can be better met.
Referring to fig. 5, the invention also discloses a flow control device for garbage recovery, which comprises: a judging unit 10, a selecting unit 20, a first calculating unit 30, a first acquiring calculating unit 40, a second acquiring calculating unit 50, a second calculating unit 60, and a carrying unit 70;
the judging unit 10 is configured to judge whether the source flash memory block selected when the last garbage collection task exits has been carried;
the selecting unit 20 is configured to select a plurality of new source flash blocks for combination, and record the combination as a Trunk;
the first calculating unit 30 is configured to calculate an average write amplification according to Trunk, and record the average write amplification as wa;
the first obtaining calculating unit 40 is configured to obtain the number of spare blocks remaining in the address pool, calculate a write amplification coefficient according to the number of spare blocks, and record the write amplification coefficient as an adj;
the second obtaining and calculating unit 50 is configured to obtain a carrying position of a current new source flash memory block and a carrying position of a source flash memory block selected when the last garbage collection task exits, calculate a difference between the carrying positions, and record the difference as delta;
the second calculating unit 60 is configured to calculate a releasable data stream for writing by the host according to the average write amplification, the write amplification coefficient, and the difference value;
the handling unit 70 is configured to handle the data in the Trunk to obtain an available block for writing data by the host.
In the first calculation unit 30, the calculation formula of wa is the total number of all pages in Trunk/the total number of all valid pages in Trunk.
Wherein, in the first acquisition and calculation unit 40, the number of the remaining idle blocks is denoted as free, and 3 thresholds are set according to free, from large to small, as thresholds GCTH, TH1, and TH2, respectively; the adj is calculated in the following way: when free is less than TH1, adj is set to 1.2; when free is between TH1 and TH2, adj is set to 1; when free is between TH2 and GCTH, adj is set to 0.8.
Wherein, in the second calculating unit 60, the calculated releasable data stream for writing by the host is: delta/(wa) adj.
It should be noted that, as those skilled in the art can clearly understand the specific implementation process of the flow control device and each unit for garbage collection, reference may be made to the corresponding description in the foregoing method embodiment, and for convenience and brevity of description, details are not repeated here.
The above-described waste reclamation flow control means may be implemented in the form of a computer program which is executable on a computer device as shown in figure 6.
Referring to fig. 6, fig. 6 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 a communication function, such as a smart phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant, and a wearable device. The server may be an independent server or a server cluster formed by a plurality of servers.
With reference to FIG. 6, the computer device 500 includes a processor 502, memory, and a network interface 505 connected by 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 may store an operating system 5031 and a computer program 5032. The computer program 5032 includes program instructions that, when executed, cause the processor 502 to perform a method of flow control for garbage collection.
The processor 502 is used to provide computing and control capabilities to support the operation of the overall computer device 500.
The internal memory 504 provides an environment for the execution of a computer program 5032 in the non-volatile storage medium 503, which computer program 5032, when executed by the processor 502, causes the processor 502 to perform a method of flow control for garbage collection.
The network interface 505 is used for network communication with other devices. Those skilled in the art will appreciate that the architecture shown in fig. 6 is merely a block diagram of a portion of the architecture in connection with the present application and is not intended to limit the computer device 500 to which the present application is applied, and that a particular computer device 500 may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
It should be appreciated that in embodiments of the present application, the processor 502 may be a central processing unit (Central Processing Unit, CPU), the processor 502 may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSPs), application specific integrated circuits (Application Specific Integrated Circuit, ASICs), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. Wherein the general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Those skilled in the art will appreciate that all or part of the flow in a method embodying the above described embodiments may be accomplished by computer programs instructing the relevant hardware. The computer program comprises 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 flow steps of the embodiments of the method described above.
Accordingly, the present invention also provides a storage medium. The storage medium may be a computer readable storage medium. The storage medium stores a computer program, wherein the computer program comprises program instructions which, when executed by a processor, implement the above-described flow control method of garbage collection.
The storage medium may be a U-disk, a removable hard disk, a Read-Only Memory (ROM), a magnetic disk, or an optical disk, or other various computer-readable storage media that can store program codes.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein may be embodied in electronic hardware, in computer software, or in a combination of the two, and that the elements and steps of the examples have been generally described in terms of function in the foregoing description to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of each unit is only one logic function division, and there may be another division manner in actual implementation. For example, multiple units or components may be combined or may be integrated into another system, or some features may be omitted, or not performed.
The steps in the method of the embodiment of the invention can be sequentially adjusted, combined and deleted according to actual needs. The units in the device of the embodiment of the invention can be combined, divided and deleted according to actual needs. In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The integrated unit may be stored in a storage medium if implemented in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention is essentially or a part contributing to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a terminal, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention.
The foregoing examples are provided to further illustrate the technical contents of the present invention for the convenience of the reader, but are not intended to limit the embodiments of the present invention thereto, and any technical extension or re-creation according to the present invention is protected by the present invention. The protection scope of the invention is subject to the claims.
Claims (8)
1. The flow control method for garbage recovery is characterized by comprising the following steps:
judging whether the selected source flash memory block is carried out when the last garbage collection task exits;
if yes, selecting a plurality of new source flash memory blocks for combination, and marking the combination as Trunk;
calculating average write amplification according to the Trunk, and recording the average write amplification as wa;
obtaining the number of the rest free blocks in the address pool, calculating a write amplification coefficient according to the number of the free blocks, and recording the write amplification coefficient as adj;
acquiring the carrying position of the current new source flash memory block and the carrying position of the source flash memory block selected when the last garbage collection task exits, calculating the difference between the carrying positions, and recording the difference as delta;
calculating releasable data flow for host writing according to average write amplification, write amplification coefficient and difference;
carrying the data in the Trunk to obtain available blocks for the host to write in the data;
the method comprises the steps of acquiring the number of idle blocks remained in an address pool, calculating a write amplification coefficient according to the number of idle blocks, marking the write amplification coefficient as adj', marking the number of the remained idle blocks as free, setting 3 thresholds according to the free, and respectively setting the thresholds GCTH, TH2 and TH1 from large to small; the adj is calculated in the following way: when free is less than TH1, adj is set to 1.2; when free is between TH1 and TH2, adj is set to 1; when free is between TH2 and GCTH, adj is set to 0.8.
2. The flow control method for garbage collection according to claim 1, wherein the step of calculating the average write amplification according to Trunk and recording the average write amplification as wa is performed by a calculation formula of wa which is the total number of all pages in Trunk/the total number of all valid pages in Trunk.
3. The method according to claim 1, wherein the step of calculating the releasable data stream for writing by the host according to the average write amplification, the write amplification factor, and the difference value is that: delta/(wa) adj.
4. A waste reclamation flow control device, comprising: the device comprises a judging unit, a selecting unit, a first calculating unit, a first obtaining calculating unit, a second calculating unit and a carrying unit;
the judging unit is used for judging whether the selected source flash memory block is carried out when the last garbage collection task exits;
the selecting unit is used for selecting a plurality of new source flash memory blocks to be combined and marking the combination as a Trunk;
the first calculation unit is used for calculating average write amplification according to Trunk and recording the average write amplification as wa;
the first obtaining and calculating unit is used for obtaining the number of the rest free blocks in the address pool, calculating a write amplification coefficient according to the number of the free blocks, and recording the write amplification coefficient as an adj;
the second obtaining and calculating unit is used for obtaining the carrying position of the current new source flash memory block and the carrying position of the source flash memory block selected when the last garbage collection task exits, calculating the difference between the carrying positions, and recording the difference as delta;
the second calculating unit is used for calculating a releasable data stream for writing by a host according to the average write amplification, the write amplification coefficient and the difference value;
the carrying unit is used for carrying the data in the Trunk to obtain available blocks for the host to write in the data;
in the first acquisition and calculation unit, the number of the rest idle blocks is recorded as free, 3 thresholds are set according to the free, and the thresholds GCTH, TH2 and TH1 are respectively set from large to small; the adj is calculated in the following way: when free is less than TH1, adj is set to 1.2; when free is between TH1 and TH2, adj is set to 1; when free is between TH2 and GCTH, adj is set to 0.8.
5. The flow control device for garbage collection according to claim 4, wherein in the first calculation unit, the calculation formula of wa is the total number of all pages in Trunk/the total number of all valid pages in Trunk.
6. The flow control device for garbage collection according to claim 4, wherein in the second calculation unit, the calculated releasable data stream for writing by the host is: delta/(wa) adj.
7. A computer device comprising a memory and a processor, the memory having stored thereon a computer program, the processor when executing the computer program implementing a method of controlling the flow of waste reclamation as claimed in any of claims 1 to 3.
8. A storage medium storing a computer program comprising program instructions which, when executed by a processor, implement the method of flow control for waste reclamation of any of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010740025.0A CN111858394B (en) | 2020-07-28 | 2020-07-28 | Flow control method and device for garbage collection, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010740025.0A CN111858394B (en) | 2020-07-28 | 2020-07-28 | Flow control method and device for garbage collection, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111858394A CN111858394A (en) | 2020-10-30 |
| CN111858394B true CN111858394B (en) | 2024-02-13 |
Family
ID=72948554
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010740025.0A Active CN111858394B (en) | 2020-07-28 | 2020-07-28 | Flow control method and device for garbage collection, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111858394B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102841850A (en) * | 2012-06-19 | 2012-12-26 | 记忆科技(深圳)有限公司 | Method and system for reducing solid state disk write amplification |
| CN109960663A (en) * | 2017-12-22 | 2019-07-02 | 三星电子株式会社 | Execute the storage device of garbage reclamation and the rubbish recovering method of storage device |
| CN109977031A (en) * | 2017-12-27 | 2019-07-05 | 成都华为技术有限公司 | The method and solid state hard disk of solid state hard disk garbage reclamation |
| CN110688326A (en) * | 2019-09-23 | 2020-01-14 | 西安微电子技术研究所 | Flash memory wear leveling algorithm based on multiple thresholds |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104298606A (en) * | 2013-07-17 | 2015-01-21 | 光宝科技股份有限公司 | Garbage collection action control method in SSD |
| US10409526B2 (en) * | 2014-12-17 | 2019-09-10 | Violin Systems Llc | Adaptive garbage collection |
| US9645922B2 (en) * | 2015-09-10 | 2017-05-09 | HoneycombData Inc. | Garbage collection in SSD drives |
| US20170199680A1 (en) * | 2016-01-13 | 2017-07-13 | Alibaba Group Holding Limited | System and method of write amplification factor mitigation and flash lifespan extension |
-
2020
- 2020-07-28 CN CN202010740025.0A patent/CN111858394B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102841850A (en) * | 2012-06-19 | 2012-12-26 | 记忆科技(深圳)有限公司 | Method and system for reducing solid state disk write amplification |
| CN109960663A (en) * | 2017-12-22 | 2019-07-02 | 三星电子株式会社 | Execute the storage device of garbage reclamation and the rubbish recovering method of storage device |
| CN109977031A (en) * | 2017-12-27 | 2019-07-05 | 成都华为技术有限公司 | The method and solid state hard disk of solid state hard disk garbage reclamation |
| CN110688326A (en) * | 2019-09-23 | 2020-01-14 | 西安微电子技术研究所 | Flash memory wear leveling algorithm based on multiple thresholds |
Non-Patent Citations (1)
| Title |
|---|
| 一种SSD存储系统中的先应式垃圾回收算法;屠雪真等;《电信科学》;86-96 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111858394A (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10732857B2 (en) | Techniques for reducing memory write operations using coalescing memory buffers and difference information | |
| US10318181B2 (en) | System, method, and computer program product for increasing spare space in memory to extend a lifetime of the memory | |
| US8171356B2 (en) | Reducing writes, and estimating and displaying estimated remaining lifetime of non-volatile memories | |
| US7809900B2 (en) | System, method, and computer program product for delaying an operation that reduces a lifetime of memory | |
| US9996462B1 (en) | Data storage device and data maintenance method thereof | |
| US20110125956A1 (en) | Techniques for multi-memory device lifetime management | |
| US10635527B2 (en) | Method for processing data stored in a memory device and a data storage device utilizing the same | |
| US20080126685A1 (en) | System, method, and computer program product for reducing memory write operations using an instruction set | |
| WO2008063647A2 (en) | Delaying an operation that reduces a lifetime of memory | |
| CN108762670B (en) | Management method, system and device for data blocks in SSD (solid State disk) firmware | |
| US10437784B2 (en) | Method and system for endurance enhancing, deferred deduplication with hardware-hash-enabled storage device | |
| CN111858394B (en) | Flow control method and device for garbage collection, computer equipment and storage medium | |
| CN116134519A (en) | Balanced three-level read disturb management in memory devices | |
| JPWO2015087651A1 (en) | Apparatus, program, recording medium and method for extending usable period of memory | |
| JP6988231B2 (en) | Information processing equipment, information processing system, information processing method and information processing program | |
| CN112416811B (en) | Garbage collection method, flash memory and device based on data association degree | |
| CN113625935B (en) | Method, apparatus, device and storage medium for reducing read disturb effect | |
| JP2010256944A (en) | Device, program and method for maintaining nand type flash memory | |
| JP4696500B2 (en) | Memory management method and apparatus | |
| CN114489506B (en) | Storage access control device, method and storage device | |
| KR100987332B1 (en) | Memory management device according to memory hierarchy | |
| US20180196722A1 (en) | Data Storage Device and Data Maintenance Method Thereof | |
| CN104331250A (en) | Data write-in method | |
| CN116504283A (en) | Optimization method, device, equipment and medium for abnormal power failure of solid state disk | |
| CN110618793A (en) | Flash memory data writing method and system for reducing GC (gas chromatography) processing amount and flash memory |
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 |