CN110287129A - L2P table based on solid state hard disk updates and is written management method and device - Google Patents
L2P table based on solid state hard disk updates and is written management method and device Download PDFInfo
- Publication number
- CN110287129A CN110287129A CN201910568298.9A CN201910568298A CN110287129A CN 110287129 A CN110287129 A CN 110287129A CN 201910568298 A CN201910568298 A CN 201910568298A CN 110287129 A CN110287129 A CN 110287129A
- Authority
- CN
- China
- Prior art keywords
- management
- write
- hard disk
- solid state
- 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.)
- 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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/72—Details relating to flash memory management
- G06F2212/7201—Logical to physical mapping or translation of blocks or pages
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 involves a kind of, and the L2P table based on solid state hard disk updates and is written management method, device, computer equipment and storage medium, wherein requesting this method comprises: obtaining the L2P table based on solid state hard disk and updating and be written management；It is that corresponding L2P table two management structural bodies of distribution are managed according to management request；The first management of locking structural body, opens the process of write-in NAND during write-in；L2P table labeled by the second management structural body management simultaneously, so that need not block FTL in the time of L2P table write-in NAND handles other control nodes to realize the efficiency for promoting SSD.The present invention proposes a kind of management method that solid storage device l2p table is updated and is written, and need not block FTL in the time of L2P table write-in and handle other control nodes, promote the efficiency of SSD.
Description
Technical field
The present invention relates to solid state hard disk technical fields, update and write more particularly to a kind of L2P table based on solid state hard disk
Enter management method, device, computer equipment and storage medium.
Background technique
Currently, SSD (Solid State Disk solid state hard disk) has been widely used in various occasions, since it is in property
The outstanding index of energy, power consumption, environmental suitability etc., just gradually replaces traditional hard disk.FTL(Flash Translation
Layer) algorithm is the core of SSD (Solid State Disk) firmware, since NAND does not allow to be repeatedly written on page,
FTL needs service logic to the address of cache of physics.
In the conventional technology, SSD firmware is mostly by the way of page mapping at present, and address mapping table, that is, l2p table is in DDR
Load or modification, then the FTL l2p table good at managing that these are modified, the task of l2p table write-in is triggered at some
NAND is written into the table of these " dirty ".Usually such treatment mechanism, in the time of mapping table write-in NAND, FTL needs
Stopping handles the running node that may change address mapping table, and will affect the efficiency of SSD in this way.
Summary of the invention
Based on this, it is necessary in view of the above technical problems, provide it is a kind of can be promoted SSD efficiency based on solid state hard disk
L2P table updates and write-in management method, device, computer equipment and storage medium.
A kind of update of L2P table and write-in management method based on solid state hard disk, which comprises
It obtains the L2P table based on solid state hard disk and updates and be written management request；
It is that corresponding L2P table two management structural bodies of distribution are managed according to management request；
The first management of locking structural body, opens the process of write-in NAND during write-in；
L2P table labeled by the second management structural body management simultaneously, so that the time in L2P table write-in NAND need not
Obstruction FTL handles other control nodes to realize the efficiency for promoting SSD.
In one of the embodiments, the method also includes:
It obtains the L2P table based on solid state hard disk and updates request；
Corresponding L2P table is modified in DDR according to update request, wherein the L2P table is according to certain granularity
It is cut into multiple mp, the corresponding mapping table of the mp can save in NAND；
Mp where calculating location revision according to the granularity of mp, and whether to check the position in the corresponding bmp of the mp
It is supreme；
If the position in the corresponding bmp of the mp do not have it is supreme, it is corresponding position is supreme and update dirty_cnt；
When the size of the dirty_cnt is greater than preset flushes threshold value, task is written in triggering L2P.
In one of the embodiments, the position checked in the corresponding bmp of the mp whether supreme step
Later further include:
If the position in the corresponding bmp of the mp is supreme, directly jump out.
In one of the embodiments, the method also includes:
Obtain the L2P table write request based on solid state hard disk；
Flush_mng is directed toward to the object of active_mng, pair that active_mng is directed toward according to said write request
As being exchanged into another mng；
NAND is written into the L2P table being labeled in task, and updates M2P table.
A kind of L2P table based on solid state hard disk updates and write-in managing device, described device include:
Module is obtained, the module that obtains is used to obtain the update of L2P table and write-in management request based on solid state hard disk；
Allocation managing module, the allocation managing module are used to according to management request be corresponding L2P table distribution two
A management structural body is managed；
First management module, first management module are used for the first management of locking structural body during write-in, open
Open the process of write-in NAND；
Second management module, second management module are used for while managing what structural body management was labeled by second
L2P table, so that need not block FTL in the time of L2P table write-in NAND handles other control nodes to realize the effect for promoting SSD
Rate.
Described device further includes L2P table update module in one of the embodiments, and the L2P table update module is used for:
It obtains the L2P table based on solid state hard disk and updates request；
Corresponding L2P table is modified in DDR according to update request, wherein the L2P table is according to certain granularity
It is cut into multiple mp, the corresponding mapping table of the mp can save in NAND；
Mp where calculating location revision according to the granularity of mp, and whether to check the position in the corresponding bmp of the mp
It is supreme；
If the position in the corresponding bmp of the mp do not have it is supreme, it is corresponding position is supreme and update dirty_cnt；
When the size of the dirty_cnt is greater than preset flushes threshold value, task is written in triggering L2P.
The L2P table update module is also used in one of the embodiments:
If the position in the corresponding bmp of the mp is supreme, directly jump out.
Described device further includes L2P table writing module in one of the embodiments, and the L2P table writing module is used for:
Obtain the L2P table write request based on solid state hard disk；
Flush_mng is directed toward to the object of active_mng, pair that active_mng is directed toward according to said write request
As being exchanged into another mng；
NAND is written into the L2P table being labeled in task, and updates M2P table.
A kind of computer equipment can be run on a memory and on a processor including memory, processor and storage
The step of computer program, the processor realizes above-mentioned any one method when executing the computer program.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
The step of above-mentioned any one method is realized when row.
The above-mentioned L2P table based on solid state hard disk updates and write-in management method, device, computer equipment and storage medium,
Management request is updated and is written by obtaining the L2P table based on solid state hard disk；It is that the distribution of corresponding L2P table is double according to management request
Cache is managed.By the management method of double Cache, a Cache is locked during write-in, opens write-in NAND
Process, while with another Cache manage new label be it is dirty " mapping table, thus address mapping table write-in time
FTL need not be blocked and handle other control nodes, promote the efficiency of SSD.
Detailed description of the invention
Fig. 1 is the schematic diagram of logical page (LPAGE) physical mappings table in traditional technology；
Fig. 2 is the schematic diagram of the management structural body in traditional technology in mapping table writing process；
Fig. 3 is that the L2P table in one embodiment based on solid state hard disk updates and be written the flow diagram of management method；
Fig. 4 is that the L2P table in another embodiment based on solid state hard disk updates and be written the flow diagram of management method；
Fig. 5 is that the L2P table in further embodiment based on solid state hard disk updates and be written the flow diagram of management method；
Fig. 6 is the schematic diagram of the double-pipe type structural body in one embodiment in mapping table writing process；
Fig. 7 is the flow diagram that L2P table step is updated in one embodiment；
Fig. 8 is the flow diagram of L2P table write step in one embodiment；
Fig. 9 is that the L2P table in one embodiment based on solid state hard disk updates and be written the structural block diagram of managing device；
Figure 10 is that the L2P table in another embodiment based on solid state hard disk updates and be written the structural block diagram of managing device；
Figure 11 is that the L2P table in further embodiment based on solid state hard disk updates and be written the structural block diagram of managing device；
Figure 12 is the internal structure chart of computer equipment in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, and
It is not used in restriction the application.
L2p table would generally be updated in existing SSD system in DDR and then triggers write-in task backstage write-in NAND；It can
Energy can be by the way of being described below.
As shown in Figure 1, the L2P table on the left side is logical page (LPAGE) physical address mapping table, table is indexed with logical page address,
It is the corresponding physical address of logical page (LPAGE) in table, this part of table saves in DDR, this part of table is cut according to certain granularity
Point, this in this example is cut into every 64 list items and forms a mp, and the corresponding mapping table of mp can save in NAND, the right side Fig. 1
M2P table records the address that the corresponding mapping table of mp saves in NAND with mp numeral index.
As shown in Fig. 2, dirty_bmp [] is array, each bit by extremely for the management structural body of mapping table write-in
On represent the content of corresponding mp and be modified and (labeled as " dirty ", be not written into NAND), dirty_cnt records the mp's of " dirty "
Number, when be greater than some threshold value, then trigger write-once task, by DDR " dirty " mapping table write-in NAND in, then by this
Structural body is reset；The L2P table that certain section of mp is written needs to distribute a new page, and by this segment data copy to one section of buffer area with
The L2P table of other " dirty " gathers into a page, if this segment table lattice has been copied, other tasks pair in writing process
This section of modification, then data will be old data in write-in NAND, and the mp for being somebody's turn to do " dirty " will be corresponded to after the completion of write-in
The position bit removed, it is newest data that such consequence, which is exactly that table specifically updated not by modification,；And if in write-in task
Constantly having new " dirty " mp to be labeled then presently written task status chance can not jump out；So usually way is to enter mapping
Table locks L2P table when task is written, and forbids the modifying the table of the task；It can influence the efficiency of SSD to a certain extent in this way.
The present invention is based on above-mentioned technical problems to propose a kind of SSD bad block management method of optimization, proposes that a kind of solid-state is deposited
The management method that equipment L2P table is updated and is written is stored up, FTL need not be blocked in the time of L2P table write-in and handle other control nodes,
Promote the efficiency of SSD.
In one embodiment, as shown in figure 3, providing a kind of update of L2P table and write-in management based on solid state hard disk
Method, this method comprises:
Step 302, it obtains the L2P table based on solid state hard disk and updates and be written management request；
It step 304, is that corresponding L2P table two management structural bodies of distribution are managed according to management request；
Step 306, the first management of locking structural body during write-in, opens the process of write-in NAND；
Step 308, the L2P table while by the second management structural body management being labeled, thus L2P table write-in NAND's
Time need not block FTL and handle other control nodes to realize the efficiency for promoting SSD.
Specifically, refering to what is shown in Fig. 6, there are two the management structural body mng [0] and mng that are responsible for the update of L2P table and write-in
[1] and two pointers active_mng and flush_mng are directed toward one of above-mentioned two management structural body.Active_mng refers to
To structural body be responsible for managed firmware operation in l2p table modify label, when dirty_cnt therein be greater than some threshold value, then
It triggers L2P table and task is written.In the beginning of L2P table write-in task, flush_mng is directed toward to the object of active_mng, it will
The object exchange of active_mng is at another mng.The l2p table of flush_mng management will be handled in this L2P write-in task
Write-in, the management structural body is reset after the completion of write-in, will be in active_ to the modification of L2P table while in writing process
It is labeled in mng.Other control nodes are handled in this way, realizing and need not block FTL in the time of l2p table write-in, promote SSD's
Efficiency.
In the present embodiment, management request is updated and is written by obtaining the L2P table based on solid state hard disk；Management is requested
Corresponding L2P table distributes double Cache and is managed.By the management method of double Cache, one is locked during write-in
Cache, open write-in NAND process, while with another Cache manage new label be it is dirty " mapping table, thus on ground
The time of location mapping table write-in need not block FTL and handle other control nodes, realize the efficiency for promoting SSD.
In one embodiment, as shown in figure 4, providing a kind of update of L2P table and write-in management based on solid state hard disk
Method, this method further include:
Step 402, it obtains the L2P table based on solid state hard disk and updates request；
Step 404, corresponding L2P table is modified in DDR according to update request, wherein L2P table is according to certain granularity
Multiple mp are cut into, the corresponding mapping table of mp can save in NAND；
Step 406, mp where calculating location revision according to the granularity of mp, and whether check the position in the corresponding bmp of mp
It is supreme；
Step 408, if the position in the corresponding bmp of mp do not have it is supreme, it is corresponding position is supreme and update dirty_cnt；
Step 410, when the size of dirty_cnt is greater than preset flushes threshold value, task is written in triggering L2P.
In one embodiment, checking the position in the corresponding bmp of mp whether after supreme step further include:
If the position in the corresponding bmp of mp is supreme, directly jump out.
Specifically, refering to what is shown in Fig. 7, the process for updating L2P table in the present embodiment includes:
It updates L2P heading first to modify in DDR, mp where the position of modification is then calculated according to the granularity of mp, check
Whether the position bit in active_mng structural body in the corresponding bmp of mp is supreme (represent and be labeled as " dirty "), if extremely
On then jump out, otherwise supreme corresponding position updates dirty_cnt, then triggers this if it is greater than the threshold value of L2P table write-in task
Business, is otherwise jumped out.
In the present embodiment, FTL need not be blocked in the time of L2P table write-in and handles other control nodes, improve SSD's
Efficiency.
In one embodiment, as shown in figure 5, providing a kind of update of L2P table and write-in management based on solid state hard disk
Method, this method further include:
Step 502, the L2P table write request based on solid state hard disk is obtained；
Step 504, flush_mng is directed toward to the object of active_mng according to write request, active_mng is directed toward
Object exchange at another mng；
Step 506, NAND is written into the L2P table being labeled in task, and updates M2P table.
Specifically, refering to what is shown in Fig. 8, the process of the task of L2P table write-in in the present embodiment includes:
In the beginning of L2P write-in task, flush_mng is directed toward to the object of active_mng first, by active_mng
Object exchange at another mng, by the label of flush_mng management be dirty in task " L2P table NAND is written, update
M2P table.
It should be understood that although each step in the flow chart of Fig. 3-8 is successively shown according to the instruction of arrow,
These steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly stating otherwise herein, these steps
Execution there is no stringent sequences to limit, these steps can execute in other order.Moreover, at least one in Fig. 3-8
Part steps may include that perhaps these sub-steps of multiple stages or stage are not necessarily in synchronization to multiple sub-steps
Completion is executed, but can be executed at different times, the execution sequence in these sub-steps or stage is also not necessarily successively
It carries out, but can be at least part of the sub-step or stage of other steps or other steps in turn or alternately
It executes.
In one embodiment, as shown in figure 9, providing a kind of update of L2P table and write-in management based on solid state hard disk
Device 900, the device include:
Module 901 is obtained, the L2P table based on solid state hard disk updates and write-in management is requested for obtaining；
Allocation managing module 902, for according to the management request be corresponding L2P table distribution two management structural bodies into
Row management；
First management module 903 opens the stream of write-in NAND for the first management of locking structural body during write-in
Journey；
Second management module 904, for L2P table labeled by the second management structural body management simultaneously, thus in L2P
The time of table write-in NAND need not block FTL and handle other control nodes to realize the efficiency for promoting SSD.
In one embodiment, as shown in Figure 10, a kind of update of L2P table and write-in management based on solid state hard disk is provided
Device 900, the device further include L2P table update module 905, are used for:
It obtains the L2P table based on solid state hard disk and updates request；
Corresponding L2P table is modified in DDR according to request is updated, wherein L2P table is cut into more according to certain granularity
The corresponding mapping table of a mp, mp can save in NAND；
Mp where calculating location revision according to the granularity of mp, and check whether the position in the corresponding bmp of mp is supreme；
If the position in the corresponding bmp of mp do not have it is supreme, it is corresponding position is supreme and update dirty_cnt；
When the size of dirty_cnt is greater than preset flushes threshold value, task is written in triggering L2P.
In one embodiment, L2P table update module 905 is also used to:
If the position in the corresponding bmp of mp is supreme, directly jump out.
In one embodiment, as shown in figure 11, a kind of update of L2P table and write-in management based on solid state hard disk is provided
Device 900, the device further include L2P table writing module 906, are used for:
Obtain the L2P table write request based on solid state hard disk；
Flush_mng is directed toward to the object of active_mng according to write request, the object that active_mng is directed toward is handed over
Change another mng into；
NAND is written into the L2P table being labeled in task, and updates M2P table.
About based on solid state hard disk L2P table update and write-in managing device it is specific limit may refer to above for
L2P table based on solid state hard disk updates and the restriction of write-in management method, and details are not described herein.
In one embodiment, a kind of computer equipment is provided, internal structure chart is shown in Fig.12.The calculating
Machine equipment includes processor, memory and the network interface connected by device bus.Wherein, the processing of the computer equipment
Device is for providing calculating and control ability.The memory of the computer equipment includes non-volatile memory medium, built-in storage.It should
Non-volatile memory medium is stored with operating device, computer program and database.The built-in storage is non-volatile memories Jie
The operation of operating device and computer program in matter provides environment.The network interface of the computer equipment is used for and external end
End passes through network connection communication.To realize a kind of L2P table based on solid state hard disk more when the computer program is executed by processor
New and write-in management method.
It will be understood by those skilled in the art that structure shown in Figure 12, only part relevant to application scheme
The block diagram of structure, does not constitute the restriction for the computer equipment being applied thereon to application scheme, and specific computer is set
Standby may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
In one embodiment, a kind of computer equipment is provided, including memory, processor and storage are on a memory
And the computer program that can be run on a processor, processor are realized when executing computer program in above each embodiment of the method
The step of.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
The step in above each embodiment of the method is realized when machine program is executed by processor.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the concept of this application, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of L2P table based on solid state hard disk updates and write-in management method, which comprises
It obtains the L2P table based on solid state hard disk and updates and be written management request；
It is that corresponding L2P table two management structural bodies of distribution are managed according to management request；
The first management of locking structural body, opens the process of write-in NAND during write-in；
L2P table labeled by the second management structural body management simultaneously, to need not block in the time of L2P table write-in NAND
FTL handles other control nodes to realize the efficiency for promoting SSD.
2. the L2P table according to claim 1 based on solid state hard disk updates and write-in management method, which is characterized in that institute
State method further include:
It obtains the L2P table based on solid state hard disk and updates request；
Corresponding L2P table is modified in DDR according to update request, wherein the L2P table is according to certain granularity cutting
At multiple mp, the corresponding mapping table of the mp can save in NAND；
Mp where calculating location revision according to the granularity of mp, and check whether the position in the corresponding bmp of the mp is supreme；
If the position in the corresponding bmp of the mp do not have it is supreme, it is corresponding position is supreme and update dirty_cnt；
When the size of the dirty_cnt is greater than preset flushes threshold value, task is written in triggering L2P.
3. the L2P table according to claim 2 based on solid state hard disk updates and write-in management method, which is characterized in that
Whether the position checked in the corresponding bmp of the mp is after supreme step further include:
If the position in the corresponding bmp of the mp is supreme, directly jump out.
4. the L2P table according to claim 1-3 based on solid state hard disk updates and write-in management method, feature
It is, the method also includes:
Obtain the L2P table write request based on solid state hard disk；
Flush_mng is directed toward to the object of active_mng according to said write request, the object that active_mng is directed toward is handed over
Change another mng into；
NAND is written into the L2P table being labeled in task, and updates M2P table.
5. a kind of L2P table based on solid state hard disk updates and write-in managing device, which is characterized in that described device includes:
Module is obtained, the module that obtains is used to obtain the update of L2P table and write-in management request based on solid state hard disk；
Allocation managing module, the allocation managing module are used to be that corresponding L2P table distributes two pipes according to management request
Reason structural body is managed；
First management module, first management module are used for the first management of locking structural body, unlatching during write-in and write
Enter the process of NAND；
Second management module, second management module is used for while the L2P table labeled by the second management structural body management,
Other control nodes are handled to which FTL need not be blocked in the time of L2P table write-in NAND to realize the efficiency for promoting SSD.
6. the L2P table according to claim 5 based on solid state hard disk updates and write-in managing device, which is characterized in that institute
Stating device further includes L2P table update module, and the L2P table update module is used for:
It obtains the L2P table based on solid state hard disk and updates request；
Corresponding L2P table is modified in DDR according to update request, wherein the L2P table is according to certain granularity cutting
At multiple mp, the corresponding mapping table of the mp can save in NAND；
Mp where calculating location revision according to the granularity of mp, and check whether the position in the corresponding bmp of the mp is supreme；
If the position in the corresponding bmp of the mp do not have it is supreme, it is corresponding position is supreme and update dirty_cnt；
When the size of the dirty_cnt is greater than preset flushes threshold value, task is written in triggering L2P.
7. the L2P table according to claim 6 based on solid state hard disk updates and write-in managing device, which is characterized in that institute
L2P table update module is stated to be also used to:
If the position in the corresponding bmp of the mp is supreme, directly jump out.
8. updating and being written managing device, feature according to the described in any item L2P tables based on solid state hard disk of claim 5-7
It is, described device further includes L2P table writing module, and the L2P table writing module is used for:
Obtain the L2P table write request based on solid state hard disk；
Flush_mng is directed toward to the object of active_mng according to said write request, the object that active_mng is directed toward is handed over
Change another mng into；
NAND is written into the L2P table being labeled in task, and updates M2P table.
9. a kind of computer equipment including memory, processor and stores the meter that can be run on a memory and on a processor
Calculation machine program, which is characterized in that the processor realizes any one of claims 1 to 4 institute when executing the computer program
The step of stating method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of Claims 1-4 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910568298.9A CN110287129B (en) | 2019-06-27 | 2019-06-27 | L2P table updating and writing management method and device based on solid state disk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910568298.9A CN110287129B (en) | 2019-06-27 | 2019-06-27 | L2P table updating and writing management method and device based on solid state disk |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110287129A true CN110287129A (en) | 2019-09-27 |
| CN110287129B CN110287129B (en) | 2021-07-13 |
Family
ID=68019252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910568298.9A Active CN110287129B (en) | 2019-06-27 | 2019-06-27 | L2P table updating and writing management method and device based on solid state disk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110287129B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111045956A (en) * | 2019-12-22 | 2020-04-21 | 北京浪潮数据技术有限公司 | Solid state disk garbage recycling method and device based on multi-core CPU |
| CN114201331A (en) * | 2022-02-17 | 2022-03-18 | 深圳佰维存储科技股份有限公司 | Method, device, equipment and storage medium for detecting instruction conflict of solid state disk |
| CN117149091A (en) * | 2023-10-23 | 2023-12-01 | 四川云海芯科微电子科技有限公司 | Solid state disk data storage method and related device |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080189499A1 (en) * | 2007-02-02 | 2008-08-07 | Ran Ogata | Storage system |
| CN101382918A (en) * | 2008-07-26 | 2009-03-11 | 深圳市硅格半导体有限公司 | NAND flash memory optimizing and managing method based on data interchange zone |
| US20110022805A1 (en) * | 2007-04-09 | 2011-01-27 | Ivan Schreter | Wait-Free Parallel Data Cache |
| CN102043727A (en) * | 2009-10-10 | 2011-05-04 | 成都市华为赛门铁克科技有限公司 | Method and device for recovering solid-state hard disc mapping table |
| CN102662849A (en) * | 2012-03-07 | 2012-09-12 | 忆正科技（武汉）有限公司 | Method for managing blocks of multichannel flash memory |
| CN103425600A (en) * | 2013-08-23 | 2013-12-04 | 中国人民解放军国防科学技术大学 | Address mapping method for flash translation layer of solid state drive |
| US8645664B1 (en) * | 2011-08-11 | 2014-02-04 | Pure Storage, Inc. | Logical sector mapping in a flash storage array |
| CN103999038A (en) * | 2011-12-28 | 2014-08-20 | 英特尔公司 | A method and device to distribute code and data stores between volatile memory and non-volatile memory |
| US20150378884A1 (en) * | 2013-04-08 | 2015-12-31 | Avalanche Technology, Inc. | Storage system controlling addressing of solid storage disks (ssd) |
| CN107943719A (en) * | 2017-11-28 | 2018-04-20 | 杭州电子科技大学 | A kind of flash translation layer (FTL) control method based on requests classification |
| CN109783411A (en) * | 2018-12-20 | 2019-05-21 | 成都旋极历通信息技术有限公司 | A kind of FLASH antenna array control method and controller based on FPGA |
| CN109918316A (en) * | 2019-02-26 | 2019-06-21 | 深圳忆联信息系统有限公司 | A kind of method and its system reducing FTL address of cache space |
-
2019
- 2019-06-27 CN CN201910568298.9A patent/CN110287129B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080189499A1 (en) * | 2007-02-02 | 2008-08-07 | Ran Ogata | Storage system |
| US20110022805A1 (en) * | 2007-04-09 | 2011-01-27 | Ivan Schreter | Wait-Free Parallel Data Cache |
| CN101382918A (en) * | 2008-07-26 | 2009-03-11 | 深圳市硅格半导体有限公司 | NAND flash memory optimizing and managing method based on data interchange zone |
| CN102043727A (en) * | 2009-10-10 | 2011-05-04 | 成都市华为赛门铁克科技有限公司 | Method and device for recovering solid-state hard disc mapping table |
| US8645664B1 (en) * | 2011-08-11 | 2014-02-04 | Pure Storage, Inc. | Logical sector mapping in a flash storage array |
| CN103999038A (en) * | 2011-12-28 | 2014-08-20 | 英特尔公司 | A method and device to distribute code and data stores between volatile memory and non-volatile memory |
| CN102662849A (en) * | 2012-03-07 | 2012-09-12 | 忆正科技（武汉）有限公司 | Method for managing blocks of multichannel flash memory |
| US20150378884A1 (en) * | 2013-04-08 | 2015-12-31 | Avalanche Technology, Inc. | Storage system controlling addressing of solid storage disks (ssd) |
| CN103425600A (en) * | 2013-08-23 | 2013-12-04 | 中国人民解放军国防科学技术大学 | Address mapping method for flash translation layer of solid state drive |
| CN107943719A (en) * | 2017-11-28 | 2018-04-20 | 杭州电子科技大学 | A kind of flash translation layer (FTL) control method based on requests classification |
| CN109783411A (en) * | 2018-12-20 | 2019-05-21 | 成都旋极历通信息技术有限公司 | A kind of FLASH antenna array control method and controller based on FPGA |
| CN109918316A (en) * | 2019-02-26 | 2019-06-21 | 深圳忆联信息系统有限公司 | A kind of method and its system reducing FTL address of cache space |
Non-Patent Citations (1)
| Title |
|---|
| 高源: "Flash存储器混合型地址映射算法研究", 《中国优秀硕士学位论文全文数据库·信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111045956A (en) * | 2019-12-22 | 2020-04-21 | 北京浪潮数据技术有限公司 | Solid state disk garbage recycling method and device based on multi-core CPU |
| CN114201331A (en) * | 2022-02-17 | 2022-03-18 | 深圳佰维存储科技股份有限公司 | Method, device, equipment and storage medium for detecting instruction conflict of solid state disk |
| CN114201331B (en) * | 2022-02-17 | 2022-05-31 | 深圳佰维存储科技股份有限公司 | Method, device and equipment for detecting instruction conflict of solid state disk and storage medium |
| CN117149091A (en) * | 2023-10-23 | 2023-12-01 | 四川云海芯科微电子科技有限公司 | Solid state disk data storage method and related device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110287129B (en) | 2021-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11693463B2 (en) | Memory system and controller | |
| CN110287129A (en) | L2P table based on solid state hard disk updates and is written management method and device | |
| US10936207B2 (en) | Linked lists in flash memory | |
| CN111399777B (en) | Differential key value data storage method based on data value classification | |
| US11048676B2 (en) | Trees and graphs in flash memory | |
| US20120215965A1 (en) | Storage Device and Computer Using the Same | |
| US10445238B1 (en) | Robust transactional memory | |
| AU2006262111B2 (en) | Managing memory pages | |
| CN109407979A (en) | Multithreading persistence B+ data tree structure design and implementation methods | |
| US11106362B2 (en) | Additive library for data structures in a flash memory | |
| CN104516959B (en) | A kind of method and device for managing database journal | |
| US10318201B2 (en) | Flash interface for processing datasets | |
| US20140328127A1 (en) | Method of Managing Non-Volatile Memory and Non-Volatile Storage Device Using the Same | |
| CN109952567A (en) | For bypassing the internally cached method and apparatus of advanced DRAM memories controller | |
| CN109165321B (en) | Consistent hash table construction method and system based on nonvolatile memory | |
| CN108431784A (en) | Access request processing method, device and computer system | |
| US20100281082A1 (en) | Subordinate Multiobjects | |
| CN103853669A (en) | Storage management method based on NOR Flash | |
| KR101456104B1 (en) | Method, system for dual buffering file management with non-volatile memory and mass storage device using the same | |
| Feng et al. | Mapping granularity adaptive ftl based on flash page re-programming | |
| KR101623631B1 (en) | Cache memory structure and method | |
| CN111752685B (en) | Persistent memory transaction submitting method under multi-core architecture | |
| GB2614676A (en) | Managing least-recently-used data cache with persistent body | |
| WO2021154516A1 (en) | Reducing requests using probabilistic data structures | |
| CN111444114B (en) | Method, device and system for processing data in nonvolatile 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 |