WO2021056963A1 - 基于固态硬盘的映射表重建方法、装置和计算机设备 - Google Patents

基于固态硬盘的映射表重建方法、装置和计算机设备 Download PDF

Info

Publication number
WO2021056963A1
WO2021056963A1 PCT/CN2020/077120 CN2020077120W WO2021056963A1 WO 2021056963 A1 WO2021056963 A1 WO 2021056963A1 CN 2020077120 W CN2020077120 W CN 2020077120W WO 2021056963 A1 WO2021056963 A1 WO 2021056963A1
Authority
WO
WIPO (PCT)
Prior art keywords
logical address
physical page
mapping table
current
current physical
Prior art date
Application number
PCT/CN2020/077120
Other languages
English (en)
French (fr)
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 深圳忆联信息***有限公司
Priority to US17/043,482 priority Critical patent/US11816038B2/en
Publication of WO2021056963A1 publication Critical patent/WO2021056963A1/zh

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
    • 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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0877—Cache access modes
    • G06F12/0882—Page mode
    • 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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/10—Address translation
    • G06F12/1009—Address translation using page tables, e.g. page table structures
    • 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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
    • G06F12/0873—Mapping of cache memory to specific storage devices or parts thereof
    • 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/10—Providing a specific technical effect
    • G06F2212/1016—Performance improvement
    • 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

Definitions

  • This application relates to the technical field of solid-state hard disks, and in particular to a method, device and computer equipment based on solid-state hard disk mapping table reconstruction.
  • mapping from the logical address space to the physical address space forms a mapping table.
  • Each mapping relationship in the mapping table records the mapping from the logical address of the user data to the physical address. If the mapping table is damaged or lost due to some abnormal reasons, the mapping relationship between the logical address of the user data and the physical address cannot be found, and the corresponding user data cannot be found. Therefore, a method is needed to find user data even when the mapping table is lost.
  • One of the objectives of the embodiments of the present application is to provide a method, device, and computer device for rebuilding a mapping table based on a solid-state hard disk, which aims to solve the problem that the process of rebuilding the mapping table inside the SSD requires a lot of time.
  • a method for rebuilding a mapping table based on a solid state drive including:
  • Scanning starts from the last physical page of the corresponding physical block according to the request for reconstruction of the mapping table based on the solid-state hard disk;
  • mapping relationship between the logical address and the physical address is reconstructed according to the logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages.
  • a device for rebuilding a mapping table based on a solid-state hard disk including:
  • a first obtaining module is configured to obtain a request for rebuilding a mapping table based on a solid-state hard disk
  • a scanning module the scanning module is configured to scan from the last physical page of the corresponding physical block according to the solid-state hard disk-based mapping table reconstruction request;
  • An address reading module the address reading module is used to read the corresponding logical address and N logical address offsets from the data area of the current physical page, where N is a positive integer greater than 1;
  • An address calculation module configured to sequentially obtain logical addresses corresponding to N adjacent pages according to the logical address corresponding to the current physical page and the N logical address offsets;
  • the mapping reconstruction module is configured to reconstruct the mapping relationship between the logical address and the physical address according to the logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages.
  • a computer device including a memory, a processor, and a computer program stored in the memory and capable of running on the processor.
  • the processor executes the computer program, it implements the solid-state-based The steps of the hard disk mapping table reconstruction method.
  • a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps of the solid-state hard disk-based mapping table reconstruction method described in the first aspect are implemented.
  • the present application obtains a solid-state disk-based mapping table reconstruction request; according to the solid-state disk-based mapping table reconstruction request, the corresponding The last physical page of the physical block is scanned; the corresponding logical address and N logical address offsets are read from the data area of the current physical page, where N is a positive integer greater than 1; according to the current The logical address corresponding to the physical page and the N logical address offsets sequentially obtain the logical addresses corresponding to the N adjacent pages; the logical address is reconstructed to the physical address according to the logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages The mapping relationship.
  • This application uses the data area of the physical page in the NAND FLASH physical block to store its own logical address and the offsets of several adjacent physical pages relative to this logical address, so that when the mapping table inside the SSD is lost, the entire disk can be reduced.
  • the number of scans achieves the purpose of quickly rebuilding the mapping table.
  • FIG. 1 is a schematic flowchart of a method for rebuilding a mapping table based on a solid-state hard disk in an embodiment
  • FIG. 2 is a schematic diagram of storing logical addresses in a data area of a physical page in an embodiment
  • Figure 3 is a schematic diagram of scanning physical blocks and reconstructing a mapping table in an embodiment
  • FIG. 4 is a schematic flowchart of a method for rebuilding a mapping table based on a solid-state hard disk in another embodiment
  • FIG. 5 is a schematic flowchart of a method for rebuilding a mapping table based on a solid-state hard disk in another embodiment
  • FIG. 6 is a structural block diagram of an apparatus for rebuilding a mapping table based on a solid-state hard disk in an embodiment
  • FIG. 7 is a structural block diagram of an apparatus for rebuilding a mapping table based on a solid-state hard disk in another embodiment
  • FIG. 8 is a structural block diagram of an apparatus for rebuilding a mapping table based on a solid-state hard disk in another embodiment
  • Fig. 9 is an internal structure diagram of a computer device in an embodiment.
  • NAND FLASH is composed of many blocks (physical blocks), and each block is composed of many physical pages.
  • Each physical page has two storage areas, a data area and a spare area.
  • the SSD firmware determines the data stored in these two areas.
  • SSD firmware stores user data in the data area; the logical address corresponding to the user data is stored in the spare area of the physical page. Due to the limited storage space of the spare area of the physical page, too much data cannot be stored.
  • the spare area of a physical page only stores the logical address corresponding to the user data stored in the physical page.
  • mapping relationship between its logical address and the physical address is established, and the mapping table is updated.
  • its logical address is written into the spare area of this physical page.
  • the firmware needs to perform a full scan of the SSD in order to rebuild the entire mapping table.
  • the full scan read each physical page of each physical block, obtain the logical address corresponding to the physical page from the spare area of the physical page, establish the mapping relationship between the logical address and the physical address, and record the mapping relationship in the mapping Table.
  • an SSD has 200 physical blocks, and each physical block has 80 physical pages.
  • this application aims to provide a solid-state hard disk-based mapping table reconstruction method that can greatly reduce the number of scans, thereby reducing the time for full-disk scans.
  • a method for rebuilding a mapping table based on a solid-state hard disk includes:
  • Step 102 Obtain a mapping table reconstruction request based on the solid-state hard disk
  • Step 104 Start scanning from the last physical page of the corresponding physical block according to the request for reconstruction of the mapping table based on the solid-state hard disk;
  • Step 106 Read the corresponding logical address and N logical address offsets from the data area of the current physical page, where N is a positive integer greater than 1.
  • Step 108 Obtain logical addresses corresponding to N adjacent pages in sequence according to the logical address corresponding to the current physical page and the N logical address offsets;
  • step 110 the mapping relationship between the logical address and the physical address is reconstructed according to the logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages.
  • the spare area of a physical page is limited in size and can only store one logical address.
  • This embodiment proposes to use the data area of the physical page to store the logical address of the current physical page and the relative logical address of the adjacent physical page to the current page. Offset, reduce the number of full-disk scans, in order to achieve the purpose of rapid reconstruction of the mapping table.
  • a request for rebuilding a mapping table based on a solid state disk is obtained, and scanning is started from the last physical page of the corresponding physical block according to the request.
  • the logical address stored in this physical page is obtained by scanning the physical page, and the logical addresses stored in several adjacent physical pages are also obtained. In this way, not only the logical address corresponding to the current physical address is found, but also the logical address corresponding to the adjacent physical address is found, and multiple mapping relationships are established. There is no need to scan several adjacent physical pages, which reduces the number of scans. Due to the limited storage space of the spare area of the physical page, only one logical address can be stored, which obviously cannot meet the demand.
  • the data area of a physical page has a large space, which can store the logical address of the current page and the offset of its adjacent page relative to the logical address of the current page.
  • the logical address of the current page plus the offset is equal to the logical address of the adjacent page , In this way, the logical addresses of the current page and adjacent pages are obtained at one time. It has achieved the purpose of reducing the number of full scans and quickly rebuilding the mapping table.
  • the step of sequentially obtaining the logical addresses corresponding to the N adjacent pages according to the logical address corresponding to the current physical page and the N logical address offsets further includes: respectively calculating the logical address and the N logical addresses corresponding to the current physical page The sum of the address offsets sequentially obtains the logical addresses corresponding to the N adjacent pages.
  • the data area of each physical page stores 1 logical address and 7 offsets as an example for detailed description.
  • the offset of the logical address of the user data stored in the last 7 physical pages of the physical page relative to the current logical address is also the same in the order of the physical page.
  • the current physical page stores 1 logical address and 7 offsets: the logical address corresponding to the current physical page and the logical address of the last 7 physical pages next to this physical page are converted to the offset relative to the logical address of the current page. Shift.
  • the physical page 7 of a certain physical block not only stores its own corresponding logical address 39, but also stores the offset 29,-of the physical page 6 to the physical page 0 relative to the logical address 37 in turn. 7 offsets such as 24, 28, 2, 18, -37, -34, etc.
  • the actual logical addresses of physical page 6 to physical page 0 are 68, 15, 67, 41, 57, 2, 5, etc., respectively.
  • the logical address of the current page plus the offset of the adjacent page is equal to the actual logical address of the adjacent page.
  • mapping table If the mapping table is lost, a full scan is required to restore the mapping table. Scanning from the last physical page of each physical block, every time a physical page is scanned, 1 logical address and 7 offsets will be obtained.
  • the logical address is the logical address corresponding to the current physical page, and the 7 offsets are The offset of the current page to the next 7 pages.
  • the logical address plus the offset is equal to the logical address of the next 7 pages.
  • the mapping relationship of 8 logical addresses to physical addresses is established, and 8 pages are moved backward from the current physical page as the next scan page.
  • Figure 3. In this way, the number of scans is only 1/8 of the general method.
  • mapping table reconstruction request by obtaining the mapping table reconstruction request based on the solid-state hard disk; according to the mapping table reconstruction request based on the solid-state hard disk, scanning starts from the last physical page of the corresponding physical block; reading the corresponding data area from the current physical page Logical address and N logical address offsets, where N is a positive integer greater than 1. According to the logical address corresponding to the current physical page and the N logical address offsets, the logical addresses corresponding to N adjacent pages are obtained in turn; according to The logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages reconstruct the mapping relationship between the logical address and the physical address.
  • a solid-state hard disk-based mapping table reconstruction method is provided, and the method includes:
  • Step 402 Obtain a mapping table reconstruction request based on the solid-state hard disk
  • Step 404 scanning starts from the last physical page of the corresponding physical block according to the request for reconstruction of the mapping table based on the solid-state hard disk;
  • Step 406 Read the corresponding logical address and N logical address offsets from the data area of the current physical page, where N is a positive integer greater than 1.
  • Step 408 Obtain logical addresses corresponding to N adjacent pages in sequence according to the logical address corresponding to the current physical page and the N logical address offsets;
  • Step 410 reconstruct the mapping relationship between the logical address and the physical address according to the logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages;
  • Step 412 Move N+1 pages backward from the current physical page as the next physical page to be scanned.
  • mapping table if the mapping table is lost, a full scan is required to restore the mapping table. Scanning from the last physical page of each physical block, every time a physical page is scanned, one logical address and N offsets will be obtained.
  • the logical address is the logical address corresponding to the current physical page, and the N offsets are The offset of the current page to the next N pages.
  • the logical address plus the offset is equal to the logical address of the next N pages.
  • N+1 logical addresses and physical addresses is established.
  • move N+1 pages backward from the current physical page as the next scanned page which greatly reduces the number of scanning physical pages.
  • a method for rebuilding a mapping table based on a solid state drive Before the step of obtaining a request for rebuilding a mapping table based on a solid state drive, the method further includes:
  • Step 502 Obtain a write request for user data
  • Step 504 When the user data is written to the physical page of a physical block, the corresponding logical address is written to the data area of the current physical page, and at the same time, the user data stored in the last N physical pages adjacent to the current physical page are sequentially stored.
  • the logical address offset of the logical address relative to the current logical address is written into the data area of the current physical page in the order of the physical page.
  • physical page 7 of a certain physical block shown in FIG. 2 not only stores its own corresponding logical address 39, but also stores the offset of physical page 6 to physical page 0 relative to logical address 37 in turn. 7 offsets such as 29, -24, 28, 2, 18, -37, -34.
  • the actual logical addresses of physical page 6 to physical page 0 are 68, 15, 67, 41, 57, 2, 5, etc., respectively.
  • the logical address of the current page plus the offset of the adjacent page is equal to the actual logical address of the adjacent page.
  • FIGS. 3-5 are displayed in sequence as indicated by the arrows, these steps are not necessarily performed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, there is no strict order for the execution of these steps, and these steps can be executed in other orders. Moreover, at least some of the steps in Figures 3-5 may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. These sub-steps or stages The execution order of is not necessarily performed sequentially, but may be performed alternately or alternately with at least a part of other steps or sub-steps or stages of other steps.
  • a solid-state hard disk-based mapping table reconstruction device 600 is provided, and the device includes:
  • the first obtaining module 601 is configured to obtain a mapping table reconstruction request based on the solid state hard disk;
  • the scanning module 602 is configured to scan from the last physical page of the corresponding physical block according to the request for reconstruction of the mapping table based on the solid-state hard disk;
  • the address reading module 603 is configured to read the corresponding logical address and N logical address offsets from the data area of the current physical page, where N is a positive integer greater than 1;
  • the address calculation module 604 is configured to sequentially obtain logical addresses corresponding to N adjacent pages according to the logical address corresponding to the current physical page and the N logical address offsets;
  • the mapping reconstruction module 605 is configured to reconstruct the mapping relationship between the logical address and the physical address according to the logical address corresponding to the current physical page and the logical address corresponding to the N adjacent pages.
  • a device 600 for rebuilding a mapping table based on a solid-state hard disk is provided, and the device further includes:
  • the jump module 606 is used to move N+1 pages backward from the current physical page as the next physical page to be scanned.
  • an apparatus 600 for rebuilding a mapping table based on a solid-state hard disk is provided, and the apparatus further includes:
  • the second obtaining module 607 is used to obtain a write request of user data
  • the writing module 608 is used to write the corresponding logical address to the data area of the current physical page when user data is written to the physical page of a physical block, and at the same time sequentially store the last N physical pages adjacent to the current physical page The logical address offset of the logical address of the user data relative to the current logical address is written into the data area of the current physical page in the order of the physical page.
  • the address calculation module 604 is also used to:
  • the sum of the logical address corresponding to the current physical page and the offsets of the N logical addresses is calculated respectively, and the logical addresses corresponding to the N adjacent pages are sequentially obtained.
  • a computer device is provided, and its internal structure diagram may be as shown in FIG. 9.
  • the computer equipment includes a processor, a memory, and a network interface connected through a device bus.
  • the processor of the computer device is used to provide calculation and control capabilities.
  • the memory of the computer device includes a non-volatile storage medium and an internal memory.
  • the non-volatile storage medium stores an operating device, a computer program, and a database.
  • the internal memory provides an environment for the operation of the operating device and the computer program in the non-volatile storage medium.
  • the network interface of the computer device is used to communicate with an external terminal through a network connection.
  • the computer program is executed by the processor to realize a solid-state hard disk-based mapping table reconstruction method.
  • FIG. 9 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied.
  • the specific computer device may Including more or fewer parts than shown in the figure, or combining some parts, or having a different arrangement of parts.
  • a computer device which includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and the processor implements the steps in each of the above method embodiments when the processor executes the computer program.
  • a computer-readable storage medium on which a computer program is stored, and the computer program is executed by a processor to implement the steps in the above method embodiments.
  • Non-volatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory.
  • Volatile memory may include random access memory (RAM) or external cache memory.
  • RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous chain Channel (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本申请公开了一种基于固态硬盘的映射表重建方法、装置和计算机设备，所述方法包括：获取基于固态硬盘的映射表重建请求；根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。本申请实现了当SSD内部映射表丢失时，可以减少全盘扫描的次数，达到快速重建映射表的目的。

Description

基于固态硬盘的映射表重建方法、装置和计算机设备
本申请要求于2019年9月23日在中国专利局提交的、申请号为201910899968.5、发明名称为“基于固态硬盘的映射表重建方法、装置和计算机设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及固态硬盘技术领域，具体涉及一种基于固态硬盘的映射表重建方法、装置和计算机设备。
背景技术
目前，在SSD(固态硬盘)内部，逻辑地址空间到物理地址空间的映射，形成映射表。映射表的每一个映射关系都记录了用户数据的逻辑地址到物理地址的映射。若因为一些异常原因，映射表遭到破坏或者丢失，用户数据的逻辑地址到物理地址的映射关系找不到了，也就无法找到相应的用户数据了。因此，需要一种方法在映射表丢失的情况下也可以找到用户数据。
在传统技术中，为了在映射表丢失的情况下也可以找到用户数据，在写用户数据时，会把用户数据的逻辑地址记录在物理页的spare(备用)区域。若映射表丢失，则通过扫描读取物理页的spare区域，获取逻辑地址信息，重新建立了逻辑地址与物理地址的映射关系，待扫描完整的SSD，则建立起完整的映射表。由此可见，按照传统的方法，需要扫描整个SSD读取每一个物理块的每一物理页数据，假设一个SSD有200个物理块，每个物理块有80个物理页，每一个物理页的spare区只存储一个逻辑地址，全盘扫描总共需要读取200*80＝16000次，读取的次数越多花费的时间越多，导致重新建立映射表的过程需要耗费大量的时间。
发明概述
技术问题
本申请实施例的目的之一在于：提供一种基于固态硬盘的映射表重建方法、装置和计算机设备，旨在解决在SSD内部重新建立映射表的过程需要耗费大量时间的问题。
问题的解决方案
技术解决方案
为解决上述技术问题，本申请实施例采用的技术方案是：
第一方面，提供了一种基于固态硬盘的映射表重建方法，包括：
获取基于固态硬盘的映射表重建请求；
根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；
根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
第二方面，提供了一种基于固态硬盘的映射表重建装置，包括：
第一获取模块，所述第一获取模块用于获取基于固态硬盘的映射表重建请求；
扫描模块，所述扫描模块用于根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
地址读取模块，所述地址读取模块用于从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；
地址计算模块，所述地址计算模块用于根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
映射重建模块，所述映射重建模块用于根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
第三方面，提供一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现第一方面所述的基于固态硬盘的映射表重建方法的步骤。
第四方面，提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现第一方面所述的基于固态硬盘的映射表重建方法的 步骤。
本申请实施例提供的基于固态硬盘的映射表重建方法、装置和计算机设备的有益效果在于：本申请通过获取基于固态硬盘的映射表重建请求；根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。本申请通过利用NAND FLASH物理块中物理页的data区域存储它本身逻辑地址以及邻近几个物理页相对此逻辑地址的偏移量的方法，实现了当SSD内部的映射表丢失时，可以减少全盘扫描的次数，达到快速重建映射表的目的。
发明的有益效果
对附图的简要说明
附图说明
图1为一个实施例中基于固态硬盘的映射表重建方法的流程示意图；
图2为一个实施例中物理页data区存储逻辑地址的示意图；
图3为一个实施例中对物理块进行扫描并重建映射表的示意图；
图4为另一个实施例中基于固态硬盘的映射表重建方法的流程示意图；
图5为再一个实施例中基于固态硬盘的映射表重建方法的流程示意图；
图6为一个实施例中基于固态硬盘的映射表重建装置的结构框图；
图7为另一个实施例中基于固态硬盘的映射表重建装置的结构框图；
图8为再一个实施例中基于固态硬盘的映射表重建装置的结构框图；
图9为一个实施例中计算机设备的内部结构图。
发明实施例
本发明的实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以 解释本申请，并不用于限定本申请。
NAND FLASH是由许多block(物理块)组成，每一个block都有许多物理页组成。每个物理页都有两个存储区域，data(数据)区域和spare(备用)区域，由SSD固件决定这两个区域存储的数据。一般情况下，SSD固件会把用户数据存储在data区；而该用户数据对应的逻辑地址存储在物理页的spare区域。由于物理页的spare区存储空间大小有限，不能存放过多数据。通常情况下，物理页的spare区域只存放存储在该物理页内的用户数据对应的逻辑地址。
在传统技术中，当用户数据写入某一物理块的物理页时，就建立起它的逻辑地址到物理地址的映射关系，更新了映射表。同时，它的逻辑地址写入这个物理页的spare区。但因为异常情况，SSD内部的映射表丢失，固件需要对SSD进行全盘扫描以期望重建整个映射表。进行全盘扫描期间，读取每一个物理块的每一个物理页，从物理页的spare区域获得该物理页对应的逻辑地址，建立逻辑地址和物理地址之间的映射关系，把映射关系记录在映射表中。当全盘扫描结束，所有的映射关系都被建立起来了，映射表重建完成。例如：假设一个SSD有200个物理块，每个物理块有80个物理页，按照传统的做法，每一个物理页的spare区只存储一个逻辑地址，全盘扫描总共需要读取200*80＝16000次，读取的次数越多花费的时间越多。
鉴于上述传统技术中存在的问题，本申请旨在提供一个基于固态硬盘的映射表重建方法，可以实现大幅度减少扫描次数，以此减小全盘扫描的时间。
在一个实施例中，如图1所示，提供了一种基于固态硬盘的映射表重建方法，该方法包括：
步骤102，获取基于固态硬盘的映射表重建请求；
步骤104，根据基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
步骤106，从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，N为大于1的正整数；
步骤108，根据当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
步骤110，根据当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
在本实施例中，针对物理页的spare区域空间大小有限，只够存储一个逻辑地址，本实施例提出了利用物理页的data区域存储当前物理页的逻辑地址和邻近物理页相对当前页逻辑地址的偏移量，减少全盘扫描次数，以达到快速重建映射表的目的。
具体地，首先获取基于固态硬盘的映射表重建请求，并根据该请求从对应物理块的最后一个物理页开始进行扫描。接着，通过扫描该物理页获取了这个物理页存储的逻辑地址的同时一并获取它邻近的几个物理页存储的逻辑地址。这样，不但找到了当前物理地址对应的逻辑地址，也找到了邻近的物理地址对应的逻辑地址，建立起了多个映射关系，不需要扫描邻近的几个物理页了，减少了扫描的次数。由于物理页的spare区域存储空间有限，只能存储一个逻辑地址，显然满足不了需求。相对的，物理页的data区域空间很大，可以存储当前页的逻辑地址和其邻近页相对当前页的逻辑地址的偏移量，当前页的逻辑地址加上偏移量等于邻近页的逻辑地址，这样就一次性地获得了当前页和邻近页的逻辑地址。达到了减少全盘扫描的次数，快速重建映射表的目的。
在一个实施例中，根据当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址的步骤还包括：分别计算当前物理页对应的逻辑地址与N个逻辑地址偏移量之和，依次得到N个邻近页对应的逻辑地址。
具体地，以每个物理页data区域存储1个逻辑地址和7个偏移量为例进行详细说明，当用户数据写入到NAND FLASH某一物理块的物理页时，它的逻辑地址写入到该物理页的data区域，同时在这个物理块内，紧挨着这个物理页的后7个物理页存储的用户数据的逻辑地址相对当前逻辑地址的偏移量按照物理页的前后顺序也一并写入当前这个物理页的data区域。这样当前的物理页存储了1个逻辑地址和7个偏移量：当前物理页对应的逻辑地址和紧挨着这个物理页的后7个物理页的逻辑地址转换为相对当前页逻辑地址的偏移量。如图2所示，某一物理块的物理页7不但存储了它自身对应的逻辑地址39，还依次向后存储了物理页6～物理页0相对于逻辑地址37的偏移量29、-24、28、2、18、-37、-34等7个偏移量。 物理页6～物理页0实际的逻辑地址分别是68、15、67、41、57、2、5等。当前页的逻辑地址加上邻近页偏移量就等于邻近页实际逻辑地址。
若映射表丢失了，需要全盘扫描来恢复映射表。从每一个物理块的最后一个物理页进行扫描，每扫描到一个物理页，会得到1个逻辑地址和7个偏移量，逻辑地址是当前物理页对应的逻辑地址，7个偏移量是当前页向后7页的偏移量。逻辑地址加上偏移量就等于后7页的逻辑地址。这样建立了8个逻辑地址到物理地址的映射关系，从当前物理页向后移动8页作为下一次的扫描页。如图3所示。这样扫描次数仅仅是一般方法的1/8。还是假设一个SSD有200个物理块，每个物理块有80个物理页，每个物理块只需扫描80/8＝10次，整个SSD扫描200*10＝2000次，远小于一般方法的16000次。扫描次数减少了，全盘扫描时间也相应减少了。
在上述实施例中，通过获取基于固态硬盘的映射表重建请求；根据基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，N为大于1的正整数；根据当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；根据当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。本实施例通过利用NAND FLASH物理块中物理页的data区域存储它本身逻辑地址以及邻近几个物理页相对此逻辑地址的偏移量的方法，实现了当SSD内部的映射表丢失时，可以减少全盘扫描的次数，达到快速重建映射表的目的。
在一个实施例中，如图3所示，提供了一种基于固态硬盘的映射表重建方法，该方法包括：
步骤402，获取基于固态硬盘的映射表重建请求；
步骤404，根据基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
步骤406，从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，N为大于1的正整数；
步骤408，根据当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N 个邻近页对应的逻辑地址；
步骤410，根据当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系；
步骤412，从当前物理页向后移动N+1页作为下一次进行扫描的物理页。
在本实施例中，若映射表丢失了，需要全盘扫描来恢复映射表。从每一个物理块的最后一个物理页进行扫描，每扫描到一个物理页，会得到1个逻辑地址和N个偏移量，逻辑地址是当前物理页对应的逻辑地址，N个偏移量是当前页向后N页的偏移量。逻辑地址加上偏移量就等于后N页的逻辑地址。这样建立了N+1个逻辑地址到物理地址的映射关系。最后，从当前物理页向后移动N+1页作为下一次的扫描页，大大的减少了对物理页扫描的次数。
具体地，例如图3中所示的扫描次数仅仅是传统方法的1/8。假设一个SSD有200个物理块，每个物理块有80个物理页，每个物理块只需扫描80/8＝10次，整个SSD扫描200*10＝2000次，远小于一般方法的16000次。扫描次数减少了，全盘扫描时间也相应减少了。
在一个实施例中，如图5所示，提供了一种基于固态硬盘的映射表重建方法，该方法在在获取基于固态硬盘的映射表重建请求的步骤之前还包括：
步骤502，获取用户数据的写入请求；
步骤504，当用户数据写入到一物理块的物理页时，将对应的逻辑地址写入到当前物理页的data区域，同时依次将邻近当前物理页的后N个物理页存储的用户数据的逻辑地址相对当前逻辑地址的逻辑地址偏移量按照物理页的前后顺序一并写入当前物理页的data区域。
在本实施例中，当用户数据写入到NAND FLASH某一物理块的物理页时，它的逻辑地址写入到该物理页的data区域，同时在这个物理块内，紧挨着这个物理页的后N个物理页存储的用户数据的逻辑地址相对当前逻辑地址的偏移量按照物理页的前后顺序也一并写入当前这个物理页的data区域。这样当前的物理页存储了1个逻辑地址和N个偏移量：当前物理页对应的逻辑地址和紧挨着这个物理页的后N个物理页的逻辑地址转换为相对当前页逻辑地址的偏移量。
具体地，例如图2中所示的某一物理块的物理页7不但存储了它自身对应的逻辑 地址39，还依次向后存储了物理页6～物理页0相对于逻辑地址37的偏移量29、-24、28、2、18、-37、-34等7个偏移量。物理页6～物理页0实际的逻辑地址分别是68、15、67、41、57、2、5等。当前页的逻辑地址加上邻近页偏移量就等于邻近页实际逻辑地址。
应该理解的是，虽然图3-5的流程图中的各个步骤按照箭头的指示依次显示，但是这些步骤并不是必然按照箭头指示的顺序依次执行。除非本文中有明确的说明，这些步骤的执行并没有严格的顺序限制，这些步骤可以以其他的顺序执行。而且，图3-5中的至少一部分步骤可以包括多个子步骤或者多个阶段，这些子步骤或者阶段并不必然是在同一时刻执行完成，而是可以在不同的时刻执行，这些子步骤或者阶段的执行顺序也不必然是依次进行，而是可以与其他步骤或者其他步骤的子步骤或者阶段的至少一部分轮流或者交替地执行。
在一个实施例中，如图6所示，提供了一种基于固态硬盘的映射表重建装置600，该装置包括：
第一获取模块601，用于获取基于固态硬盘的映射表重建请求；
扫描模块602，用于根据基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
地址读取模块603，用于从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，N为大于1的正整数；
地址计算模块604，用于根据当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
映射重建模块605，用于根据当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
在一个实施例中，如图7所示，提供了一种基于固态硬盘的映射表重建装置600，该装置还包括：
跳转模块606，用于从当前物理页向后移动N+1页作为下一次进行扫描的物理页。
在一个实施例中，如图8所示，提供了一种基于固态硬盘的映射表重建装置600，该装置还包括：
第二获取模块607，用于获取用户数据的写入请求；
写入模块608，用于当用户数据写入到一物理块的物理页时，将对应的逻辑地址写入到当前物理页的data区域，同时依次将邻近当前物理页的后N个物理页存储的用户数据的逻辑地址相对当前逻辑地址的逻辑地址偏移量按照物理页的前后顺序一并写入当前物理页的data区域。
在一个实施例中，地址计算模块604还用于：
分别计算当前物理页对应的逻辑地址与N个逻辑地址偏移量之和，依次得到N个邻近页对应的逻辑地址。
关于基于固态硬盘的映射表重建装置的具体限定可以参见上文中对于基于固态硬盘的映射表重建方法的限定，在此不再赘述。
在一个实施例中，提供了一种计算机设备，其内部结构图可以如图9所示。该计算机设备包括通过装置总线连接的处理器、存储器以及网络接口。其中，该计算机设备的处理器用于提供计算和控制能力。该计算机设备的存储器包括非易失性存储介质、内存储器。该非易失性存储介质存储有操作装置、计算机程序和数据库。该内存储器为非易失性存储介质中的操作装置和计算机程序的运行提供环境。该计算机设备的网络接口用于与外部的终端通过网络连接通信。该计算机程序被处理器执行时以实现一种基于固态硬盘的映射表重建方法。
本领域技术人员可以理解，图9中示出的结构，仅仅是与本申请方案相关的部分结构的框图，并不构成对本申请方案所应用于其上的计算机设备的限定，具体的计算机设备可以包括比图中所示更多或更少的部件，或者组合某些部件，或者具有不同的部件布置。
在一个实施例中，提供了一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，处理器执行计算机程序时实现以上各个方法实施例中的步骤。
在一个实施例中，提供了一种计算机可读存储介质，其上存储有计算机程序，计算机程序被处理器执行时实现以上各个方法实施例中的步骤。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，是可以通过计算机程序来指令相关的硬件来完成，所述的计算机程序可存储于一非 易失性计算机可读取存储介质中，该计算机程序在执行时，可包括如上述各方法的实施例的流程。其中，本申请所提供的各实施例中所使用的对存储器、存储、数据库或其他介质的任何引用，均可包括非易失性和/或易失性存储器。非易失性存储器可包括只读存储器(ROM)、可编程ROM(PROM)、电可编程ROM(EPROM)、电可擦除可编程ROM(EEPROM)或闪存。易失性存储器可包括随机存取存储器(RAM)或者外部高速缓冲存储器。作为说明而非局限，RAM以多种形式可得，诸如静态RAM(SRAM)、动态RAM(DRAM)、同步DRAM(SDRAM)、双数据率SDRAM(DDRSDRAM)、增强型SDRAM(ESDRAM)、同步链路(Synchlink)DRAM(SLDRAM)、存储器总线(Rambus)直接RAM(RDRAM)、直接存储器总线动态RAM(DRDRAM)、以及存储器总线动态RAM(RDRAM)等。
以上实施例的各技术特征可以进行任意的组合，为使描述简洁，未对上述实施例中的各个技术特征所有可能的组合都进行描述，然而，只要这些技术特征的组合不存在矛盾，都应当认为是本说明书记载的范围。
以上所述实施例仅表达了本申请的几种实施方式，其描述较为具体和详细，但并不能因此而理解为对发明专利范围的限制。应当指出的是，对于本领域的普通技术人员来说，在不脱离本申请构思的前提下，还可以做出若干变形和改进，这些都属于本申请的保护范围。因此，本申请专利的保护范围应以所附权利要求为准。

Claims (16)

  1. 一种基于固态硬盘的映射表重建方法，其特征在于，包括：
    获取基于固态硬盘的映射表重建请求；
    根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
    从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；
    根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
    根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
  2. 根据权利要求1所述的基于固态硬盘的映射表重建方法，其特征在于，在所述根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系的步骤之后还包括：
    从所述当前物理页向后移动N+1页作为下一次进行扫描的物理页。
  3. 根据权利要求1所述的基于固态硬盘的映射表重建方法，其特征在于，在所述获取基于固态硬盘的映射表重建请求的步骤之前还包括：
    获取用户数据的写入请求；
    当所述用户数据写入到一物理块的物理页时，将对应的逻辑地址写入到当前物理页的data区域，同时依次将邻近所述当前物理页的后N个物理页存储的用户数据的逻辑地址相对当前逻辑地址的逻辑地址偏移量按照物理页的前后顺序一并写入所述当前物理页的data区域。
  4. 根据权利要求1-3任一项所述的基于固态硬盘的映射表重建方法，其特征在于，所述根据所述当前物理页对应的逻辑地址以及N个逻 辑地址偏移量依次得到N个邻近页对应的逻辑地址的步骤还包括：
    分别计算所述当前物理页对应的逻辑地址与N个逻辑地址偏移量之和，依次得到N个邻近页对应的逻辑地址。
  5. 一种基于固态硬盘的映射表重建装置，其特征在于，包括：
    第一获取模块，所述第一获取模块用于获取基于固态硬盘的映射表重建请求；
    扫描模块，所述扫描模块用于根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
    地址读取模块，所述地址读取模块用于从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；
    地址计算模块，所述地址计算模块用于根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
    映射重建模块，所述映射重建模块用于根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
  6. 根据权利要求5所述的基于固态硬盘的映射表重建装置，其特征在于，所述装置还包括：
    跳转模块，所述跳转模块用于从所述当前物理页向后移动N+1页作为下一次进行扫描的物理页。
  7. 根据权利要求5所述的基于固态硬盘的映射表重建装置，其特征在于，所述装置还包括：
    第二获取模块，所述第二获取模块用于获取用户数据的写入请求；
    写入模块，所述写入模块用于当所述用户数据写入到一物理块的物理页时，将对应的逻辑地址写入到当前物理页的data区域，同时依次将邻近所述当前物理页的后N个物理页存储的用户数据的逻辑 地址相对当前逻辑地址的逻辑地址偏移量按照物理页的前后顺序一并写入所述当前物理页的data区域。
  8. 根据权利要求5-7任一项所述的基于固态硬盘的映射表重建装置，其特征在于，所述地址计算模块还用于：
    分别计算所述当前物理页对应的逻辑地址与N个逻辑地址偏移量之和，依次得到N个邻近页对应的逻辑地址。
  9. 一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时实现如下步骤：
    获取基于固态硬盘的映射表重建请求；
    根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
    从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；
    根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
    根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
  10. 根据权利要求9所述的计算机设备，其特征在于，所述处理器执行所述计算机程序时还实现如下步骤：
    从所述当前物理页向后移动N+1页作为下一次进行扫描的物理页。
  11. 根据权利要求9所述的计算机设备，其特征在于，所述处理器执行所述计算机程序时还实现如下步骤：
    获取用户数据的写入请求；
    当所述用户数据写入到一物理块的物理页时，将对应的逻辑地址写入到当前物理页的data区域，同时依次将邻近所述当前物理页的后N个物理页存储的用户数据的逻辑地址相对当前逻辑地址的逻辑 地址偏移量按照物理页的前后顺序一并写入所述当前物理页的data区域。
  12. 根据权利要求9-11任一项所述的计算机设备，其特征在于，所述处理器执行所述计算机程序时还实现如下步骤：
    分别计算所述当前物理页对应的逻辑地址与N个逻辑地址偏移量之和，依次得到N个邻近页对应的逻辑地址。
  13. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，所述计算机程序被处理器执行时实现如下步骤：
    获取基于固态硬盘的映射表重建请求；
    根据所述基于固态硬盘的映射表重建请求从对应物理块的最后一个物理页开始进行扫描；
    从当前物理页的data区域中读取对应的逻辑地址以及N个逻辑地址偏移量，其中，所述N为大于1的正整数；
    根据所述当前物理页对应的逻辑地址以及N个逻辑地址偏移量依次得到N个邻近页对应的逻辑地址；
    根据所述当前物理页对应的逻辑地址以及N个邻近页对应的逻辑地址重建逻辑地址到物理地址的映射关系。
  14. 根据权利要求13所述的计算机可读存储介质，其特征在于，所述计算机程序被处理器执行时还实现如下步骤：
    从所述当前物理页向后移动N+1页作为下一次进行扫描的物理页。
  15. 根据权利要求13所述的计算机可读存储介质，其特征在于，所述计算机程序被处理器执行时还实现如下步骤：
    获取用户数据的写入请求；
    当所述用户数据写入到一物理块的物理页时，将对应的逻辑地址写入到当前物理页的data区域，同时依次将邻近所述当前物理页的后N个物理页存储的用户数据的逻辑地址相对当前逻辑地址的逻辑地址偏移量按照物理页的前后顺序一并写入所述当前物理页的data 区域。
  16. 根据权利要求13-15任一项所述的计算机可读存储介质，其特征在于，所述计算机程序被处理器执行时还实现如下步骤：
    分别计算所述当前物理页对应的逻辑地址与N个逻辑地址偏移量之和，依次得到N个邻近页对应的逻辑地址。
PCT/CN2020/077120 2019-09-23 2020-02-28 基于固态硬盘的映射表重建方法、装置和计算机设备 WO2021056963A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US17/043,482 US11816038B2 (en) 2019-09-23 2020-02-28 Method and apparatus of mapping table reconstruction based on SSD, and computer device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910899968.5A CN110704337B (zh) 2019-09-23 2019-09-23 基于固态硬盘的映射表重建方法、装置和计算机设备
CN201910899968.5 2019-09-23

Publications (1)

Publication Number Publication Date
WO2021056963A1 true WO2021056963A1 (zh) 2021-04-01

Family

ID=69195618

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/077120 WO2021056963A1 (zh) 2019-09-23 2020-02-28 基于固态硬盘的映射表重建方法、装置和计算机设备

Country Status (3)

Country Link
US (1) US11816038B2 (zh)
CN (1) CN110704337B (zh)
WO (1) WO2021056963A1 (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110704337B (zh) * 2019-09-23 2021-01-19 深圳忆联信息***有限公司 基于固态硬盘的映射表重建方法、装置和计算机设备
CN113971964B (zh) * 2020-07-24 2023-08-04 深圳市江波龙电子股份有限公司 一种数据恢复方法及存储设备、终端设备
CN112000591B (zh) * 2020-08-24 2023-12-05 深圳忆联信息***有限公司 可指定逻辑区块地址的扫描ssd方法、装置、计算机设备及存储介质
CN112084070B (zh) * 2020-09-21 2024-04-26 深圳佰维存储科技股份有限公司 L2p映射数据恢复方法、装置、存储介质及电子设备
CN113900589A (zh) * 2021-09-16 2022-01-07 合肥致存微电子有限责任公司 一种数据的写入方法及装置
CN116467224B (zh) * 2022-01-12 2023-10-31 联芸科技(杭州)股份有限公司 L2p映射表重建方法及固态硬盘

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103064641A (zh) * 2013-02-05 2013-04-24 威盛电子股份有限公司 非易失性存储装置及其操作方法
CN103744795A (zh) * 2013-12-19 2014-04-23 记忆科技(深圳)有限公司 固态硬盘快速启动的方法及其固态硬盘
CN103902406A (zh) * 2012-12-31 2014-07-02 杨威锋 高可靠性固态存储设备的映射表信息的保存和恢复技术
US20150261617A1 (en) * 2014-03-14 2015-09-17 Wan-soo Choi Storage device and table management method thereof
CN108733510A (zh) * 2017-04-25 2018-11-02 慧荣科技股份有限公司 数据储存装置及映射表重建方法
CN110704337A (zh) * 2019-09-23 2020-01-17 深圳忆联信息***有限公司 基于固态硬盘的映射表重建方法、装置和计算机设备

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4949326A (en) * 1986-12-10 1990-08-14 Matsushita Electric Industrial Co., Ltd. Optical information recording and reproducing system using optical disks having an error correction function
CN103699341B (zh) * 2013-12-17 2016-04-06 飞天诚信科技股份有限公司 一种向存储设备中写数据的方法
CN105224478B (zh) * 2015-09-25 2019-01-22 北京联想核芯科技有限公司 一种映射表的形成、更新和恢复方法及电子设备
JP6732684B2 (ja) * 2017-03-15 2020-07-29 キオクシア株式会社 情報処理装置、ストレージデバイスおよび情報処理システム
CN107562644B (zh) * 2017-08-11 2021-02-09 记忆科技(深圳)有限公司 一种固态硬盘映射表的压缩方法
KR102457564B1 (ko) * 2017-09-20 2022-10-21 에스케이하이닉스 주식회사 메모리 시스템 및 그것의 동작 방법
CN108153681A (zh) * 2017-11-29 2018-06-12 深圳忆联信息***有限公司 一种大容量固态硬盘映射表压缩方法
CN108804026B (zh) * 2018-03-27 2022-02-18 深圳忆联信息***有限公司 一种固态硬盘全盘扫描方法及固态硬盘

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103902406A (zh) * 2012-12-31 2014-07-02 杨威锋 高可靠性固态存储设备的映射表信息的保存和恢复技术
CN103064641A (zh) * 2013-02-05 2013-04-24 威盛电子股份有限公司 非易失性存储装置及其操作方法
CN103744795A (zh) * 2013-12-19 2014-04-23 记忆科技(深圳)有限公司 固态硬盘快速启动的方法及其固态硬盘
US20150261617A1 (en) * 2014-03-14 2015-09-17 Wan-soo Choi Storage device and table management method thereof
CN108733510A (zh) * 2017-04-25 2018-11-02 慧荣科技股份有限公司 数据储存装置及映射表重建方法
CN110704337A (zh) * 2019-09-23 2020-01-17 深圳忆联信息***有限公司 基于固态硬盘的映射表重建方法、装置和计算机设备

Also Published As

Publication number Publication date
CN110704337B (zh) 2021-01-19
US20230131779A1 (en) 2023-04-27
CN110704337A (zh) 2020-01-17
US11816038B2 (en) 2023-11-14

Similar Documents

Publication Publication Date Title
WO2021056963A1 (zh) 基于固态硬盘的映射表重建方法、装置和计算机设备
TW201108232A (en) Method and system of finding a read voltage for a flash memory
TW201019107A (en) Method for managing a memory apparatus, and associated memory apparatus thereof
US9058255B2 (en) Solid state drive and method for constructing logical-to-physical table thereof
CN110297606A (zh) 基于固态硬盘的坏块管理方法、装置和计算机设备
US20190347006A1 (en) Method of system information programming for a data storage apparatus and a corresponding method of system information re-building
CN109976664B (zh) 固态存储设备的日志数据组织
WO2024114599A1 (zh) 独立冗余磁盘阵列数据组织方法、装置、服务器和介质
CN111125002B (zh) 一种基于分布式存储的数据备份归档方法和***
CN112099996A (zh) 基于页面更新序号的数据库集群多节点重做日志恢复方法
CN111221750B (zh) 固态储存装置的数据处理方法
WO2021051746A1 (zh) 基于固态硬盘的L2P表dirty位标记方法和装置
TW201635304A (zh) 資料儲存裝置以及資料存取方法
US11907076B2 (en) Data snapshot method and apparatus, computer device, and storage medium
CN111897495B (zh) 提高ssd写性能的实现方法、装置、计算机设备及存储介质
CN110275596B (zh) 基于固态硬盘的上电初始化加速方法、装置和计算机设备
CN112596679B (zh) 固态硬盘的raid实现方法、装置、计算机设备及存储介质
US11579789B2 (en) Techniques for managing context information for a storage device
CN110888823B (zh) 页扫描效率的提升方法、装置及计算机设备
CN118312354A (zh) Ssd映射表掉电快速重建实现方法、装置和计算机设备
TWI667571B (zh) 資料儲存裝置、系統資訊編程方法及系統資訊重建方法
CN114185620B (zh) 加速ssd固件加载实现方法、装置、计算机设备及存储介质
CN117149075A (zh) 基于DRAM-less固态硬盘的RAID实现方法和装置
CN114428592B (zh) Ssd硬盘的块信息存储方法和***、ssd硬盘
CN114710441B (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: 20868886

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20868886

Country of ref document: EP

Kind code of ref document: A1

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 26.08.2022)

122 Ep: pct application non-entry in european phase

Ref document number: 20868886

Country of ref document: EP

Kind code of ref document: A1