CN109815166B - Dynamic recovery processing method of stored data and storage device - Google Patents

Dynamic recovery processing method of stored data and storage device Download PDF

Info

Publication number
CN109815166B
CN109815166B CN201811626099.0A CN201811626099A CN109815166B CN 109815166 B CN109815166 B CN 109815166B CN 201811626099 A CN201811626099 A CN 201811626099A CN 109815166 B CN109815166 B CN 109815166B
Authority
CN
China
Prior art keywords
capacity
blocks
data
slc
threshold
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
Application number
CN201811626099.0A
Other languages
Chinese (zh)
Other versions
CN109815166A (en
Inventor
李虎
罗胜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Demingli Electronics Co Ltd
Original Assignee
Shenzhen Demingli Electronics Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Demingli Electronics Co Ltd filed Critical Shenzhen Demingli Electronics Co Ltd
Priority to CN201811626099.0A priority Critical patent/CN109815166B/en
Priority to PCT/CN2019/078403 priority patent/WO2020133728A1/en
Publication of CN109815166A publication Critical patent/CN109815166A/en
Application granted granted Critical
Publication of CN109815166B publication Critical patent/CN109815166B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0877Cache access modes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0893Caches characterised by their organisation or structure

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 provides a dynamic recovery processing method and a storage device of storage data, wherein the method comprises the following steps: receiving a data writing command and acquiring a logical address in the data writing command; judging whether the corresponding storage unit exists in the logic address according to a mapping table established in advance; if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table; calculating the effective logic capacity according to the mapping table; according to the size of the effective logic capacity, the data are stored by using the SLC block and the TLC block dynamically; dynamically using the SLC block internal recovery data and/or TLC block recovery data according to the size of the available logical capacity and the number of SLC empty blocks; according to the size of the effective logic capacity, different recovery modes are adopted to dynamically recover data, so that the recovery times can be effectively reduced, and the product performance and stability can be improved.

Description

Dynamic recovery processing method of stored data and storage device
Technical Field
The present invention relates to the field of memory technologies, and in particular, to a dynamic recovery processing method for stored data and a storage device.
Background
In the existing TLC FLASH storage product, part of TLC blocks generally use an SLC mode to cache data, and after the data is written to a certain extent, valid data cached in the SLC blocks is transferred to the TLC blocks, at this time, the number of SLC blocks is greatly reduced, only a small number of SLC blocks are reserved for caching data, generally 128 blocks, and because the number of SLC blocks is small, the number of data recovery times is increased, and the product performance is reduced.
Disclosure of Invention
The invention aims to provide a dynamic recovery processing method for stored data and a storage device aiming at the problem of performance reduction of products caused by a large number of data recovery times in the prior art, and the method and the device can effectively improve the performance of the products.
A dynamic recovery processing method of stored data comprises the following steps:
receiving a data writing command and acquiring a logical address in the data writing command;
judging whether the logic address has a corresponding storage unit according to a pre-established mapping table;
if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table;
calculating effective logic capacity according to the mapping table;
according to the size of the effective logic capacity, the data are stored by using the SLC block and the TLC block dynamically;
dynamically using SLC block internal recovery data and/or TLC block recovery data depending on the size of the available logical capacity and the number of SLC empty blocks.
Further, the effective logical capacity is the total capacity of the storage units corresponding to all the logical addresses in the mapping table;
according to the size of the effective logic capacity, the data is stored by using SLC blocks and TLC blocks dynamically, and the method comprises the following steps:
and detecting whether the effective logic capacity is less than or equal to a first capacity threshold value, and if so, storing data by using the SLC blocks completely.
Further, according to the size of the effective logic capacity, the data is stored dynamically by using the SLC blocks and the TLC blocks, and the method further comprises the following steps:
and detecting whether the effective logic capacity is larger than a first capacity threshold and smaller than or equal to a second capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is more than that of TLC blocks.
Further, according to the size of the effective logic capacity, the data is stored dynamically by using the SLC blocks and the TLC blocks, and the method further comprises the following steps:
and detecting whether the effective logic capacity is larger than a second capacity threshold and smaller than or equal to a third capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is less than that of TLC blocks.
Further, dynamically using SLC block internal recycle data and/or TLC block recycle data based on the size of the available logical capacity and the number of SLC empty blocks, comprising:
if the effective logical capacity is greater than the third capacity threshold and the number of SLC empty blocks is less than a third number threshold, then the stored data in the SLC blocks is transferred to the TLC blocks.
Further, if the effective logical capacity is greater than the second capacity threshold and less than or equal to a third capacity threshold and the number of SLC empty blocks is less than a second number threshold, then the stored data in the SLC blocks is transferred to corresponding TLC blocks and data is recovered inside the remaining SLC blocks.
Further, if the effective logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold and the number of SLC empty blocks is less than a first number threshold, then all of the data is recycled inside the SLC blocks.
Further, the first capacity threshold is 1/3 of system capacity, the second capacity threshold is 1/2 of system capacity, and the third capacity threshold is 2/3 of system capacity.
Further, the first quantity threshold is 90% of the total number of SLC blocks for which the effective logical capacity is less than or equal to the first capacity threshold;
the second number threshold is 90% of the number of SLC blocks when the effective logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold;
the third quantity threshold is 128.
A storage device comprises a main control unit and a storage module, wherein the storage module is used for storing a plurality of instructions, and the main control unit is used for reading the instructions and executing:
receiving a data writing command and acquiring a logical address in the data writing command;
judging whether the logic address has a corresponding storage unit according to a pre-established mapping table;
if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table;
calculating effective logic capacity according to the mapping table;
according to the size of the effective logic capacity, the data are stored by using the SLC block and the TLC block dynamically;
dynamically using SLC block internal recovery data and/or TLC block recovery data depending on the size of the available logical capacity and the number of SLC empty blocks.
According to the dynamic recovery processing method and the storage device for the storage data, provided by the invention, the data are dynamically recovered by adopting different recovery modes according to the size of the effective logic capacity, so that the recovery times can be effectively reduced, and the product performance and the stability can be improved.
Drawings
Fig. 1 is a flowchart of an embodiment of a method for dynamically recycling stored data according to the present invention.
Fig. 2 is a flowchart of another embodiment of a dynamic recovery processing method for stored data according to the present invention.
Fig. 3 is a schematic structural diagram of a memory device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and effects of the present invention clearer and clearer, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Example one
Referring to fig. 1, the present embodiment provides a method for dynamically recycling stored data, including:
step S101, receiving a data writing command and acquiring a logic address in the data writing command;
step S102, judging whether the logic address has a corresponding storage unit according to a pre-established mapping table;
step S103, if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table;
step S104, calculating effective logic capacity according to the mapping table;
step S105, according to the size of the effective logic capacity, the SLC block and the TLC block are used for storing data dynamically;
and a step S106 of dynamically using the SLC block internal recovery data and/or the TLC block recovery data according to the size of the effective logical capacity and the number of SLC empty blocks.
Specifically, step S101 is executed to detect whether a data write command of a user is received, and if so, a logical address in the data write command is acquired.
Further, step S102 is executed to determine whether the logical address has a corresponding storage unit according to a pre-established mapping table, where the mapping table is used to store a mapping relationship between the logical address and the storage unit.
Further, step S103 is executed to determine whether the logical address has a corresponding storage unit, that is, whether the logical address has a mapping record, if the logical address does not have a corresponding storage unit, add 1 to the effective logical capacity, and update the mapping table, and if the logical address has a corresponding storage unit, the effective logical capacity is not added.
Further, step S104 is executed to calculate an effective logical capacity according to a mapping table, where the effective logical capacity is a total capacity of storage units corresponding to all logical addresses in the mapping table.
Further, step S105 is executed to dynamically use the SLC block and the TLC block to store data according to the size of the available logical capacity, which specifically includes:
and detecting whether the effective logic capacity is less than or equal to a first capacity threshold value, and if so, storing data by using the SLC blocks completely.
As a preferred embodiment, the first capacity threshold is 1/3 of the system capacity, the system capacity is the total capacity of the system reported by the storage device, and when the effective logical capacity is less than 1/3 of the system capacity, all SLC blocks are used to store data, and the performance is optimal at this time.
Further, dynamically using the SLC block and the TLC block to store data according to the size of the available logical capacity, further comprises:
and detecting whether the effective logic capacity is larger than a first capacity threshold and smaller than or equal to a second capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is more than that of TLC blocks.
In a preferred embodiment, the second capacity threshold is 1/2 of the system capacity, and when the available logical capacity is greater than 1/3 of the system capacity and less than or equal to 1/2 of the system capacity, the data is stored mainly using SLC blocks, and at the same time, a small number of TLC blocks are used to store data, that is, the number of SLC blocks is greater than the number of TLC blocks.
Further, dynamically using the SLC block and the TLC block to store data according to the size of the available logical capacity, further comprises:
and detecting whether the effective logic capacity is larger than a second capacity threshold and smaller than or equal to a third capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is less than that of TLC blocks.
In a preferred embodiment, the third capacity threshold is 2/3 of the system capacity, and if the available logical capacity is less than 1/2 and less than or equal to 2/3, the TLC blocks are mainly used to store data while a small number of TLC blocks are used to store data, i.e. the number of TLC blocks is greater than the number of SLC blocks.
Further, step S106 is executed, and referring to fig. 2, the dynamically using the SLC block internal recycle data and/or the TLC block recycle data according to the size of the effective logical capacity and the number of SLC empty blocks specifically includes:
if the effective logical capacity is greater than the third capacity threshold and the number of SLC empty blocks is less than a third number threshold, then the stored data in the SLC blocks is transferred to the TLC blocks.
In a preferred embodiment, the third threshold number is the minimum number of SLC blocks in a conventional design, typically 128 blocks, and when the available logical capacity is greater than 2/3 system capacity, the number of SLC empty blocks is detected, and if the number of SLC empty blocks is less than the first threshold number, data recovery is performed, wherein all of the SLC blocks are transferred to TLC blocks, leaving only a portion of the SLC blocks as hot data buffers, since data is stored primarily in TLC blocks, a small portion is stored in SLC blocks, and the number of TLC blocks is greater than the number of SLC blocks.
Further, if the effective logical capacity is greater than the second capacity threshold and less than or equal to a third capacity threshold and the number of SLC empty blocks is less than a second number threshold, then the stored data in the SLC blocks is transferred to corresponding TLC blocks and data is recovered inside the remaining SLC blocks.
As a preferred embodiment, if the available logical capacity is greater than 1/2 system capacity and less than or equal to 2/3 system capacity, it is checked whether the number of SLC empty blocks is less than a second number threshold, which is 90% of the total number of current SLC blocks, and if the number of SLC empty blocks is less than the second number threshold, which is less than 90% of the total number, then data reclamation is required, where the data is primarily stored in SLC blocks, and where a small portion is stored in TLC blocks, where the number of SLC blocks is greater than the number of TLC blocks, the stored data of some SLC blocks is transferred to corresponding TLC blocks, and where the remaining portion of SLC block data is reclaimed inside the SLC blocks, and invalid data is reclaimed and the SLC blocks are freed.
Further, if the available logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold and the number of SLC empty blocks is less than a first number threshold, then all SLA block internal reclamation data is used.
As a preferred embodiment, if the available logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold, it is detected whether the number of SLC empty blocks is less than a first number threshold, the first number threshold being 90% of the total number of SLC blocks currently, and if the number of SLC empty blocks is less than the first number threshold, i.e. less than 90% of the total number, data recovery is performed.
SLC (Single-Level Cell), which is used to temporarily store data, has a small capacity and a high speed.
TLC (Triple-Level Cell) is used for long-term data storage, and has large capacity and large quantity.
The SLC block and TLC block may be switched to each other.
According to the dynamic recovery processing method for the stored data, the data are dynamically recovered by adopting different recovery modes according to the size of the effective logic capacity, so that the recovery times can be effectively reduced, and the product performance and the stability can be improved.
Example two
Referring to fig. 3, the present embodiment provides a storage apparatus, including a main control unit 201 and a storage module 202, where the storage module 202 is configured to store a plurality of instructions, and the main control unit 201 is configured to read the instructions and execute:
receiving a data writing command and acquiring a logical address in the data writing command;
judging whether the logic address has a corresponding storage unit according to a pre-established mapping table;
if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table;
calculating effective logic capacity according to the mapping table;
according to the size of the effective logic capacity, the data are stored by using the SLC block and the TLC block dynamically;
dynamically using SLC block internal recovery data and/or TLC block recovery data depending on the size of the available logical capacity and the number of SLC empty blocks.
As a preferred embodiment, the effective logical capacity is a total capacity of the storage units corresponding to all logical addresses in the mapping table.
Further, the main control unit 201 is further configured to perform:
and detecting whether the effective logic capacity is less than or equal to a first capacity threshold value, and if so, storing data by using the SLC blocks completely.
Further, the main control unit 201 is further configured to perform:
and detecting whether the effective logic capacity is larger than a first capacity threshold and smaller than or equal to a second capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is more than that of TLC blocks.
Further, the main control unit 201 is further configured to perform:
and detecting whether the effective logic capacity is larger than a second capacity threshold and smaller than or equal to a third capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is less than that of TLC blocks.
Further, the main control unit 201 is further configured to perform:
if the effective logical capacity is greater than the third capacity threshold and the number of SLC empty blocks is less than a third number threshold, then the stored data in the SLC blocks is transferred to the TLC blocks.
Further, the main control unit 201 is further configured to perform:
if the effective logical capacity is greater than the second capacity threshold and less than or equal to a third capacity threshold and the number of SLC empty blocks is less than a second number threshold, then the stored data in the SLC blocks is transferred to corresponding TLC blocks and data is recovered inside the remaining SLC blocks.
Further, the main control unit 201 is further configured to perform:
if the available logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold and the number of SLC empty blocks is less than a first number threshold, then all of the data is recycled using the SLC blocks internally.
In a preferred embodiment, the first capacity threshold is 1/3 of the system capacity, the second capacity threshold is 1/2 of the system capacity, and the third capacity threshold is 2/3 of the system capacity.
As a preferred embodiment, the first number threshold is 90% of the total number of SLC blocks at which the effective logical capacity is less than or equal to the first capacity threshold;
the second number threshold is 90% of the number of SLC blocks when the effective logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold;
the third quantity threshold is 128.
The storage device provided by the embodiment can dynamically recycle data by adopting different recycling modes according to the size of the effective logic capacity, can effectively reduce the recycling times, and has high product performance and stability.
It will be understood that modifications and variations can be made by persons skilled in the art in light of the above teachings and all such modifications and variations are intended to be included within the scope of the invention as defined in the appended claims.

Claims (8)

1. A dynamic recovery processing method for stored data is characterized by comprising the following steps:
receiving a data writing command and acquiring a logical address in the data writing command;
judging whether the logic address has a corresponding storage unit according to a pre-established mapping table;
if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table;
calculating effective logic capacity according to the mapping table;
according to the size of the effective logic capacity, the data are stored by using the SLC block and the TLC block dynamically;
dynamically using SLC block internal recovery data and/or TLC block recovery data based on the size of the available logical capacity and the number of SLC empty blocks;
the effective logic capacity is the total capacity of the storage units corresponding to all the logic addresses in the mapping table;
according to the size of the effective logic capacity, the data is stored by using SLC blocks and TLC blocks dynamically, and the method comprises the following steps:
detecting whether the effective logic capacity is smaller than or equal to a first capacity threshold value, and if so, storing data by using SLC blocks completely;
and detecting whether the effective logic capacity is larger than a first capacity threshold and smaller than or equal to a second capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is more than that of TLC blocks.
2. The dynamic reclamation processing of stored data as recited in claim 1, wherein the data is dynamically stored using SLC blocks and TLC blocks based on the size of the available logical capacity, further comprising:
and detecting whether the effective logic capacity is larger than a second capacity threshold and smaller than or equal to a third capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is less than that of TLC blocks.
3. The dynamic reclamation processing method of stored data as recited in claim 2, wherein dynamically using the SLC block internal reclamation data and/or the TLC block reclamation data based on the size of the available logical capacity and the number of SLC empty blocks comprises:
if the effective logical capacity is greater than the third capacity threshold and the number of SLC empty blocks is less than a third number threshold, then the stored data in the SLC blocks is transferred to the TLC blocks.
4. The dynamic reclamation processing method of storage data as recited in claim 3,
if the effective logical capacity is greater than the second capacity threshold and less than or equal to a third capacity threshold and the number of SLC empty blocks is less than a second number threshold, then the stored data in the SLC blocks is transferred to corresponding TLC blocks and data is recovered inside the remaining SLC blocks.
5. The method of claim 4, wherein the step of dynamically recovering the stored data,
if the available logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold and the number of SLC empty blocks is less than a first number threshold, then all of the data is recycled using the SLC blocks internally.
6. The method of claim 5, wherein the first capacity threshold is 1/3, the second capacity threshold is 1/2, and the third capacity threshold is 2/3.
7. The method of claim 6, wherein the first threshold number is 90% of the total number of SLC blocks when the available logical capacity is less than or equal to the first threshold capacity;
the second number threshold is 90% of the number of SLC blocks when the effective logical capacity is greater than the first capacity threshold and less than or equal to the second capacity threshold;
the third quantity threshold is 128 blocks.
8. A storage device is characterized by comprising a main control unit and a storage module, wherein the storage module is used for storing a plurality of instructions, and the main control unit is used for reading the instructions and executing:
receiving a data writing command and acquiring a logical address in the data writing command;
judging whether the logic address has a corresponding storage unit according to a pre-established mapping table;
if the corresponding storage unit does not exist in the logical address, adding 1 to the effective logical capacity, and updating the mapping table;
calculating effective logic capacity according to the mapping table;
according to the size of the effective logic capacity, the data are stored by using the SLC block and the TLC block dynamically;
dynamically using SLC block internal recovery data and/or TLC block recovery data based on the size of the available logical capacity and the number of SLC empty blocks;
the effective logic capacity is the total capacity of the storage units corresponding to all the logic addresses in the mapping table;
according to the size of the effective logic capacity, the data is stored by using SLC blocks and TLC blocks dynamically, and the method comprises the following steps:
detecting whether the effective logic capacity is smaller than or equal to a first capacity threshold value, and if so, storing data by using SLC blocks completely;
and detecting whether the effective logic capacity is larger than a first capacity threshold and smaller than or equal to a second capacity threshold, if so, partially adopting SLC blocks to store data, and partially adopting TLC blocks to store data, wherein the number of SLC blocks is more than that of TLC blocks.
CN201811626099.0A 2018-12-28 2018-12-28 Dynamic recovery processing method of stored data and storage device Active CN109815166B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201811626099.0A CN109815166B (en) 2018-12-28 2018-12-28 Dynamic recovery processing method of stored data and storage device
PCT/CN2019/078403 WO2020133728A1 (en) 2018-12-28 2019-03-16 Data storage dynamic recovery processing method and storage device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811626099.0A CN109815166B (en) 2018-12-28 2018-12-28 Dynamic recovery processing method of stored data and storage device

Publications (2)

Publication Number Publication Date
CN109815166A CN109815166A (en) 2019-05-28
CN109815166B true CN109815166B (en) 2020-10-09

Family

ID=66602695

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811626099.0A Active CN109815166B (en) 2018-12-28 2018-12-28 Dynamic recovery processing method of stored data and storage device

Country Status (2)

Country Link
CN (1) CN109815166B (en)
WO (1) WO2020133728A1 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110782941B (en) * 2019-09-12 2021-05-04 深圳市德明利技术股份有限公司 Method, device and equipment for testing storage equipment and automatically distributing BIN
CN112882663B (en) * 2021-03-25 2022-10-14 湖南国科微电子股份有限公司 Random writing method, electronic equipment and storage medium
WO2023035120A1 (en) * 2021-09-07 2023-03-16 华为技术有限公司 Method and apparatus for managing data

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102419735A (en) * 2010-09-24 2012-04-18 株式会社东芝 Method and apparatus for storing data in a multi-level cell flash memory device
US20140019670A1 (en) * 2012-07-11 2014-01-16 Phison Electronics Corp. Data writing method, memory controller, and memory storage device
CN103942151A (en) * 2014-04-10 2014-07-23 深圳市硅格半导体有限公司 Data storage method and device for flash memory
CN107291381A (en) * 2017-05-18 2017-10-24 记忆科技(深圳)有限公司 The implementation method and solid state hard disc of a kind of dynamic accelerating region of solid state hard disc
CN107506137A (en) * 2017-08-11 2017-12-22 记忆科技(深圳)有限公司 A kind of method for lifting solid state hard disc write performance

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI486766B (en) * 2012-05-11 2015-06-01 Phison Electronics Corp Data processing method, and memory controller and memory storage apparatus using the same
CN106325764B (en) * 2015-07-08 2021-02-26 群联电子股份有限公司 Memory management method, memory control circuit unit and memory storage device
CN107357534A (en) * 2017-07-18 2017-11-17 深圳市德名利电子有限公司 A kind of dynamic switching method and system of flash block pattern
CN111488122A (en) * 2017-10-25 2020-08-04 华为技术有限公司 Data writing method and storage device
CN108255419A (en) * 2017-12-19 2018-07-06 深圳忆联信息系统有限公司 A kind of abrasion equilibrium method and SSD for TLC types SSD

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102419735A (en) * 2010-09-24 2012-04-18 株式会社东芝 Method and apparatus for storing data in a multi-level cell flash memory device
US20140019670A1 (en) * 2012-07-11 2014-01-16 Phison Electronics Corp. Data writing method, memory controller, and memory storage device
CN103942151A (en) * 2014-04-10 2014-07-23 深圳市硅格半导体有限公司 Data storage method and device for flash memory
CN107291381A (en) * 2017-05-18 2017-10-24 记忆科技(深圳)有限公司 The implementation method and solid state hard disc of a kind of dynamic accelerating region of solid state hard disc
CN107506137A (en) * 2017-08-11 2017-12-22 记忆科技(深圳)有限公司 A kind of method for lifting solid state hard disc write performance

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
固态硬盘设计中的关键技术研究;沈佐兵;《中国优秀硕士学位论文全文数据库》;20140615;全文 *

Also Published As

Publication number Publication date
WO2020133728A1 (en) 2020-07-02
CN109815166A (en) 2019-05-28

Similar Documents

Publication Publication Date Title
US8423710B1 (en) Sequential writes to flash memory
CN109871333B (en) Method for accessing flash memory module, related flash memory controller and electronic device
KR100843543B1 (en) System comprising flash memory device and data recovery method thereof
US8392649B2 (en) Memory storage device, controller, and method for responding to host write commands triggering data movement
CN110895514A (en) Mapping table updating method
CN109815166B (en) Dynamic recovery processing method of stored data and storage device
CN105718530B (en) File storage system and file storage control method thereof
US20090319720A1 (en) System and method of garbage collection in a memory device
US20110058422A1 (en) Systems and Methods for Circular Buffering Control in a Memory Device
US20140237321A1 (en) Solid state drive cache recovery in a clustered storage system
US20150074355A1 (en) Efficient caching of file system journals
US20220066527A1 (en) Storage device and method for sudden power off recovery thereof
US11467970B1 (en) Metadata management in non-volatile memory devices using in-memory journal
CN109669889B (en) Light Nor Flash control method and device
US9384125B2 (en) Method for accessing flash memory having pages used for data backup and associated memory device
CN103984506A (en) Method and system for data writing of flash memory storage equipment
CN104679684A (en) Semiconductor device and operating method thereof
TW201732533A (en) Data storage device and operating method thereof
CN115705153A (en) Conditional update and deferred lookup
US20130254511A1 (en) Improving Storage Lifetime Using Data Swapping
CN108664217B (en) Caching method and system for reducing jitter of writing performance of solid-state disk storage system
CN112035065B (en) Data writing method, device and equipment and computer readable storage medium
US10452312B2 (en) Apparatus, system, and method to determine a demarcation voltage to use to read a non-volatile memory
CN110489053B (en) Method for managing flash memory module, related flash memory controller and electronic device
CN113377282A (en) Data storage device and data processing method

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
CB02 Change of applicant information

Address after: Room 701, 7th floor, Smart Valley Innovation Park, 1010 Bulong Road, Minzhi Street, Longhua District, Shenzhen City, Guangdong Province

Applicant after: Shenzhen deminli Technology Co., Ltd

Address before: 518000, 701, building 7, wisdom Valley Innovation Park, people's street, Longhua District, Shenzhen, Guangdong

Applicant before: SHENZHEN DEMINGLI ELECTRONICS Co.,Ltd.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant
CP02 Change in the address of a patent holder

Address after: 2501, 2401, block a, building 1, Shenzhen new generation industrial park, 136 Zhongkang Road, Meidu community, Meilin street, Futian District, Shenzhen, Guangdong 518000

Patentee after: Shenzhen deminli Technology Co.,Ltd.

Address before: 518000 room 701, 7 / F, wisdom Valley Innovation Park, 1010 Bulong Road, Minzhi street, Longhua District, Shenzhen City, Guangdong Province

Patentee before: Shenzhen deminli Technology Co.,Ltd.

CP02 Change in the address of a patent holder