WO2020103468A1 - Procédé de traitement d'informations superflues basé sur mémoire flash, disque à semi-conducteurs et dispositif de stockage - Google Patents

Procédé de traitement d'informations superflues basé sur mémoire flash, disque à semi-conducteurs et dispositif de stockage

Info

Publication number
WO2020103468A1
WO2020103468A1 PCT/CN2019/095196 CN2019095196W WO2020103468A1 WO 2020103468 A1 WO2020103468 A1 WO 2020103468A1 CN 2019095196 W CN2019095196 W CN 2019095196W WO 2020103468 A1 WO2020103468 A1 WO 2020103468A1
Authority
WO
WIPO (PCT)
Prior art keywords
physical
flash memory
page
physical block
physical page
Prior art date
Application number
PCT/CN2019/095196
Other languages
English (en)
Chinese (zh)
Inventor
张吉兴
Original Assignee
深圳大普微电子科技有限公司
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 深圳大普微电子科技有限公司 filed Critical 深圳大普微电子科技有限公司
Publication of WO2020103468A1 publication Critical patent/WO2020103468A1/fr

Links

Images

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

Definitions

  • the present application relates to the field of storage technology, in particular to a flash memory-based garbage processing method, a solid-state hard disk, and a storage device.
  • the particle characteristics of the flash memory (NAND) in the solid state hard disk are: multiple physical blocks (Block) form the flash memory, and the physical block must be erased before data can be written. If there are some valid data pages (physical pages storing user data) in a physical block before erasing, in order not to lose user data, the data in the valid physical pages must be read out and written to another physical block before Erase the physical block, this is garbage disposal.
  • the present application provides a flash memory-based garbage processing method, a solid-state hard disk, and a storage device, which can greatly improve the efficiency of determining effective physical pages from physical blocks to transfer data of effective physical pages, thereby greatly improving the efficiency of garbage processing.
  • a technical solution adopted by the present application is: to provide a flash memory-based garbage disposal method, which includes: acquiring the physical blocks in the flash memory to be disposed of; according to the index corresponding to the L2P table and the physical blocks The list obtains valid physical pages in the physical block, where the index list records the association between each physical page in the physical block and the logical page corresponding to each physical page; transfers the data in the valid physical page and erases the physical block.
  • the step of obtaining valid physical pages in the physical block according to the L2P table and the index list corresponding to the physical block includes: obtaining the first physical page in the physical block and the first physical page corresponding to the first physical page from the index list corresponding to the physical block Information of a logical page; obtaining a second physical page corresponding to the information of the first logical page in the L2P table; obtaining effective physical pages in the physical block according to the first physical page and the second physical page.
  • the step of obtaining valid physical pages in the physical block according to the first physical page and the second physical page includes: detecting whether the information of the first physical page and the second physical page match; if the first physical page and the second physical page match If the information matches, the first physical page is determined to be a valid physical page; if the information of the first physical page and the second physical page do not match, the first physical page is determined to be an invalid physical page.
  • the method before the step of acquiring the physical blocks in the flash memory to be garbage processed, the method further includes the step of: constructing an index list corresponding to each physical block in the flash memory.
  • the steps of constructing the index list corresponding to each physical block in the flash memory include: detecting whether there is a physical block in the flash memory that is written to the data for the first time; Allocate the storage space of the index list corresponding to the physical block used to store the first written data; detect whether the physical block has completed the writing of all data; if the detection result is that the physical block has not completed the writing of all data, the physical block is used
  • the written data sequentially updates the index list stored in the storage space; if the detection result is that the physical block completes writing all the data, the index list stored in the storage controller is written to the flash memory.
  • the steps of sequentially updating the index list stored in the storage space according to the data written by the physical block include: acquiring information of the physical page where the data is written, and information of the logical page corresponding to the physical page; establishing the physical page and logic Page mapping relationship to form an index list.
  • the method further includes: detecting whether the flash memory is triggered for garbage processing; if the detection result is that the flash memory is triggered for garbage processing, then performing the acquisition of the physical to be garbage processed in the flash memory Block steps.
  • the step of acquiring the physical blocks to be garbage processed in the flash memory further includes: loading the index list of the physical blocks to be garbage processed from the flash memory into the storage controller.
  • a solid state hard disk including a processor, a storage controller coupled to the processor, and a flash memory, wherein the storage controller stores storage The program instructions of the flash memory-based garbage processing method according to any one of the above; the processor is used to execute the program instructions stored by the storage controller to perform garbage processing on the flash memory.
  • Another technical solution adopted by the present application is to provide a storage device that stores a program file capable of implementing any of the above methods.
  • the beneficial effects of the present application are: the flash memory-based garbage disposal method, solid-state hard disk, and storage device of the present invention obtain effective physical pages in a physical block according to the index list corresponding to the L2P table and the physical block, because the L2P table and the index list
  • the read time is very short, so that the effective physical page in the physical block to be garbage processed can be quickly determined to transfer the data of the effective physical page, thereby greatly improving the efficiency of garbage processing.
  • Figure 1 is a schematic diagram of garbage disposal in the prior art
  • FIG. 2 is a schematic flowchart of the flash memory-based garbage processing method according to the first embodiment of the present invention
  • FIG. 3 is a schematic diagram of the structure of the L2P table and index list in FIG. 2;
  • FIG. 4 is a schematic flowchart of a flash memory-based garbage processing method according to a second embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a sub-process of constructing an index list corresponding to each physical block in the flash memory in FIG. 4;
  • FIG. 6 is a schematic diagram of a sub-flow of FIG. 4 for obtaining valid physical pages in a physical block according to an L2P table and an index list corresponding to the physical block;
  • FIG. 7 is a schematic structural diagram of a solid-state hard disk according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a storage device according to an embodiment of the present invention.
  • first”, “second”, and “third” in this application are for descriptive purposes only, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Thus, the features defined as “first”, “second”, and “third” may explicitly or implicitly include at least one of the features.
  • the meaning of “plurality” is at least two, such as two, three, etc., unless otherwise specifically limited. All the directional indicators (such as up, down, left, right, front, back %) in the embodiments of this application are only used to explain the relative positional relationship between the components in a certain posture (as shown in the drawings) , Movement, etc., if the specific posture changes, the directional indication changes accordingly.
  • FIG. 2 is a flowchart of a flash memory-based garbage processing method according to a first embodiment of the present invention. It should be noted that if there are substantially the same results, the method of the present invention is not limited to the sequence of the flow shown in FIG. 2. As shown in Figure 2, the method includes steps:
  • Step S101 Obtain a physical block in the flash memory to be garbage processed.
  • step S101 the step of acquiring the physical blocks in the flash memory to be garbage-processed may be: acquiring the number of valid physical pages in each physical block in the flash memory, and selecting the physical block with the smallest number of valid physical pages as the garbage-to-be-processed Physical block.
  • Step S102 Obtain valid physical pages in the physical block according to the L2P table and the index list corresponding to the physical block, where the index list records the association relationship between each physical page in the physical block and the logical page corresponding to each physical page.
  • step S102 the firmware of the solid-state drive needs to maintain the mapping information from the logical page (LPA, assuming a size of 16KB) to the physical page (PPA, assuming a size of 16KB), which is called a mapping table (L2P table), and the L2P table Use logical pages as index values.
  • LPA logical page
  • PPA physical page
  • L2P table mapping table
  • logical page 0 corresponds to physical page 2 (P2), that is, the mapping information is L0-> P2, that is, the solid state drive writes the data of logical page 0 to Physical page 2.
  • the mapping information is L0-> P2
  • the solid state drive writes the data of logical page 0 to Physical page 2.
  • the index list may use the physical page as an index value to record the association relationship between each physical page in the physical block and the logical page corresponding to each physical page.
  • mapping information is P0-> L0
  • mapping information is P2-> L0
  • logical page 0 (L0) writes data to physical page 0 (P0) for the first time.
  • Logical page 0 (L0) corresponds to physical page 0 (P0), which is the physical page 0.
  • the data is valid.
  • the mapping information of the logical page 0 (L0) in the L2P table is L0-> P0
  • the mapping information of the physical page (P0) in the P2L table is P0-> L0.
  • the host overwrites logical page 0, and logical page 0 (L0) writes new data to physical page 2 (P2) for the second time.
  • Logical page 0 (L0) corresponds to physical page 2 (P2), that is, physical page 0
  • P2 physical page 2
  • the mapping information of the logical page 0 (L0) in the L2P table becomes L0-> P2
  • the mapping information of the physical page (P2) in the P2L table is P2-> L0.
  • each physical block corresponds to a P2L table, so that the maintenance of the P2L table is simpler than the L2P table.
  • each unit in the P2L table can record a physical page and a logical mapping information.
  • the size occupied by each unit is 4B
  • a physical block contains, for example, 4096 physical pages
  • the size occupied by the P2L table corresponding to each physical block is 16KB, which is relatively small and easy to maintain.
  • the valid physical page can be obtained according to the L2P table and the P2L table corresponding to the physical block, where the valid physical page is a physical page that stores valid data.
  • Step S103 Transfer the data in the effective physical page and erase the physical block.
  • step S103 the step of transferring the data in the effective physical page is specifically: reading out the data in the effective physical page in the physical block to be garbage processed and writing it into the physical page of the new physical block, and Synchronously update the L2P table and the P2L table corresponding to the new physical block.
  • the flash memory-based garbage processing method of the first embodiment of the present invention obtains valid physical pages in the physical block according to the L2P table and the index list corresponding to the physical block, because the reading time of the L2P table and the index list is very short Therefore, the effective physical pages in the physical block to be garbage processed can be quickly determined to transfer the data of the effective physical pages, thereby greatly improving the efficiency of garbage processing.
  • FIG. 4 is a schematic flowchart of a flash memory-based garbage processing method according to a second embodiment of the present invention. It should be noted that if there are substantially the same results, the method of the present invention is not limited to the sequence of the flow shown in FIG. 4. As shown in Figure 4, the method includes the following steps:
  • Step S201 Construct an index list corresponding to each physical block in the flash memory, where the index list records the association relationship between each physical page in the physical block and the logical page corresponding to each physical page.
  • step S201 the index list is stored in the storage controller of the solid state drive, such as RAM or DRAM, during the construction process, and is stored in the flash memory of the solid state drive after the index list construction is completed.
  • the storage controller of the solid state drive such as RAM or DRAM
  • FIG. 5 is a schematic diagram of a sub-process of constructing an index list corresponding to each physical block in the flash memory in FIG. 4. As shown in FIG. 5, the operation of constructing the index list corresponding to each physical block in the flash memory includes the following steps:
  • Step S301 Detect whether a physical block in the flash memory is written with data for the first time.
  • Step S302 If the detection result is that a physical block in the flash memory is written for the first time, the storage controller allocates storage space for the index list corresponding to the physical block for storing the first written data.
  • step S302 when data is written to the physical block for the first time, the solid-state hard disk firmware allocates a predetermined size of storage space in the storage controller such as RAM or DRAM to store the P2L table.
  • Step S303 Detect whether the physical block has finished writing all data. If not, perform step S304, otherwise execute step S305.
  • the step of detecting whether the physical block has completed the writing of all data specifically includes: detecting whether all physical pages in the physical block have completed the write operation, that is, all physical in the physical block Whether all pages have been written.
  • the step of detecting whether the physical block has completed the writing of all data may also be: detecting whether the writing operation of all data to be written to the physical block has been completed, that is, the physical block All physical pages are written.
  • Step S304 sequentially update the index list stored in the storage space according to the data written in the physical block.
  • step S304 the steps of sequentially updating the index list stored in the storage space according to the data written by the physical block include: acquiring information of the physical page where the data is written, and information of the logical page corresponding to the physical page; establishing The mapping relationship between physical pages and logical pages forms an index list.
  • the structure of the index list (P2L table) in this embodiment is the same as the structure of the index list shown in FIG. 3, and for simplicity, it will not be described in detail here. It should be emphasized that after the mapping relationship between each physical page and logical page in the P2L table is established, this mapping relationship will not change, but multiple different physical pages can correspond to the same logical page.
  • Step S305 Write the index list stored in the storage controller into the flash memory.
  • step S305 after detecting that the physical block has finished writing all data in step S303, the index list stored in the storage controller is written into the flash memory.
  • Step S202 Detect whether the flash memory is triggered for garbage processing.
  • the step of detecting whether to trigger the flash memory for garbage processing may be: the solid state drive firmware detects the available space of the flash memory, and if the ratio of the available space of the flash memory to the flash memory space is less than a predetermined threshold, for example, 10%, the flash memory is triggered for garbage processing to Ensure the normal use of solid state drives.
  • the step of detecting whether to trigger the flash memory for garbage processing may also be: when the solid state drive firmware determines that the host does not access the solid state drive, trigger the flash memory for garbage processing, thereby reducing the host's access to the solid state drive and the process of flash memory garbage processing There may be a flash memory access conflict problem.
  • Step S203 If the detection result is to trigger the flash memory to perform garbage processing, obtain a physical block in the flash memory to be garbage processed.
  • step S203 the step of acquiring the physical blocks in the flash memory to be garbage-processed may be: acquiring the number of valid physical pages in each physical block in the flash memory, and selecting the physical block with the least number of valid physical pages as the garbage-to-be-processed Physical block.
  • the step of acquiring the physical blocks to be garbage processed in the flash memory further includes: loading the index list of the physical blocks to be garbage processed from the flash memory into the storage controller.
  • Step S204 Obtain valid physical pages in the physical block according to the L2P table and the index list corresponding to the physical block.
  • FIG. 6 is a schematic diagram of a sub-process of FIG. 4 for obtaining a valid physical page in a physical block according to an L2P table and an index list corresponding to the physical block.
  • the operation of obtaining valid physical pages in the physical block according to the L2P table and the index list corresponding to the physical block includes the following steps:
  • Step S401 Obtain the information of the first physical page in the physical block and the first logical page corresponding to the first physical page from the index list corresponding to the physical block.
  • step S401 for example, please refer to FIG. 3, according to the P2L table, the first physical page 0 (P0) corresponds to the logical page 0 (L0), that is, the mapping information is P0-> L0, the first physical page 2 (P2) corresponds to logical page 0 (L0), that is, the mapping information is P2-> L0.
  • Step S402 Acquire a second physical page corresponding to the first logical page in the L2P table.
  • step S402 following the above example, please continue to refer to FIG. 3, according to the L2P table, the physical page corresponding to logical page 0 (L0) is the second physical page 2 (P2).
  • Step S403 Detect whether the information of the first physical page and the second physical page match. If they match, perform step S404, otherwise execute step S405.
  • step S403 following the above example, for the first physical page 0, the first physical page 0 (P0) corresponds to the logical page 0 (L0), and the logical page 0 (L0) corresponds to the second physical page 2 (P2) The information on the first physical page is 0, and the information on the second physical page is 2, which does not match.
  • the first physical page 2 (P2) corresponds to the logical page 0 (L0)
  • the logical page 0 (L0) corresponds to the second physical page 2 (P2)
  • the information of the first physical page is 2
  • the information on the second physical page is 2, and the two match.
  • Step S404 Determine that the first physical page is a valid physical page.
  • step S404 following the above example, the first physical page 2 (P2) in the P2L table is a valid physical page.
  • Step S405 It is determined that the first physical page is an invalid physical page.
  • step S405 following the above example, the first physical page 0 (P0) in the P2L table is an invalid physical page.
  • Step S205 Transfer the data in the effective physical page and erase the physical block.
  • step S205 the step of transferring the data in the effective physical page is specifically: reading out the data in the effective physical page in the physical block to be garbage processed and writing it into the physical page of the new physical block, and Synchronously update the L2P table and the P2L table corresponding to the new physical block.
  • the flash memory-based garbage processing method of the second embodiment of the present invention acquires information about the first physical page in the physical block and the first logical page corresponding to the first physical page from the index list corresponding to the physical block; Obtain a second physical page corresponding to the information of the first logical page in the L2P table; if the information of the first physical page and the second physical page match, the first physical page is a valid physical page, otherwise it is an invalid physical page.
  • the present invention can quickly determine the effective physical page in the physical block to be garbage processed, thereby greatly improving the efficiency of garbage processing, and thereby ensuring the stability of the solid state hard disk.
  • FIG. 7 is a schematic structural diagram of a solid-state hard disk according to an embodiment of the present invention.
  • the solid-state hard disk includes a processor 11, a storage controller 12 and a flash memory 13 coupled to the processor.
  • the storage controller 12 stores program instructions for implementing the flash memory self-test method described in any of the above embodiments.
  • the processor 12 is used to execute the program instructions stored by the storage controller 12 to perform self-test on the flash memory 13.
  • the processor 11 may also be called a CPU (Central Processing Unit).
  • the processor 11 may be an integrated circuit chip with signal processing capabilities.
  • the processor 11 may also be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components .
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • FIG. 8 is a schematic structural diagram of a storage device according to an embodiment of the present invention.
  • the storage device of the embodiment of the present invention stores a program file 21 capable of implementing all the above methods, wherein the program file 21 may be stored in the storage device in the form of a software product, including several instructions to make a computer device (may It is a personal computer, server, or network device, etc.) or a processor that executes all or part of the steps of the methods described in the embodiments of the present application.
  • the aforementioned storage devices include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes , Or terminal devices such as computers, servers, mobile phones, and tablets.
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of units is only a division of logical functions.
  • there may be other divisions for example, multiple units or components may be combined or integrated To another system, or some features can be ignored, or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the above integrated unit may be implemented in the form of hardware or software functional unit.

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)
  • Techniques For Improving Reliability Of Storages (AREA)

Abstract

L'invention concerne un procédé de traitement d'informations superflues sur la base d'une mémoire flash, un disque à semi-conducteurs et un dispositif de stockage. Ledit procédé consiste : à acquérir, dans une mémoire flash, un bloc physique sur lequel un traitement d'informations superflues doit être effectué (S101) ; à acquérir une page physique valide dans le bloc physique selon une table L2P et une liste d'index correspondant au bloc physique, la liste d'index enregistrant une relation d'association entre chaque page physique du bloc physique et une page logique correspondant à la page physique (S102) ; et à transférer des données dans la page physique valide et à effacer le bloc physique (S103). Le procédé ci-dessus détermine rapidement une page physique valide dans un bloc physique sur lequel un traitement d'informations superflues doit être effectué, ce qui permet d'améliorer considérablement l'efficacité du traitement des informations superflues, et d'assurer en outre la stabilité du disque à semi-conducteurs.
PCT/CN2019/095196 2018-11-23 2019-07-09 Procédé de traitement d'informations superflues basé sur mémoire flash, disque à semi-conducteurs et dispositif de stockage WO2020103468A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811406466.6A CN109542800A (zh) 2018-11-23 2018-11-23 基于闪存的垃圾处理的方法、固态硬盘以及存储装置
CN201811406466.6 2018-11-23

Publications (1)

Publication Number Publication Date
WO2020103468A1 true WO2020103468A1 (fr) 2020-05-28

Family

ID=65850003

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/095196 WO2020103468A1 (fr) 2018-11-23 2019-07-09 Procédé de traitement d'informations superflues basé sur mémoire flash, disque à semi-conducteurs et dispositif de stockage

Country Status (2)

Country Link
CN (1) CN109542800A (fr)
WO (1) WO2020103468A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109542800A (zh) * 2018-11-23 2019-03-29 深圳大普微电子科技有限公司 基于闪存的垃圾处理的方法、固态硬盘以及存储装置
CN110058817A (zh) * 2019-04-11 2019-07-26 深圳大普微电子科技有限公司 一种固态硬盘垃圾处理方法及其固态硬盘
CN111722807B (zh) * 2020-06-20 2023-01-06 苏州浪潮智能科技有限公司 固态硬盘垃圾回收方法、装置、计算机设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103970669A (zh) * 2013-02-06 2014-08-06 Lsi公司 用于加速在固态设备中的回收操作的物理到逻辑地址映射
CN106548789A (zh) * 2015-09-17 2017-03-29 伊姆西公司 用于操作叠瓦式磁记录设备的方法和装置
US20180004420A1 (en) * 2016-07-04 2018-01-04 SK Hynix Inc. Data storage device and operating method thereof
CN108614781A (zh) * 2016-12-09 2018-10-02 北京京存技术有限公司 基于NANDflash的有效数据查找方法和NANDflash存储设备
CN108804023A (zh) * 2017-04-28 2018-11-13 爱思开海力士有限公司 数据存储装置及其操作方法
CN109542800A (zh) * 2018-11-23 2019-03-29 深圳大普微电子科技有限公司 基于闪存的垃圾处理的方法、固态硬盘以及存储装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105389266B (zh) * 2015-10-16 2019-03-01 北京联想核芯科技有限公司 一种数据管理方法及装置
CN108509349B (zh) * 2017-02-27 2022-10-14 得一微电子股份有限公司 一种nand flash的数据源区块回收方法及固态硬盘

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103970669A (zh) * 2013-02-06 2014-08-06 Lsi公司 用于加速在固态设备中的回收操作的物理到逻辑地址映射
CN106548789A (zh) * 2015-09-17 2017-03-29 伊姆西公司 用于操作叠瓦式磁记录设备的方法和装置
US20180004420A1 (en) * 2016-07-04 2018-01-04 SK Hynix Inc. Data storage device and operating method thereof
CN108614781A (zh) * 2016-12-09 2018-10-02 北京京存技术有限公司 基于NANDflash的有效数据查找方法和NANDflash存储设备
CN108804023A (zh) * 2017-04-28 2018-11-13 爱思开海力士有限公司 数据存储装置及其操作方法
CN109542800A (zh) * 2018-11-23 2019-03-29 深圳大普微电子科技有限公司 基于闪存的垃圾处理的方法、固态硬盘以及存储装置

Also Published As

Publication number Publication date
CN109542800A (zh) 2019-03-29

Similar Documents

Publication Publication Date Title
US9053007B2 (en) Memory system, controller, and method for controlling memory system
US11270734B2 (en) Method for accessing shingled magnetic recording SMR disk, and server
TWI592799B (zh) 映射表更新方法、記憶體控制電路單元及記憶體儲存裝置
TWI502594B (zh) 用於快閃儲存裝置之半區塊管理
US9710283B2 (en) System and method for pre-storing small data files into a page-cache and performing reading and writing to the page cache during booting
WO2020103468A1 (fr) Procédé de traitement d'informations superflues basé sur mémoire flash, disque à semi-conducteurs et dispositif de stockage
US20110040930A1 (en) Method for Accessing Flash Memory Device and Memory System Including the Same
TWI607448B (zh) 資料寫入方法、記憶體控制電路單元與記憶體儲存裝置
US9122586B2 (en) Physical-to-logical address map to speed up a recycle operation in a solid state drive
JPWO2009096180A1 (ja) メモリコントローラ、不揮発性記憶装置、及び、不揮発性記憶システム
US20200089619A1 (en) Data storage device and method of deleting namespace thereof
US8751756B2 (en) Method and apparatus for writing data in memory system
US10606744B2 (en) Method for accessing flash memory module and associated flash memory controller and electronic device
US20200356491A1 (en) Data storage device and method for loading logical-to-physical mapping table thereof
US11269783B2 (en) Operating method for data storage device
US11347420B2 (en) Attribute mapping in multiprotocol devices
CN109976664B (zh) 固态存储设备的日志数据组织
WO2020192710A1 (fr) Procédé de traitement des objets inutilisés au moyen d'une base de données lsm, d'un disque dur à semi-conducteurs et d'un appareil de stockage
TWI648739B (zh) 記憶體管理方法與儲存控制器
US11294579B2 (en) Mode handling in multi-protocol devices
CN110865945B (zh) 存储设备的扩展地址空间
CN110515861B (zh) 处理刷写命令的存储设备及其方法
US20220283912A1 (en) Storage device, operating method of storage device, and electronic device including storage device
US10896004B2 (en) Data storage device and control method for non-volatile memory, with shared active block for writing commands and internal data collection
TWI715116B (zh) 資料儲存裝置及其刪除命名空間之方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19886733

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 221021)

122 Ep: pct application non-entry in european phase

Ref document number: 19886733

Country of ref document: EP

Kind code of ref document: A1