WO2021082109A1 - Hybrid mapping table on static random access memory - Google Patents

Hybrid mapping table on static random access memory Download PDF

Info

Publication number
WO2021082109A1
WO2021082109A1 PCT/CN2019/119687 CN2019119687W WO2021082109A1 WO 2021082109 A1 WO2021082109 A1 WO 2021082109A1 CN 2019119687 W CN2019119687 W CN 2019119687W WO 2021082109 A1 WO2021082109 A1 WO 2021082109A1
Authority
WO
WIPO (PCT)
Prior art keywords
random access
mapping table
static random
access memory
storage area
Prior art date
Application number
PCT/CN2019/119687
Other languages
French (fr)
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 WO2021082109A1 publication Critical patent/WO2021082109A1/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/10Address translation
    • G06F12/1009Address translation using page tables, e.g. page table structures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/0223User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023Free address space management
    • G06F12/0238Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory

Definitions

  • the invention relates to the technical field of storage systems, in particular to a hybrid mapping table on a static random access memory.
  • Flash memory flash memory, sometimes referred to as flash RAM
  • flash RAM flash memory
  • Flash memory is a non-volatile memory with continuous power supply, which can be deleted and reorganized in storage units called blocks. Flash memory is a variant of electrically erasable programmable read-only memory (EEPROM). The difference between EEPROM and flash memory is that it deletes and rewrites at the byte level, so that the update speed of EEPROM is slower than flash memory. Flash memory is usually used to store control codes, such as the basic input output system (BIOS) in a personal computer. When the input/output system needs to be changed (rewritten), the flash memory can be written in blocks (rather than bytes), so that the flash memory can be updated more easily. But on the other hand, flash memory is not as useful as random access memory (RAM), because random access memory can set addresses at the byte (rather than block) level.
  • RAM random access memory
  • Flash translation layer Flash Translation Layer
  • SLC area flash translation layer
  • FTL Flash Translation Layer
  • Byte Byte to record the user data currently in the fast buffer storage area in a space of the static random access memory.
  • the flash conversion layer needs to search for user data, it needs to first search the static random access memory marked with the fast buffer storage area to find whether the currently needed data exists in the fast buffer storage area. If the currently needed data is not in the fast buffer storage area, look up the mapping table to look up the needed data.
  • the object of the present invention is to provide a hybrid mapping table on a static random access memory to solve the above-mentioned problems in the background art.
  • a hybrid mapping table on a static random access memory including the following steps:
  • Step 1 Query information
  • Step 2 Determine the highest position, if yes, skip to step 3, otherwise skip to step 4;
  • Step 3 Look up the physical block address of the fast buffer storage area
  • Step 4 Reload the image table
  • Step 5 Look up the physical block address of the data from the mapping table.
  • the mapping table is any mapping table, which can be mixed with the erase block count table and the effective unit count table.
  • the fast buffer storage area has 200 SLCs, each SLC has 256 flash memory pages, each page has 16K space, and every 4K is a space unit.
  • the present invention has the beneficial effect that: the present invention combines the mapping table on the static random access memory with the mapping table mapped to the fast buffer storage area. That is, the space usage of the static random access memory can be saved, so as to effectively increase the utilization rate of the static random access memory. According to the size of the fast buffer storage area, the space usage of n static random access memories can also be reduced.
  • Figure 1 is a flow chart of the present invention.
  • a hybrid mapping table on a static random access memory including the following steps:
  • Step 1 Query information
  • Step 2 Determine the highest position, if yes, skip to step 3, otherwise skip to step 4;
  • Step 3 Look up the physical block address of the fast buffer storage area
  • Step 4 Reload the image table
  • Step 5 Look up the physical block address of the data from the mapping table.
  • the map table is any map table, which can be mixed with the erase block count table and the effective unit count table.
  • the fast buffer storage area has 200 SLCs, each SLC has 256 flash pages, and each page has 16K of space. Every 4K is a space unit. It can save 200*256*4 of 204800 static random access memory space.
  • the state of the user data in the fast buffer storage area is marked at the highest bit of the mapping table.
  • the highest bit of the mapping table it is noted whether the user data to be searched exists in the fast buffer storage area. Mark with a bit. The highest bit is 1, it means that the user data is stored in the fast buffer storage area. The highest bit is 0, it means that the user data does not exist in the fast buffer storage area.
  • the mapping table needs to be reloaded to look up the physical block address.
  • the present invention combines the mapping table on the static random access memory with the mapping table mapped to the fast buffer storage area. That is, the space usage of the static random access memory can be saved, so as to effectively increase the utilization rate of the static random access memory. According to the size of the fast buffer storage area, the space usage of n static random access memories can also be reduced.

Landscapes

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

Abstract

A hybrid mapping table on a static random access memory. A mapping table on a static random access memory is combined with a mapping table mapped to a fast buffer storage area. The usage of space by the static random access memory can be saved, and the utilization rate of the static random access memory can be effectively improved. According to the size of the fast buffer storage area, the space usage of n static random access memories can also be reduced.

Description

一种在静态随机存取存储器上的混合型映象表A hybrid mapping table on static random access memory 技术领域Technical field
本发明涉及存储系统技术领域,具体为一种在静态随机存取存储器上的混合型映象表。The invention relates to the technical field of storage systems, in particular to a hybrid mapping table on a static random access memory.
背景技术Background technique
闪存(flash memory,有时称为flash RAM)是一种不断供电的非易失性存储器,它能在称为块(block)的存储单位中进行删除和改编。闪存是电可擦写可编程只读存储器(EEPROM)的变体,EEPROM与闪存不同的是,它在字节层面上进行删除和重写,这样EEPROM就比闪存的更新速度慢。通常用闪存来保存控制代码,比如在个人电脑中的基本输入输出系统(BIOS)。当需要改变(重写)输入输出系统时,闪存可以以块(而不是字节)的大小输写,这样闪存就更容易更新。但另一方面,闪存不像随机存取存储器(RAM)一样有用,因为随即存取存储器可以在字节(而不是块)层面上设定地址。Flash memory (flash memory, sometimes referred to as flash RAM) is a non-volatile memory with continuous power supply, which can be deleted and reorganized in storage units called blocks. Flash memory is a variant of electrically erasable programmable read-only memory (EEPROM). The difference between EEPROM and flash memory is that it deletes and rewrites at the byte level, so that the update speed of EEPROM is slower than flash memory. Flash memory is usually used to store control codes, such as the basic input output system (BIOS) in a personal computer. When the input/output system needs to be changed (rewritten), the flash memory can be written in blocks (rather than bytes), so that the flash memory can be updated more easily. But on the other hand, flash memory is not as useful as random access memory (RAM), because random access memory can set addresses at the byte (rather than block) level.
在闪存存储的应用上相当的广泛,然而在静态随机存取存储器的空间上,也随之反应在成本价格上。所以,有效率的使用静态随机存取存储器,则是一个重大的课题。The application of flash memory storage is quite extensive, but the space of static random access memory is also reflected in the cost price. Therefore, the efficient use of static random access memory is a major issue.
在闪存存储的系统中,如何标记用户数据是否有存在闪存转换层(FTL,Flash Translation Layer)的快速缓冲贮存区(SLC area)。市面上各个厂家都有自己独特的方法。常见的方法,则是将目前留在快速缓冲贮存区的用户数据,使用Byte的方式,记录在静态随机存取存储器的一块空间上。当闪存转换层需要查找用户数据时,需要先查 找标记快速缓冲贮存区的静态随机存取存储器,查找目前所需要的数据是否有存在快速缓冲贮存区。如果目前所需要的数据不在快速缓冲贮存区,则查寻映像表,查寻所需的资料。In a flash storage system, how to mark whether user data has a flash translation layer (FTL, Flash Translation Layer) fast buffer storage area (SLC area). Each manufacturer on the market has its own unique method. The common method is to use Byte to record the user data currently in the fast buffer storage area in a space of the static random access memory. When the flash conversion layer needs to search for user data, it needs to first search the static random access memory marked with the fast buffer storage area to find whether the currently needed data exists in the fast buffer storage area. If the currently needed data is not in the fast buffer storage area, look up the mapping table to look up the needed data.
发明内容Summary of the invention
本发明的目的在于提供一种在静态随机存取存储器上的混合型映象表,以解决上述背景技术中提出的问题。The object of the present invention is to provide a hybrid mapping table on a static random access memory to solve the above-mentioned problems in the background art.
为实现上述目的,本发明提供如下技术方案:一种在静态随机存取存储器上的混合型映象表,包括以下步骤:To achieve the above objective, the present invention provides the following technical solution: a hybrid mapping table on a static random access memory, including the following steps:
步骤1:查询资料;Step 1: Query information;
步骤2:判断最高位,是则跳至步骤3,否则跳至步骤4;Step 2: Determine the highest position, if yes, skip to step 3, otherwise skip to step 4;
步骤3:查寻快速缓冲贮存区的物理区块地址;Step 3: Look up the physical block address of the fast buffer storage area;
步骤4:重新载入映像表;Step 4: Reload the image table;
步骤5:从映像表查寻数据的物理区块地址。Step 5: Look up the physical block address of the data from the mapping table.
优选的,所述映象表为任何的映象表,可与擦除块计数表,有效单元计数表混合。Preferably, the mapping table is any mapping table, which can be mixed with the erase block count table and the effective unit count table.
优选的,所述快速缓冲贮存区有200个SLC,每个SLC有256个闪存页,每页有16K的空间,每4K为一个空间单位。Preferably, the fast buffer storage area has 200 SLCs, each SLC has 256 flash memory pages, each page has 16K space, and every 4K is a space unit.
与现有技术相比,本发明的有益效果是:本发明将静态随机存取存储器上的映象表,与映射到快速缓冲贮存区的映象表结合。即可以节省静态随机存取存储器空间上的使用,以有效提高静态随机存取存储器的使用率。依照快速缓冲贮存区的大小,亦可减少n个静态随机存取存储器的空间使用。Compared with the prior art, the present invention has the beneficial effect that: the present invention combines the mapping table on the static random access memory with the mapping table mapped to the fast buffer storage area. That is, the space usage of the static random access memory can be saved, so as to effectively increase the utilization rate of the static random access memory. According to the size of the fast buffer storage area, the space usage of n static random access memories can also be reduced.
附图说明Description of the drawings
图1为本发明流程图。Figure 1 is a flow chart of the present invention.
具体实施方式Detailed ways
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.
请参阅图1,本发明提供一种技术方案:一种在静态随机存取存储器上的混合型映象表,包括以下步骤:Referring to Fig. 1, the present invention provides a technical solution: a hybrid mapping table on a static random access memory, including the following steps:
步骤1:查询资料;Step 1: Query information;
步骤2:判断最高位,是则跳至步骤3,否则跳至步骤4;Step 2: Determine the highest position, if yes, skip to step 3, otherwise skip to step 4;
步骤3:查寻快速缓冲贮存区的物理区块地址;Step 3: Look up the physical block address of the fast buffer storage area;
步骤4:重新载入映像表;Step 4: Reload the image table;
步骤5:从映像表查寻数据的物理区块地址。Step 5: Look up the physical block address of the data from the mapping table.
其中,映象表为任何的映象表,可与擦除块计数表,有效单元计数表混合。Among them, the map table is any map table, which can be mixed with the erase block count table and the effective unit count table.
快速缓冲贮存区有200个SLC,每个SLC有256个闪存页,每页有16K的空间。每4K为一个空间单位。则可以节省200*256*4为204800的静态随机存取存储器空间。The fast buffer storage area has 200 SLCs, each SLC has 256 flash pages, and each page has 16K of space. Every 4K is a space unit. It can save 200*256*4 of 204800 static random access memory space.
本发明中,将用户数据存在快速缓冲贮存区的状态,标记在映像表的最高位。藉由标记映像表的最高位,来注释需要查寻的用户数据 是否有存在快速缓冲贮存区。以一个位来标记。最高位为1,则表示用户数据存在快速缓冲贮存区。最高位为0,则表示用户数据不存在快速缓冲贮存区。此时则需要重载映像表去查寻物理区块地址。In the present invention, the state of the user data in the fast buffer storage area is marked at the highest bit of the mapping table. By marking the highest bit of the mapping table, it is noted whether the user data to be searched exists in the fast buffer storage area. Mark with a bit. The highest bit is 1, it means that the user data is stored in the fast buffer storage area. The highest bit is 0, it means that the user data does not exist in the fast buffer storage area. At this time, the mapping table needs to be reloaded to look up the physical block address.
综上所述,本发明将静态随机存取存储器上的映象表,与映射到快速缓冲贮存区的映象表结合。即可以节省静态随机存取存储器空间上的使用,以有效提高静态随机存取存储器的使用率。依照快速缓冲贮存区的大小,亦可减少n个静态随机存取存储器的空间使用。In summary, the present invention combines the mapping table on the static random access memory with the mapping table mapped to the fast buffer storage area. That is, the space usage of the static random access memory can be saved, so as to effectively increase the utilization rate of the static random access memory. According to the size of the fast buffer storage area, the space usage of n static random access memories can also be reduced.
尽管已经示出和描述了本发明的实施例,对于本领域的普通技术人员而言,可以理解在不脱离本发明的原理和精神的情况下可以对这些实施例进行多种变化、修改、替换和变型,本发明的范围由所附权利要求及其等同物限定。Although the embodiments of the present invention have been shown and described, those of ordinary skill in the art can understand that various changes, modifications, and substitutions can be made to these embodiments without departing from the principle and spirit of the present invention. And variations, the scope of the present invention is defined by the appended claims and their equivalents.

Claims (3)

  1. 一种在静态随机存取存储器上的混合型映象表,其特征在于:包括以下步骤:A hybrid mapping table on a static random access memory, which is characterized in that it includes the following steps:
    步骤1:查询资料;Step 1: Query information;
    步骤2:判断最高位,是则跳至步骤3,否则跳至步骤4;Step 2: Determine the highest position, if yes, skip to step 3, otherwise skip to step 4;
    步骤3:查寻快速缓冲贮存区的物理区块地址;Step 3: Look up the physical block address of the fast buffer storage area;
    步骤4:重新载入映像表;Step 4: Reload the image table;
    步骤5:从映像表查寻数据的物理区块地址。Step 5: Look up the physical block address of the data from the mapping table.
  2. 根据权利要求1所述的一种在静态随机存取存储器上的混合型映象表,其特征在于:所述映象表为任何的映象表,可与擦除块计数表,有效单元计数表混合。A hybrid mapping table on a static random access memory according to claim 1, characterized in that: the mapping table is any mapping table, which can be combined with the erase block count table and the effective unit count Table mix.
  3. 根据权利要求1所述的一种在静态随机存取存储器上的混合型映象表,其特征在于:所述快速缓冲贮存区有200个SLC,每个SLC有256个闪存页,每页有16K的空间,每4K为一个空间单位。A hybrid mapping table on a static random access memory according to claim 1, wherein the fast buffer storage area has 200 SLCs, each SLC has 256 flash memory pages, and each page has 200 SLCs. 16K space, every 4K is a space unit.
PCT/CN2019/119687 2019-10-31 2019-11-20 Hybrid mapping table on static random access memory WO2021082109A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911056103.9 2019-10-31
CN201911056103.9A CN110806987A (en) 2019-10-31 2019-10-31 Hybrid mapping table on static random access memory

Publications (1)

Publication Number Publication Date
WO2021082109A1 true WO2021082109A1 (en) 2021-05-06

Family

ID=69489930

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/119687 WO2021082109A1 (en) 2019-10-31 2019-11-20 Hybrid mapping table on static random access memory

Country Status (2)

Country Link
CN (1) CN110806987A (en)
WO (1) WO2021082109A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11449244B2 (en) * 2020-08-11 2022-09-20 Silicon Motion, Inc. Method and apparatus for performing access management of memory device in host performance booster architecture with aid of device side table information

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1822217A (en) * 2005-01-06 2006-08-23 三星电子株式会社 Apparatus and method for storing data in nonvolatile cache memory considering update ratio
CN101833516A (en) * 2007-12-14 2010-09-15 创惟科技股份有限公司 Storage system and method for improving access efficiency of flash memory
CN101916228A (en) * 2010-08-17 2010-12-15 中国人民解放军国防科学技术大学 Flash translation layer (FTL) with data compression function and implementation method
CN103425600A (en) * 2013-08-23 2013-12-04 中国人民解放军国防科学技术大学 Address mapping method for flash translation layer of solid state drive
CN104102591A (en) * 2013-04-08 2014-10-15 香港理工大学 Computer subsystem and method for implementing flash translation layer in computer subsystem

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1822217A (en) * 2005-01-06 2006-08-23 三星电子株式会社 Apparatus and method for storing data in nonvolatile cache memory considering update ratio
CN101833516A (en) * 2007-12-14 2010-09-15 创惟科技股份有限公司 Storage system and method for improving access efficiency of flash memory
CN101916228A (en) * 2010-08-17 2010-12-15 中国人民解放军国防科学技术大学 Flash translation layer (FTL) with data compression function and implementation method
CN104102591A (en) * 2013-04-08 2014-10-15 香港理工大学 Computer subsystem and method for implementing flash translation layer in computer subsystem
CN103425600A (en) * 2013-08-23 2013-12-04 中国人民解放军国防科学技术大学 Address mapping method for flash translation layer of solid state drive

Also Published As

Publication number Publication date
CN110806987A (en) 2020-02-18

Similar Documents

Publication Publication Date Title
US10761780B2 (en) Memory system
CN109240938B (en) Memory system and control method for controlling nonvolatile memory
US11232041B2 (en) Memory addressing
US10915475B2 (en) Methods and apparatus for variable size logical page management based on hot and cold data
EP2530612B1 (en) Mount-time unmapping of unused logical addresses in non-volatile memory systems
TWI405082B (en) Memory system and mapping methods thereof
US8489854B1 (en) Non-volatile semiconductor memory storing an inverse map for rebuilding a translation table
US7487303B2 (en) Flash memory device and associated data merge method
WO2017054737A1 (en) Address mapping method and device based on mass solid-state storage
TWI453585B (en) Memory devices for address translation and methods for memory address translation
CN110781096A (en) Apparatus and method for performing garbage collection by predicting demand time
JP2008192154A (en) Memory mapping method and memory mapping system
US8438325B2 (en) Method and apparatus for improving small write performance in a non-volatile memory
TW200527433A (en) Memory card and semiconductor device
TW201926046A (en) Method for accessing flash memory module and associated flash memory controller and electronic device
TW201508485A (en) Data storage device and FLASH memory control method
JPWO2006067923A1 (en) MEMORY CONTROLLER, NONVOLATILE MEMORY DEVICE, NONVOLATILE MEMORY SYSTEM, AND MEMORY CONTROL METHOD
JPWO2009096180A1 (en) MEMORY CONTROLLER, NONVOLATILE STORAGE DEVICE, AND NONVOLATILE STORAGE SYSTEM
TW201443638A (en) Method of dynamically adjusting mapping manner in non-volatile memory and non-volatile storage device using the same
WO2021082109A1 (en) Hybrid mapping table on static random access memory
US20180129415A1 (en) Memory system and method
US10719436B2 (en) Management device, information processing device, and management method
JP2008217208A (en) Storage device, computer system and management method for storage device
JP2013196155A (en) Memory system
TWI705328B (en) Data storage device and control method for non-volatile memory

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

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

Country of ref document: EP

Kind code of ref document: A1