CN106844227A - Solid state hard disc abrasion equilibrium method and device based on grouping mechanism - Google Patents
Solid state hard disc abrasion equilibrium method and device based on grouping mechanism Download PDFInfo
- Publication number
- CN106844227A CN106844227A CN201710026799.5A CN201710026799A CN106844227A CN 106844227 A CN106844227 A CN 106844227A CN 201710026799 A CN201710026799 A CN 201710026799A CN 106844227 A CN106844227 A CN 106844227A
- Authority
- CN
- China
- Prior art keywords
- physical block
- solid state
- hard disc
- physical
- state hard
- 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.)
- Pending
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/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Read Only Memory (AREA)
Abstract
The present invention relates to technical field of memory, the invention discloses a kind of solid state hard disc abrasion equilibrium method based on grouping mechanism, including：Physical block in solid state hard disc is divided into multiple and physics number of blocks identical group；Record the erasable number of times of each physical block；After carrying out erasable operation with physical block in group, will be resequenced according to its erasable number of times with the physical block of group, obtained the information sequence of this group of new physical block；If predetermined condition is reached with the erasable number of times of two physical blocks on the information sequence of a physical block, by the data exchange of above-mentioned two physical block.The invention also discloses a kind of solid state hard disc abrasion equilibrium device based on grouping mechanism, including：Physical block grouping module, logging modle, order module, data exchange judge module.The present invention improves the service efficiency of physical block in solid state hard disc, realizes the optimization of abrasion equilibrium performance.
Description
Technical field
The present invention relates to technical field of memory, more particularly to a kind of solid state hard disc abrasion equilibrium method based on grouping mechanism
And device.
Background technology
Solid state hard disc (Solid State Disk, abbreviation SSD) is that one kind is based on permanent memory, such as flash memory, or non-
Permanent memory, the computer External memory equipment of Synchronous Dynamic Random Access Memory (SDRAM).Solid state hard disc flash memory
（SSD）Problem with the limitation of erasable number of times, if to be continued multiple erasable and other piece not erasable for a block, that
This block can be worn very much block it is bad, so as to greatly affected the life-span of SSD.SSD introduces abrasion equilibrium（Wear-
leveling）Technology come realize it is erasable operation as far as possible be evenly distributed on all of piece, so as to maximize the use longevity of SSD
Life.Abrasion equilibrium is divided into dynamic Wear-leveling and static state Wear-leveling.Dynamic wear is balanced only to be processed
Change and untapped data area, without going treatment, oneself has the region of data, it is to avoid allow computer operating system end
Application program repeats constantly same data storage block region wipe/write, so as to cause to allow whole memory cell
There is permanent damage, more seriously cause solid state hard disc to be scrapped.Static wear is balanced to be ground in the region for realizing data with existing
The damage number of degrees are significantly less than that they carry when average abrasion is spent and operate to reach abrasion equilibrium.
The algorithm of each family can be described as similar and have respective advantage and advantage in the controller of current manufacturer, it is similar it
Place is exactly that the data separation during every controller can all will be stored in comes, the data referred to as dsc data for often accessing,
The data for infrequently accessing all are referred to as cold datas.If carrying out fully equalize erasable strategy, then cold data is just
Can be moved, to accommodate dsc data.Extra erasable expense can so be brought（Write amplification）, so as to reduce the overall longevity of SSD
Life.So both can guarantee that abrasion equilibrium using a kind of strategy of optimization, and can reduce and write enlarge-effect, the longevity is used to reach SSD
The maximization of life, as problem demanding prompt solution.
The content of the invention
For above technical problem, it is an object of the invention to provide a kind of solid state hard disc abrasion equilibrium based on grouping mechanism
Method and device, improves the service efficiency of physical block in solid state hard disc, realizes the optimization of abrasion equilibrium performance.
To reach above-mentioned purpose, the present invention is achieved through the following technical solutions：
The present invention provides a kind of solid state hard disc abrasion equilibrium method based on grouping mechanism, comprises the following steps：
S1：Physical block in solid state hard disc is divided into multiple and physics number of blocks identical group；
S2：Record the erasable number of times of each physical block；
S3：After carrying out erasable operation to physical block, will be resequenced according to its erasable number of times with the physical block of group, obtained new
This group of physical block information sequence；
S4：If predetermined condition is reached with the erasable number of times of two physical blocks on the information sequence of a physical block, by above-mentioned two
The data exchange of individual physical block.
Further, before step S1, also include：Set up the information that data structure safeguards each physical block；
Further, step S2 is specifically included：
The erasable number of times of each physical block during record original state；
To be ranked up according to its erasable number of times with the physical block of group, obtain this group of information sequence of physical block during original state；
After carrying out erasable operation to physical block, the erasable number of times of the physical block is added one.
Further, step S4 is specifically included：
Judge whether the erasable number of times maximum of the physical block on the information sequence with a physical block reaches threshold value, if reaching,
Two things of predetermined value will be met with the difference in symmetric position and erasable number of times on the information sequence of a physical block successively
The data for managing block are interchangeable, while add one by the erasable number of times of two physical blocks of interchange of data, then by the two of interchange of data
The mapping table of individual physical block and its counterlogic block updates, and obtains updating the information of the physical block after erasable number of times and mapping relations
Sequence, jumps to step S1 and continues executing with；If not up to, continuing erasable number of times of the step S2 records with the physical block of group.
Further, the sequence is according to ascending or descending carry out.
Further, the data structure is double linked list structure.
Further, one physical address of each physical block correspondence, each physical block one logical block of correspondence, each
Logical block one logical address of correspondence, the physical address and logical address have unique mapping relations.
Further, the threshold value is 50 times of the quantity of physical block in every group.
Present invention also offers based on the above-mentioned solid state hard disc abrasion equilibrium method based on grouping mechanism based on packet
The solid state hard disc abrasion equilibrium device of mechanism, including：
Physical block grouping module, for the physical block in solid state hard disc to be divided into multiple and physics number of blocks identical group；
Logging modle, the erasable number of times for recording each physical block；
Order module, after carrying out erasable operation to physical block, will be carried out again with the physical block of group according to its erasable number of times
Sequence, obtains the information sequence of this group of new physical block；
Data exchange judge module：If for two physical blocks on the information sequence with physical block erasable number of times reach it is pre-
Fixed condition, then by the data exchange of above-mentioned two physical block.
Further, also include：Physical block maintenance of information module, the letter of each physical block is safeguarded for setting up data structure
Breath.
Further, the data exchange judge module is further comprised：Translation module, for by the physics of physical block
Logical address of the address translation into correspondence logical block；Data exchange judge module is further comprised：Mapping table update module, uses
Updated in by the mapping table of two physical blocks of interchange of data and its counterlogic block.
Compared with prior art, a kind of beneficial effect of the solid state hard disc abrasion equilibrium method based on grouping mechanism of the present invention
It is as follows：
1. the present invention is based on grouping mechanism, when the erasable number of times of two physical blocks on the information sequence with physical block reach it is pre-
Fixed condition, then by the data exchange of above-mentioned two physical block, the mapping table of more new physical block and its counterlogic block improves solid
The service efficiency of physical block in state hard disk, it is achieved thereby that the optimization of abrasion equilibrium performance；
2. the packet of physical block of the present invention can dynamically be adjusted according to physical block utilization rate and available memory space,
Can be by the logical address Well-Balanced Mapping of the excessive physical block of local write operation to full amount of physical memory, so as to avoid part
Data are overheated, and realize the optimization of the abrasion equilibrium performance of physical block in global solid state hard disc, and solid-state is extended to greatest extent
The service life of hard disk；
3. the present invention uses double-strand list data structure, is easy to be ranked up it, and double linked list structure can also be comprising pointed chained list
Pointer end to end, such that it is able to the pe_cnt_min and pe_cnt_max of direct access sequence member so that due to being wiped
Write operation and the order of physical block that erasable number of times adds one in the information sequence of physical block is not adjusted temporarily, sequence is also only
Position adjustment is carried out to a small amount of physical block, so as to save unnecessary expense；
4. the present invention can dynamically be adjusted due to the packet of physical block according to physical block utilization rate and available memory space
It is whole, therefore the quantity of physical block also can be adjusted dynamically in every group, and then the threshold value for setting also can be adjusted dynamically, it is achieved thereby that abrasion
The optimization of equalization performance.
A kind of beneficial effect of the solid state hard disc abrasion equilibrium device based on grouping mechanism is with a kind of based on grouping mechanism
The beneficial effect of solid state hard disc abrasion equilibrium method is similar to, and will not be repeated here.
Brief description of the drawings
Fig. 1 is one of the schematic flow sheet of solid state hard disc abrasion equilibrium method of the present invention based on grouping mechanism.
Fig. 2 is schematic diagram of the physical block in original state in embodiment 1 in the present invention.
Fig. 3 is the schematic diagram after physical block is ranked up in embodiment 1 in the present invention.
Fig. 4 is that physical block updates the schematic diagram after erasable number of times is ranked up in embodiment 1 in the present invention.
Fig. 5 is that physical block carries out the schematic diagram after data exchange and more new mappings in embodiment 1 in the present invention.
Fig. 6 is the two of the schematic flow sheet of solid state hard disc abrasion equilibrium method of the present invention based on grouping mechanism.
Fig. 7 is one of the structural representation of solid state hard disc abrasion equilibrium device of the present invention based on grouping mechanism.
Fig. 8 is the two of the structural representation of solid state hard disc abrasion equilibrium device of the present invention based on grouping mechanism.
Specific embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
A part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
The noun and concept that occur in the following example are explained below：
Solid state hard disc：English full name Solid State Drives, abbreviation SSD, are made of solid-state electronic storage chip array
Hard disk, by control unit and memory cell（FLASH chip or dram chip）Composition, control unit mainly includes specific model
The control modules such as the firmware program in solid state hard disc, flash translation layer (FTL) and flash controller, memory cell is mainly by semiconductor
The flash memory storage particle of company's production.
With reference to the accompanying drawings and detailed description to a kind of solid state hard disc abrasion equilibrium based on grouping mechanism of the present invention
Method and device is further described：
Embodiment 1
As shown in figure 1, a kind of solid state hard disc abrasion equilibrium method based on grouping mechanism, comprises the following steps：
Step S101：According to the utilization rate and available memory space of the physical block in solid state hard disc, by the thing in solid state hard disc
Reason block is divided into multiple and physics number of blocks identical group, and the quantity of physical block is N in every group；
Step S102：Record the erasable number of times of each physical block；
Step S103：After carrying out erasable operation to physical block, will be carried out according to its erasable number of times is ascending with the physical block of group
Rearrangement, obtains the information sequence of this group of new physical block；
Step S104：If reaching predetermined condition with the erasable number of times of two physical blocks on the information sequence of a physical block, will
The data exchange of above-mentioned two physical block.
Above-mentioned steps S102 is specifically included：The erasable number of times of each physical block during record original state；By with the physics of group
Root tuber is ranked up according to its erasable number of times, obtains this group of information sequence of physical block during original state；Physical block is carried out erasable
After operation, the erasable number of times of the physical block is added one.
Above-mentioned steps S104 is specifically included：Judge the erasable number of times maximum of the physical block on the information sequence with a physical block
Whether value reaches threshold value, if reaching, successively by the information sequence with physical block in symmetric position and erasable number of times
The data that difference meets two physical blocks of predetermined value are interchangeable, while by erasable time of two physical blocks of interchange of data
Number Jia one, then the mapping table of two physical blocks of interchange of data and its counterlogic block is updated, obtain updating erasable number of times with
The information sequence of the physical block after mapping relations, then branches to step S101 and continues executing with；If not up to, continuing step
The erasable number of times of the physical block of the same group of S102 records.
One physical address of above-mentioned each physical block correspondence, each physical block one logical block of correspondence, each logical block pair
Answering a logical address, the physical address and logical address has unique mapping relations.
As a kind of embodiment, according to the utilization rate and available memory space of the physical block in solid state hard disc, will
Physical block in solid state hard disc is divided into multiple and physics number of blocks identical group, in general selects erasable number of times difference as far as possible
Larger physical block is grouped, and so can preferably be brought the effect of this abrasion equilibration strategy into play, physics in every group
The quantity of block is N, and N is the natural number more than 2, such as N=8；
Refer to Fig. 2, the physical block in the group is designated as A, B, C, D, E, F, G and H respectively, corresponding logical block be respectively a, b,
There is one-to-one mapping in c, d, e, f, g and h, the physical address of above-mentioned each physical block and the logical address of counterlogic block
Relation, the erasable number of times of each physical block during record original state（pe_cnt）, A is that 5, B is that 8, C is that 2, D is that 6, E is that 10, F is
1, G is that 4, H is 7；
Fig. 3 is refer to, by 8 physical blocks according to erasable number of times（pe_cnt）It is ascending to be ranked up, when obtaining original state
This group of information sequence of physical block, pe_cnt_min points to erasable number of times（pe_cnt）Minimum physical block, pe_cnt_max refers to
To erasable number of times（pe_cnt）Maximum physical block；
Fig. 4 is refer to, after carrying out erasable operation to physical block, its erasable number of times is just updated（pe_cnt）.Physical block is carried out many
After secondary erasable operation, A is that 34, B is that 47, C is that 20, D is that 36, E is that 50, F is that 12, G is that 28, H is 41, by with the physics root tuber of group
According to its erasable number of times（pe_cnt）It is ascending to be resequenced, obtain the information sequence of this group of new physical block, pe_cnt_
Min points to erasable number of times（pe_cnt）Minimum physical block, pe_cnt_max points to erasable number of times（pe_cnt）Maximum physics
Block；
Fig. 5 is refer to, the threshold value for setting the erasable number of times maximum of physical block is set to 50*N, and N is the number of physical block in every group
Amount, is set with the predetermined value of the difference of the erasable number of times in two physical blocks of symmetric position on the information sequence of a physical block
It is 10.Now, n=1, threshold value is 50, and the erasable number of times of physical block E has reached 50, and in this sequence with physical block E at
In in symmetric position be physical block F, physical block E and physical block F erasable number of times difference also greater than 10, then by physical block
E is swapped with the data of physical block F, and adds 1 by the erasable number of times of physical block E and physical block F, more new physical block E and physics
The mapping table of block F, similarly, the difference of the erasable number of times of physical block B and physical block C, physical block G and physical block H also greater than 10, in
That also physical block B is swapped with the data of physical block C, the mapping table of more new physical block B and physical block C, by physical block B with
The erasable number of times of physical block C adds 1, and physical block G is swapped with the data of physical block H, and more new physical block G and physical block H
Mapping table, adds 1 by the erasable number of times of physical block G and physical block H；And the difference of the erasable number of times of physical block A and physical block D is less than
10, then data exchange, erasable number of times are not carried out plus 1 and the renewal of mapping table, finally obtain the erasable number of times of renewal and mapping relations
The information sequence of physical block afterwards；It is according to the utilization rate and available memory space of the physical block in solid state hard disc, solid-state is hard
Physical block in disk is reclassified as multiple and physics number of blocks identical group, carries out subsequent cycle, local can be write into behaviour
Make the logical address Well-Balanced Mapping of excessive physical block to full amount of physical memory, so as to avoid local data from overheating, extension is deposited
The service life of storage media.
In above-mentioned implementation method, with the physical block that data exchange is carried out on the information sequence of physical block logarithm less than etc.
In N/2, and data exchange between physical block on the information sequence of multiple physical blocks, erasable number of times add 1 and mapping table
Renewal can be carried out parallel, so that abrasion equilibrium speed is faster.
Embodiment 2
As shown in fig. 6, a kind of solid state hard disc abrasion equilibrium method based on grouping mechanism, comprises the following steps：
Step S201：Set up double linked list（double linked list）Data structure safeguards the information of each physical block；
Step S202：According to the utilization rate and available memory space of the physical block in solid state hard disc, by the thing in solid state hard disc
Reason block is divided into multiple and physics number of blocks identical group, and the quantity of physical block is N in every group；
Step S203：Record the erasable number of times of each physical block；
Step S204：After carrying out erasable operation to physical block, will be carried out according to its erasable number of times is descending with the physical block of group
Rearrangement, obtains the information sequence of this group of new physical block；
Step S205：If reaching predetermined condition with the erasable number of times of two physical blocks on the information sequence of a physical block, will
The data exchange of above-mentioned two physical block.
Above-mentioned steps S203 is specifically included：The erasable number of times of each physical block during record original state；By with the physics of group
Root tuber is ranked up according to its erasable number of times, obtains this group of information sequence of physical block during original state；Physical block is carried out erasable
After operation, the erasable number of times of the physical block is added one.
Above-mentioned steps S205 is specifically included：Judge the erasable number of times maximum of the physical block on the information sequence with a physical block
Whether value reaches threshold value, if reaching, successively by the information sequence with physical block in symmetric position and erasable number of times
The data that difference meets two physical blocks of predetermined value are interchangeable, while by erasable time of two physical blocks of interchange of data
Number Jia one, then the mapping table of two physical blocks of interchange of data and its counterlogic block is updated, obtain updating erasable number of times with
The information sequence of the physical block after mapping relations, jumps to step S202 and continues executing with；If not up to, continuing step S203 notes
The erasable number of times of the physical block of the same group of record.
One physical address of above-mentioned each physical block correspondence, each physical block one logical block of correspondence, each logical block pair
Answering a logical address, the physical address and logical address has unique mapping relations.
As a kind of embodiment, double linked list is set up（double linked list）Data structure safeguards each
The information of physical block, double linked list structure is easy to be ranked up it, and double linked list structure can also include referring to end to end for pointed chained list
Pin, such that it is able to the pe_cnt_min and pe_cnt_max of direct access sequence member.According to the physical block in solid state hard disc
Utilization rate and available memory space, multiple and physics number of blocks identical group, one are divided into by the physical block in solid state hard disc
As for as far as possible select erasable number of times to differ greatly physical block be grouped, so can be by the effect of this abrasion equilibration strategy
Preferably bring into play, the quantity of physical block is N in every group, and N is the natural number more than 2, such as N=10.N is smaller, is needed in sequence
It is compared the number of times moved with data just smaller, but the quantity of optimizable physical block is also reduced by.N is bigger, can optimize
Physical block quantity it is also bigger, but maintenance sequence sequence and data movement expense it is also bigger.
In the present embodiment, the data exchange between physical block, erasable number of times on the information sequence of multiple physical blocks add 1 and
The renewal of mapping table can be carried out parallel, so that abrasion equilibrium speed is faster.
Embodiment 3
As shown in fig. 7, a kind of solid state hard disc abrasion equilibrium device based on grouping mechanism, including with lower module：
Physical block grouping module 301, for utilization rate and available memory space according to the physical block in solid state hard disc, will be solid
Physical block in state hard disk is divided into multiple and physics number of blocks identical group；
Logging modle 302, the erasable number of times for recording each physical block；
Order module 303, after carrying out erasable operation to physical block, will carry out weight with the physical block of group according to its erasable number of times
New sort, obtains the information sequence of this group of new physical block；
Data exchange judge module 304, if being reached for the erasable number of times of two physical blocks on the information sequence with a physical block
To predetermined condition, then by the data exchange of above-mentioned two physical block.
Wherein order judges mould to physical block grouping module 301 with logging modle 302, order module 303, data exchange successively
Block 304 is connected.
Embodiment 4
As shown in figure 8, a kind of solid state hard disc abrasion equilibrium device based on grouping mechanism, including with lower module：
Physical block maintenance of information module 307, the information of each physical block is safeguarded for setting up data structure；
Physical block grouping module 301, for utilization rate and available memory space according to the physical block in solid state hard disc, will be solid
Physical block in state hard disk is divided into multiple and physics number of blocks identical group；
Logging modle 302, the erasable number of times for recording each physical block；
Order module 303, after carrying out erasable operation to physical block, will carry out weight with the physical block of group according to its erasable number of times
New sort, obtains the information sequence of this group of new physical block；
Data exchange judge module 304：If the erasable number of times for two physical blocks on the information sequence with a physical block reaches
To predetermined condition, then by the data exchange of above-mentioned two physical block；
Data exchange judge module 304 is further comprised：Translation module 305, for by the physical address translation of physical block into
The logical address of counterlogic block；
Data exchange judge module 304 is further comprised：Mapping table update module 306, for by two things of interchange of data
The mapping table of reason block and its counterlogic block updates.
Wherein order and physical block grouping module 301, logging modle 302, the sequence successively of physical block maintenance of information module 307
Module 303, data exchange judge module 304 are connected, and translation module 305 and mapping table update module 306 judge with data exchange
Module 304 is connected.
Schematical specific embodiment of the invention is the foregoing is only, the scope of the present invention is not limited to, it is any
The equivalent variations that those skilled in the art is made on the premise of present inventive concept and principle is not departed from and modification, all should belong to
In the scope of protection of the invention.
Claims (10)
1. a kind of solid state hard disc abrasion equilibrium method based on grouping mechanism, it is characterised in that comprise the following steps：
S1：Physical block in solid state hard disc is divided into multiple and physics number of blocks identical group；
S2：Record the erasable number of times of each physical block；
S3：After carrying out erasable operation to physical block, will be resequenced according to its erasable number of times with the physical block of group, obtained new
This group of physical block information sequence；
S4：If predetermined condition is reached with the erasable number of times of two physical blocks on the information sequence of a physical block, by above-mentioned two
The data exchange of individual physical block.
2. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 1, it is characterised in that in step
Before S1, also include：Set up the information that data structure safeguards each physical block.
3. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 1, it is characterised in that step S2
Specifically include：
The erasable number of times of each physical block during record original state；
To be ranked up according to its erasable number of times with the physical block of group, obtain this group of information sequence of physical block during original state；
After carrying out erasable operation to physical block, the erasable number of times of the physical block is added one.
4. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 1, it is characterised in that step S4
Specifically include：
Judge whether the erasable number of times maximum of the physical block on the information sequence with a physical block reaches threshold value, if reaching,
Two things of predetermined value will be met with the difference in symmetric position and erasable number of times on the information sequence of a physical block successively
The data for managing block are interchangeable, while add one by the erasable number of times of two physical blocks of interchange of data, then by the two of interchange of data
The mapping table of individual physical block and its counterlogic block updates, and obtains updating the information of the physical block after erasable number of times and mapping relations
Sequence, jumps to step S1 and continues executing with；If not up to, continuing erasable number of times of the step S2 records with the physical block of group.
5. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 1 or 3, it is characterised in that institute
It is according to ascending or descending carry out to state sequence.
6. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 2, it is characterised in that the number
It is double linked list structure according to structure.
7. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 1, it is characterised in that described every
One physical address of individual physical block correspondence, each physical block one logical block of correspondence, each logical block one logical address of correspondence,
The physical address and logical address have unique mapping relations.
8. the solid state hard disc abrasion equilibrium method based on grouping mechanism according to claim 4, it is characterised in that the threshold
Value is 50 times of the quantity of physical block in every group.
9. based on any one of claim 1 ~ 8 the solid state hard disc abrasion equilibrium method based on grouping mechanism based on grouping mechanism
Solid state hard disc abrasion equilibrium device, it is characterised in that including：
Physical block grouping module, for the physical block in solid state hard disc to be divided into multiple and physics number of blocks identical group；
Logging modle, the erasable number of times for recording each physical block；
Order module, after carrying out erasable operation to physical block, will be carried out again with the physical block of group according to its erasable number of times
Sequence, obtains the information sequence of this group of new physical block；
Data exchange judge module：If for two physical blocks on the information sequence with physical block erasable number of times reach it is pre-
Fixed condition, then by the data exchange of above-mentioned two physical block.
10. the solid state hard disc abrasion equilibrium device based on grouping mechanism according to claim 9, it is characterised in that also wrap
Include：Physical block maintenance of information module, the information of each physical block is safeguarded for setting up data structure；
Preferably, the data exchange judge module is further comprised：Translation module, for the physical address of physical block to be turned over
It is translated into the logical address of counterlogic block；Data exchange judge module is further comprised：Mapping table update module, for by mutually
The mapping table of two physical blocks and its counterlogic block that change data updates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710026799.5A CN106844227A (en) | 2017-01-14 | 2017-01-14 | Solid state hard disc abrasion equilibrium method and device based on grouping mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710026799.5A CN106844227A (en) | 2017-01-14 | 2017-01-14 | Solid state hard disc abrasion equilibrium method and device based on grouping mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106844227A true CN106844227A (en) | 2017-06-13 |
Family
ID=59123656
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710026799.5A Pending CN106844227A (en) | 2017-01-14 | 2017-01-14 | Solid state hard disc abrasion equilibrium method and device based on grouping mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106844227A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108319433A (en) * | 2018-03-19 | 2018-07-24 | 艾体威尔电子技术(北京)有限公司 | The memory management method of the NOR Flash of small memory microcontroller |
| CN109669641A (en) * | 2018-12-24 | 2019-04-23 | 深圳忆联信息系统有限公司 | Reduce the data deposit method and device of the SSD bit error rate |
| CN110750466A (en) * | 2019-10-18 | 2020-02-04 | 深圳豪杰创新电子有限公司 | Method and device for prolonging erasing and writing life of flash memory |
| CN111124305A (en) * | 2019-12-20 | 2020-05-08 | 浪潮电子信息产业股份有限公司 | Solid state disk wear leveling method and device and computer readable storage medium |
| CN111143238A (en) * | 2019-12-27 | 2020-05-12 | 深圳融卡智能科技有限公司 | Data erasing method and system based on eFlash memory chip |
| WO2020113440A1 (en) * | 2018-12-04 | 2020-06-11 | 深圳市大疆创新科技有限公司 | Data storage method, flash device, intelligent battery, and movable platform |
| CN112068769A (en) * | 2020-07-28 | 2020-12-11 | 深圳市宏旺微电子有限公司 | Bidirectional linked list management method of flash memory device and flash memory device |
| CN112162934A (en) * | 2020-09-29 | 2021-01-01 | 深圳市时创意电子有限公司 | Storage block abnormal wear processing method and device, electronic equipment and storage medium |
| CN114442946A (en) * | 2022-01-06 | 2022-05-06 | 联芸科技（杭州）有限公司 | Physical block management method and solid state disk |
| CN117873406A (en) * | 2024-03-11 | 2024-04-12 | 武汉麓谷科技有限公司 | Method for controlling wear balance of ZNS solid state disk |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7353325B2 (en) * | 1991-09-13 | 2008-04-01 | Sandisk Corporation | Wear leveling techniques for flash EEPROM systems |
| CN101441599A (en) * | 2008-11-28 | 2009-05-27 | 成都市华为赛门铁克科技有限公司 | Solid hard disk and equilibrium method of the same |
| CN101777026A (en) * | 2009-01-09 | 2010-07-14 | 成都市华为赛门铁克科技有限公司 | Memory management method, hard disk and memory system |
| CN102222046A (en) * | 2011-06-09 | 2011-10-19 | 清华大学 | Abrasion equilibrium method and device |
-
2017
- 2017-01-14 CN CN201710026799.5A patent/CN106844227A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7353325B2 (en) * | 1991-09-13 | 2008-04-01 | Sandisk Corporation | Wear leveling techniques for flash EEPROM systems |
| CN101441599A (en) * | 2008-11-28 | 2009-05-27 | 成都市华为赛门铁克科技有限公司 | Solid hard disk and equilibrium method of the same |
| CN101777026A (en) * | 2009-01-09 | 2010-07-14 | 成都市华为赛门铁克科技有限公司 | Memory management method, hard disk and memory system |
| CN102222046A (en) * | 2011-06-09 | 2011-10-19 | 清华大学 | Abrasion equilibrium method and device |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108319433B (en) * | 2018-03-19 | 2021-02-02 | 艾体威尔电子技术(北京)有限公司 | Storage management method for NOR Flash of small-memory single chip microcomputer |
| CN108319433A (en) * | 2018-03-19 | 2018-07-24 | 艾体威尔电子技术(北京)有限公司 | The memory management method of the NOR Flash of small memory microcontroller |
| WO2020113440A1 (en) * | 2018-12-04 | 2020-06-11 | 深圳市大疆创新科技有限公司 | Data storage method, flash device, intelligent battery, and movable platform |
| CN109669641A (en) * | 2018-12-24 | 2019-04-23 | 深圳忆联信息系统有限公司 | Reduce the data deposit method and device of the SSD bit error rate |
| CN109669641B (en) * | 2018-12-24 | 2022-03-29 | 深圳忆联信息系统有限公司 | Data storage method and device for reducing SSD bit error rate |
| CN110750466A (en) * | 2019-10-18 | 2020-02-04 | 深圳豪杰创新电子有限公司 | Method and device for prolonging erasing and writing life of flash memory |
| CN111124305A (en) * | 2019-12-20 | 2020-05-08 | 浪潮电子信息产业股份有限公司 | Solid state disk wear leveling method and device and computer readable storage medium |
| CN111143238A (en) * | 2019-12-27 | 2020-05-12 | 深圳融卡智能科技有限公司 | Data erasing method and system based on eFlash memory chip |
| CN112068769A (en) * | 2020-07-28 | 2020-12-11 | 深圳市宏旺微电子有限公司 | Bidirectional linked list management method of flash memory device and flash memory device |
| CN112068769B (en) * | 2020-07-28 | 2023-11-14 | 深圳市宏旺微电子有限公司 | Flash memory device bidirectional linked list management method and flash memory storage device |
| CN112162934A (en) * | 2020-09-29 | 2021-01-01 | 深圳市时创意电子有限公司 | Storage block abnormal wear processing method and device, electronic equipment and storage medium |
| CN114442946A (en) * | 2022-01-06 | 2022-05-06 | 联芸科技（杭州）有限公司 | Physical block management method and solid state disk |
| CN117873406A (en) * | 2024-03-11 | 2024-04-12 | 武汉麓谷科技有限公司 | Method for controlling wear balance of ZNS solid state disk |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106844227A (en) | Solid state hard disc abrasion equilibrium method and device based on grouping mechanism | |
| CN105468534B (en) | The method and system of flash memory utilization rate is improved using read threshold table | |
| CN102012791B (en) | Flash based PCIE (peripheral component interface express) board for data storage | |
| CN102880556B (en) | Wear leveling method and system of Nand Flash | |
| CN102981963B (en) | A kind of implementation method of flash translation layer (FTL) of solid-state disk | |
| CN105095116A (en) | Cache replacing method, cache controller and processor | |
| Jia et al. | Hybrid-LRU caching for optimizing data storage and retrieval in edge computing-based wearable sensors | |
| TW201717040A (en) | System and method for a shared cache with adaptive partitioning | |
| CN103049216B (en) | Solid state hard disc and data processing method, system | |
| CN108108128A (en) | A kind of abrasion equilibrium method and SSD for mixing SSD | |
| CN106354658B (en) | A method of it reducing mapping table memory source in mixed-use developments algorithm and occupies | |
| US10997080B1 (en) | Method and system for address table cache management based on correlation metric of first logical address and second logical address, wherein the correlation metric is incremented and decremented based on receive order of the first logical address and the second logical address | |
| CN104731515B (en) | Control the method and apparatus of storage device group of planes abrasion equilibrium | |
| CN102999441B (en) | Fine granularity memory access method | |
| CN108762671A (en) | Mixing memory system and its management method based on PCM and DRAM | |
| CN103942161B (en) | Redundancy elimination system and method for read-only cache and redundancy elimination method for cache | |
| KR20120078096A (en) | System including volatile memory and non-volatile memory and processing mehthod thereof | |
| CN107729268A (en) | A kind of memory expansion apparatus and method based on CAPI interfaces | |
| CN101833510A (en) | Address translation method for flash storage FTL | |
| CN107422989A (en) | A kind of more copy read methods of Server SAN systems and storage architecture | |
| CN105278875A (en) | Hybrid heterogeneous NAND solid state device | |
| CN105205008B (en) | Reduce the method that log blocks mapping table memory source occupies in mixed-use developments algorithm | |
| CN105005510A (en) | Error correction protection architecture and method applied to resistive random access memory cache of solid state disk | |
| CN103548005A (en) | Method and device for replacing cache objects | |
| CN108710581A (en) | PCM storage medium abrasion equilibrium methods based on Bloom filter |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170613 |