WO2019136969A1 - 一种实体位置映到逻辑映像位置的高效能方法 - Google Patents

一种实体位置映到逻辑映像位置的高效能方法 Download PDF

Info

Publication number
WO2019136969A1
WO2019136969A1 PCT/CN2018/099745 CN2018099745W WO2019136969A1 WO 2019136969 A1 WO2019136969 A1 WO 2019136969A1 CN 2018099745 W CN2018099745 W CN 2018099745W WO 2019136969 A1 WO2019136969 A1 WO 2019136969A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
record
mapping
location
invalid
Prior art date
Application number
PCT/CN2018/099745
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 江苏华存电子科技有限公司
Publication of WO2019136969A1 publication Critical patent/WO2019136969A1/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/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

Definitions

  • the present invention relates to the field of storage technologies, and in particular, to a high-performance method for mapping physical locations to logical image locations.
  • Flash memory is a long-lived non-volatile memory that retains stored data information in the event of a power outage. Data deletion is not in a single byte but in a fixed block. The block size is typically 256KB to 20MB. Flash memory is a variant of electronically erasable read-only memory (EEPROM). Unlike flash memory, EEPROM can be erased and rewritten at the byte level instead of the entire chip eraser, while most chips in flash require a block erase. except. Since it can still save data when it is powered off, flash memory is usually used to save setup information, such as saving data in the computer's BIOS (basic program), PDA (personal digital assistant), digital camera, etc.; flash memory is moving toward large capacity and low The development of power consumption and low cost.
  • BIOS basic program
  • PDA personal digital assistant
  • the flash memory has high read/write speed and low power consumption.
  • the flash hard disk that is, the SSD hard disk, has appeared on the market, and the cost performance of the hard disk is further improved. As manufacturing processes increase and costs decrease, flash memory will appear more in everyday life.
  • Flash memory is a non-disappearing memory device.
  • the flash memory stores one bit from a memory unit, the number of erasing times is 100,000 times, and the evolution to a memory unit stores two bits, and the number of erasing times is 5,000 to 10,000 times, to the newly proposed memory. Three bits are stored in the unit, and the number of times of erasing is 1000 times. New flash memory is introduced, with reduced lifetime and reduced lifetime resulting in increased error bit rates. Therefore, it is an important issue to increase the correctness of data.
  • the flash itself has the feature of being unrepeatable, and can be written again after being erased.
  • the host side continuously updates the data, because the location of the written data cannot be repeatedly written, the data stored in the flash memory is somewhat effective. Then becomes invalid.
  • the mapping table can be used to record the location of the flash entity to the logical image location, and it can be known which content is currently valid in the flash entity location, and what content is The update becomes invalid.
  • garbage collection In flash storage devices, there is a mechanism called garbage collection.
  • the old flash blocks that store data contain valid and invalid data.
  • Garbage collection refers to sorting valid data from the old flash blocks that store data to new flash blocks. And can erase the old flash blocks that store data, and become available space for other operations.
  • the way to query the image table is to search the entire table from the beginning according to the logical image position recorded in each flash entity block, and Determine whether the logical image location data is valid, to determine which location of the flash physical block is currently the latest data.
  • the query image table needs to visit each record from scratch, including records of valid and invalid data, and then determine which locations are the most recent.
  • This patent proposes an improvement. Search for the efficiency of the mapping table to speed up the search.
  • a high-performance method for mapping an entity location to a logical image location including the following steps:
  • the host side updates the data
  • the mapping table records information from the record A to the record L, wherein the valid data and the invalid data exist; when searching, the content is searched from the beginning in a row, starting from the record A, followed by the record. B, record C, record sequentially, and finally to record L.
  • the mapping table is also split into a plurality of nodes by using a linked list, and each node represents a small mapping table; the information recorded in the links is linked according to the order in which the data is written to the flash entity locations, and the information recorded in the links is Is valid data; when a record becomes invalid, it will be removed from the link. Ensure that the information in the link maintains valid data.
  • the image table stores the data of the logical image position; when the host updates the data, the image table records the physical location of the latest data in the flash memory, Ability to speed up the search.
  • Figure 1 is a flow chart of the present invention
  • FIG. 2 is a schematic diagram of a data search sequence according to an embodiment of the present invention.
  • FIG. 3 is a flow chart of using a linked list method in the present invention.
  • FIG. 4 is another schematic diagram of a data search sequence according to an embodiment of the present invention.
  • the present invention provides the following technical solution: a high-performance method for mapping an entity location to a logical image location, including the following steps:
  • the host side updates the data
  • the information from the record A to the record L is recorded in the map, in which valid data and invalid data are present; when searching, the content is searched in order from the beginning, from the record A. Start, then record B, record C, record backwards, and finally to record L. Analyze which locations have valid data.
  • the map table is also split into a plurality of nodes by using a linked list, and each node represents a small mapping table; the data is written in the order in which the data is written to the location of the flash entity.
  • the information recorded in the link is valid data; when a record becomes invalid, it will be removed from the link. Ensure that the information in the link maintains valid data; the specific steps are as follows:
  • the host side updates the data
  • the invalid data in FIG. 2 is record B, record C and record K, and these pieces of data will be removed from the link. Therefore, the search order will become record A, record D. , record E.... to record L; in the same example, Figure 2 and Figure 4 are similarly done when searching for valid data, the way of Figure 4 will become more efficient.
  • the image of the logical image location is stored in the image table; when the host updates the data, the image table records the physical location of the latest data in the flash memory, thereby speeding up the search time.

Abstract

本发明公开了一种实体位置映到逻辑映像位置的高效能方法，包括如下步骤：A、主机端更新数据；B、在映像表中更新此笔数据的纪录；C、判断是否因为更新产生无效记录；D、在映像表中标记无效记录；映像表中存放着逻辑映像位置的数据；当主机更新资料的时候，映像表会记录最新数据在闪存的哪个实体位置，因此能够加速搜寻的时间。

Description

一种实体位置映到逻辑映像位置的高效能方法 技术领域
本发明涉及存储技术领域，具体为一种实体位置映到逻辑映像位置的高效能方法。
背景技术
闪存是一种长寿命的非易失性(在断电情况下仍能保持所存储的数据信息)的存储器，数据删除不是以单个的字节为单位而是以固定的区块为单位，区块大小一般为256KB到20MB。闪存是电子可擦除只读存储器(EEPROM)的变种，闪存与EEPROM不同的是，EEPROM能在字节水平上进行删除和重写而不是整个芯片擦写，而闪存的大部分芯片需要块擦除。由于其断电时仍能保存数据，闪存通常被用来保存设置信息，如在电脑的BIOS(基本程序)、PDA(个人数字助理)、数码相机中保存资料等；闪存正朝大容量、低功耗、低成本的方向发展。与传统硬盘相比，闪存的读写速度高、功耗较低，市场上已经出现了闪存硬盘，也就是SSD硬盘，该硬盘的性价比进一步提升。随着制造工艺的提高、成本的降低，闪存将更多地出现在日常生活之中。
闪存为非消失性的存储器装置，闪存从一个存储器单元里存放一比特，擦写次数10万次，演进到一个存储器单元里存放二比特，擦写次数5000到10000次，到最新提出的一个存储器单元里存放三比特，擦写次数1000次。新的闪存推出，使用寿命减少，寿命减少会导致错误比特发生率提高。因此能增加数据正确性，成为一个重要的议题。
闪存本身存在无法复写的特性，需要被抹除之后才能再次写入.当主机端持续更新数据，因为写入数据的位置无法被重复写入，所以闪存内存储的数据，有些是有效的，有些则变成无效的.在存储装置中存在着闪存转换层，可以利用映像表记录闪存实体位置对映到逻辑映像位置，且可以知道在闪存实体位置中，哪些内容目前是有效的，哪些内容因为更新而变成无效。
闪存存储装置中，存在一种机制叫垃圾回收.旧有存放数据的闪存块中包含有效与无效数据，垃圾回收指的是把有效数据从旧有存放数据的闪存块整理到新的闪存块中，并可以对旧有存放数据的闪存块做抹除动作，变成可用空间供其他操作使用.查询映像表的方式为根据每一个闪存实体块中记录的逻辑映像位置从头搜寻整份表，并判断此笔逻辑映像位置数据是否为有效，来决定目前最新的资料是存放在闪存实体块的哪一个位置。
查询映像表需要从头拜访每一笔记录，包含有效与无效数据的纪录，然后决定出哪些位置内的数据是最新的.但是每一笔记录都搜寻的方式效率不高，因此本专利提出一个提升搜寻映射表效率的方法，加速搜寻的时间。
发明内容
本发明的目的在于提供一种实体位置映到逻辑映像位置的高效能方法，以解决上述背景技术中提出的问题。
为实现上述目的，本发明提供如下技术方案：一种实体位置映到逻辑映像位置的高效能方法，包括如下步骤：
A、主机端更新数据；
B、在映像表中更新此笔数据的纪录；
C、判断是否因为更新产生无效记录；
D、在映像表中标记无效记录。
优选的，所述映像表中记录着从记录A到记录L的信息，其中存在有效数据与无效数据；搜寻的时候，会从头按照顺序一笔一笔搜寻内容，从记录A开始，接着是记录B，记录C，依次往后记录，最后到记录L。
优选的，还采用链表的方式，把映像表拆成多个节点，每个节点都代表着一个小的映射表；依数据写入闪存实体位置的顺序作链结，链结内记录的信息都是有效数据；当某一笔记录变成无效，将从链结中拿掉.，确保链结中的信息都维持有效数据。
与现有技术相比，本发明的有益效果是：本发明中，映像表中存放着逻辑映像位置的数据；当主机更新资料的时候，映像表会记录最新数据在闪存的哪个实体位置，因此能够加速搜寻的时间。
附图说明
图1为本发明流程图；
图2为本发明实施例数据搜寻顺序示意图；
图3为本发明中利用链表方式的流程；
图4为本发明实施例数据搜寻顺序另一示意图。
具体实施方式
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。
请参阅图1，本发明提供如下技术方案：一种实体位置映到逻辑映像位置的高效能方法，包括如下步骤：
A、主机端更新数据；
B、在映像表中更新此笔数据的纪录；
C、判断是否因为更新产生无效记录；
D、在映像表中标记无效记录。
本发明中，如图2所示，映像表中记录着从记录A到记录L的信息，其中存在有效数据与无效数据；搜寻的时候，会从头按照顺序一笔一笔搜寻内容，从记录A开始，接着是记录B，记录C，依次往后记录，最后到记录L。分析出哪些位置存在有效数据。
本发明中，如图3所示，还采用链表的方式，把映像表拆成多个节点，每个节点都代表着一个小的映射表；依数据写入闪存实体位置的顺序作链结， 链结内记录的信息都是有效数据；当某一笔记录变成无效，将从链结中拿掉.，确保链结中的信息都维持有效数据；具体步骤如下：
A、主机端更新数据；
B、在链表中链结此笔数据的纪录；
C、判断是否因为更新产生无效记录；
D、把无效记录从链表中删除。
如图4所示，图2中的无效数据分别为记录B,记录C和记录K，这几笔资料将会从链结中被拿掉，因此，搜寻的顺序将变成记录A，记录D，记录E….到记录L；同一个例子中，图2与图4同样做当搜寻有效数据的时候，图4的方式将变得更有效率。
综上所述，本发明中，映像表中存放着逻辑映像位置的数据；当主机更新资料的时候，映像表会记录最新数据在闪存的哪个实体位置，因此能够加速搜寻的时间。
尽管已经示出和描述了本发明的实施例，对于本领域的普通技术人员而言，可以理解在不脱离本发明的原理和精神的情况下可以对这些实施例进行多种变化、修改、替换和变型，本发明的范围由所附权利要求及其等同物限定。

Claims (3)

  1. 一种实体位置映到逻辑映像位置的高效能方法，其特征在于：包括如下步骤：
    A、主机端更新数据；
    B、在映像表中更新此笔数据的纪录；
    C、判断是否因为更新产生无效记录；
    D、在映像表中标记无效记录。
  2. 根据权利要求1所述的一种实体位置映到逻辑映像位置的高效能方法，其特征在于：所述映像表中记录着从记录A到记录L的信息，其中存在有效数据与无效数据；搜寻的时候，会从头按照顺序一笔一笔搜寻内容，从记录A开始，接着是记录B，记录C，依次往后记录，最后到记录L。
  3. 根据权利要求1所述的一种实体位置映到逻辑映像位置的高效能方法，其特征在于：还采用链表的方式，把映像表拆成多个节点，每个节点都代表着一个小的映射表；依数据写入闪存实体位置的顺序作链结，链结内记录的信息都是有效数据；当某一笔记录变成无效，将从链结中拿掉.，确保链结中的信息都维持有效数据。
PCT/CN2018/099745 2018-01-12 2018-08-09 一种实体位置映到逻辑映像位置的高效能方法 WO2019136969A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810030686.7 2018-01-12
CN201810030686.7A CN108197040A (zh) 2018-01-12 2018-01-12 一种实体位置映到逻辑映像位置的高效能方法

Publications (1)

Publication Number Publication Date
WO2019136969A1 true WO2019136969A1 (zh) 2019-07-18

Family

ID=62588958

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/099745 WO2019136969A1 (zh) 2018-01-12 2018-08-09 一种实体位置映到逻辑映像位置的高效能方法

Country Status (2)

Country Link
CN (1) CN108197040A (zh)
WO (1) WO2019136969A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108197040A (zh) * 2018-01-12 2018-06-22 江苏华存电子科技有限公司 一种实体位置映到逻辑映像位置的高效能方法
CN108959121A (zh) * 2018-07-20 2018-12-07 江苏华存电子科技有限公司 一种利用虚拟闪存块表提升闪存快速回拷方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101174231A (zh) * 2006-11-03 2008-05-07 英业达股份有限公司 快照备份方法
US20080282024A1 (en) * 2007-05-09 2008-11-13 Sudeep Biswas Management of erase operations in storage devices based on flash memories
CN104268094A (zh) * 2014-09-23 2015-01-07 浪潮电子信息产业股份有限公司 一种优化的闪存地址映射方法
CN107346211A (zh) * 2016-05-06 2017-11-14 合肥兆芯电子有限公司 映射表加载方法、内存控制电路单元与内存储存装置
CN108197040A (zh) * 2018-01-12 2018-06-22 江苏华存电子科技有限公司 一种实体位置映到逻辑映像位置的高效能方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104536906B (zh) * 2011-08-02 2017-10-10 群联电子股份有限公司 数据写入方法、存储器控制器与存储器储存装置
US8862858B1 (en) * 2012-09-28 2014-10-14 Emc Corporation Method and system for fast block storage recovery
CN106886370B (zh) * 2017-01-24 2019-12-06 华中科技大学 一种基于ssd去重技术的数据安全删除方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101174231A (zh) * 2006-11-03 2008-05-07 英业达股份有限公司 快照备份方法
US20080282024A1 (en) * 2007-05-09 2008-11-13 Sudeep Biswas Management of erase operations in storage devices based on flash memories
CN104268094A (zh) * 2014-09-23 2015-01-07 浪潮电子信息产业股份有限公司 一种优化的闪存地址映射方法
CN107346211A (zh) * 2016-05-06 2017-11-14 合肥兆芯电子有限公司 映射表加载方法、内存控制电路单元与内存储存装置
CN108197040A (zh) * 2018-01-12 2018-06-22 江苏华存电子科技有限公司 一种实体位置映到逻辑映像位置的高效能方法

Also Published As

Publication number Publication date
CN108197040A (zh) 2018-06-22

Similar Documents

Publication Publication Date Title
US8122193B2 (en) Storage device and user device including the same
TWI381274B (zh) 用於快閃記憶體的區塊管理方法、儲存系統與控制器
TWI425357B (zh) 用來進行區塊管理之方法以及記憶裝置及控制器
TWI408551B (zh) 快閃記憶體儲存系統及其控制器與資料處理方法
CN100407336C (zh) 一种嵌入式系统中非易失性存储器的数据存取方法
WO2015185002A1 (zh) 一种数据写入方法及装置
TWI385518B (zh) 用於快閃記憶體的資料儲存方法及儲存系統
CN112395212B (zh) 减少键值分离存储系统的垃圾回收和写放大的方法及系统
US20170060448A1 (en) Systems, solid-state mass storage devices, and methods for host-assisted garbage collection
CN110674056B (zh) 一种垃圾回收方法及装置
CN109240939B (zh) 一种快速处理固态硬盘trim的方法
TWI450271B (zh) 用來管理一快閃記憶體的複數個區塊之方法以及相關之記憶裝置及其控制器
WO2019136969A1 (zh) 一种实体位置映到逻辑映像位置的高效能方法
CN109669889B (zh) 一种轻量型Nor Flash闪存控制方法和装置
KR20020092261A (ko) 멀티-플레인 구조의 플래시 메모리 관리 방법
CN102521146A (zh) 一种flash存储器块细分的数据寻址存储方法
WO2019136978A1 (zh) 一种提高闪存可利用率的方法
WO2019136982A1 (zh) 一种闪存冷热数据分析器及分析方法
JP2008084184A (ja) メモリコントローラ
Lee et al. RMSS: an efficient recovery management scheme on NAND flash memory based solid state disk
KR101353967B1 (ko) 환형 구조의 비휘발성 메모리 캐쉬에 데이터를 읽고 쓰기 위한 데이터 처리 방법
TWI766194B (zh) 資料儲存裝置以及非揮發式記憶體控制方法
CN113094369A (zh) 一种flash存储器数据管理方法
KR101373613B1 (ko) 환형 구조의 비휘발성 메모리 캐쉬를 포함하는 하이브리드 스토리지 장치
WO2019136979A1 (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: 18900234

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: 18900234

Country of ref document: EP

Kind code of ref document: A1