WO2020082455A1 - Procédé d'enregistrement hybride pour une table de mappage logique-physique - Google Patents

Procédé d'enregistrement hybride pour une table de mappage logique-physique Download PDF

Info

Publication number
WO2020082455A1
WO2020082455A1 PCT/CN2018/115516 CN2018115516W WO2020082455A1 WO 2020082455 A1 WO2020082455 A1 WO 2020082455A1 CN 2018115516 W CN2018115516 W CN 2018115516W WO 2020082455 A1 WO2020082455 A1 WO 2020082455A1
Authority
WO
WIPO (PCT)
Prior art keywords
flash memory
page
access memory
flash
static random
Prior art date
Application number
PCT/CN2018/115516
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 WO2020082455A1 publication Critical patent/WO2020082455A1/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 invention relates to the technical field of hybrid recording entity mapping tables in a storage system, in particular to a hybrid recording entity mapping table method.
  • Flash memory is a long-life non-volatile memory. Data deletion is not in a single byte but in fixed blocks. The block size is generally 256KB to 20MB. Flash memory is electronically erasable only. A variant of read memory (EEPROM). Flash memory is different from EEPROM in that EEPROM can be deleted and rewritten at the byte level instead of the entire chip erase and write, and most chips of flash memory require block erase. Because it can still save data when the power is off, flash memory is usually used to save setting information, such as saving information in the computer's BIOS (basic program), PDA (personal digital assistant), digital camera, etc.
  • BIOS basic program
  • PDA personal digital assistant
  • the physical image table (Physical to Logical Table) of each flash memory page is stored in the remaining space (Meta data) of the entire flash memory page.
  • Metal data the remaining space
  • each page is read out sequentially and compared with the physical image table to obtain whether the flash page is a valid flash page.
  • the physical image table can also be organized into a flash memory page and stored in the last flash memory page of each flash memory block. When the valid pages need to be compared, the last flash page can be read out before the valid pages can be compared with the physical image table. Therefore, an improved technology is urgently needed to solve this problem in the existing technology. problem.
  • the object of the present invention is to provide a hybrid method for recording an entity mapping table, that is, a method for combining user data with an entity mapping table and recording on the same flash memory page.
  • This method can not only effectively use the space of the flash memory page, At the same time, the number of times of writing flash memory pages can also be reduced to achieve high-speed writing performance and the effective use of flash memory space to solve the problems mentioned in the background art.
  • a hybrid method for recording an entity mapping table including the following steps:
  • Step 1 Based on the spatial relationship of the static random access memory, the physical mapping table is stored according to the size of the static random access memory;
  • Step 2 Every 4 bytes is a unit, record the physical image unit of each flash page;
  • Step 3 Record the physical image unit of each flash page in sequence until the space of the static random access memory is filled;
  • Step 4 When the static random access memory is satisfied, the user data and the physical image table are mixed into a flash memory page and written into the flash memory block together.
  • the static random access memory is composed of transistors, and the state of the static random access memory is maintained until a change signal is received.
  • the address of the flash page of the physical image table is obtained by calculating the size of the random access memory.
  • a plurality of physical image units are recorded in the flash memory page in the second step.
  • each flash memory block in the fourth step stores a plurality of unequal physical mapping tables based on the size of the static random access memory.
  • a method of combining user data with a physical image table and recording on the same flash page can not only effectively use the space of the flash page, but also reduce the number of times the flash page is written to achieve high-speed write performance , And effective use of flash memory space.
  • FIG. 1 is a schematic structural diagram of the present invention.
  • the present invention provides a technical solution: a hybrid method for recording an entity mapping table, including the following steps:
  • Step 1 Based on the spatial relationship of the static random access memory, the physical mapping table is stored according to the size of the static random access memory;
  • Step 2 Every 4 bytes is a unit, record the physical image unit of each flash page;
  • Step 3 Record the physical image unit of each flash page in sequence until the space of the static random access memory is filled;
  • Step 4 When the static random access memory is satisfied, the user data and the physical image table are mixed into a flash memory page and written into the flash memory block together.
  • the minimum write unit of the flash memory can also be planned as the addressing static random access memory space, and the maximum space of the physical mapping table is 4K, 8K, or 16K.
  • the address of the flash page of the physical image table is obtained by calculating the size of the random access memory.
  • the calculation method is as follows. When the size of the random access memory is n 1 , every 4 bytes is a unit, one physical image unit is recorded, however, a flash page can record n 2 physical image units, and finally, the calculation is mixed
  • the address of the flash memory page where the physical image table is located can be obtained as the address of the flash memory page where the physical image table is located.
  • i is the space of the flash page
  • j is random access memory space
  • Each flash memory block will store several unequal physical image tables based on the size of the static random access memory.
  • the first embodiment is to prepare a flash memory with a capacity of 1GB, and the size of each flash page is 512 bytes.
  • flash page 1 stores 64 bytes of user data
  • flash page 2 stores 128 bytes of user data
  • flash page 3 Store 256 bytes of user data, and then fill the physical image table with every 4 bytes as a unit.
  • the physical image table is divided into 448 bytes (112) and filled into the flash memory page 1
  • the physical image table is divided 384 bytes (112) are filled into flash page 2
  • the physical image table is divided into 256 bytes (64) to be filled into flash page 3.
  • the writing time of the three pages is shorter than the traditional writing time by 45 ⁇ s.
  • Embodiment 2 Prepare a flash memory with a capacity of 1GB, and the size of each flash page is 256 bytes.
  • flash page 1 stores 32 bytes of user data
  • flash page 2 stores 64 bytes of user data
  • flash page 3 Store 128 bytes of user data, and then fill the physical image table with every 4 bytes as a unit.
  • the physical image table is divided into 224 bytes (56) and filled into the flash memory page 1
  • the physical image table is divided 192 bytes (48) are filled into the flash page 2
  • the physical image table is divided into 128 bytes (32) to be filled into the flash page 3.
  • the write time of the three pages is shortened by 30 ⁇ s compared with the traditional write time.
  • the third embodiment is to prepare a flash memory with a capacity of 512MB, and the size of each flash page is 128 bytes.
  • flash page 1 stores 16 bytes of user data
  • flash page 2 stores 32 bytes of user data
  • flash page 3 Store 64 bytes of user data, and then fill the physical image table in units of 4 bytes.
  • the physical image table is divided into 112 bytes (28) and filled into the flash memory page 1, and the physical image table is divided.
  • 96 bytes (24) are filled into flash page 2 and the physical image table is divided into 64 bytes (16) to be filled into flash page 3.
  • the write time of the three pages is 24 ⁇ s shorter than the traditional write time.
  • the fourth embodiment is to prepare a flash memory with a capacity of 256MB, and the size of each flash page is 64 bytes.
  • flash page 1 stores 8 bytes of user data
  • flash page 2 stores 16 bytes of user data
  • flash page 3 Store 32 bytes of user data, and then fill the physical image table with every 4 bytes as a unit.
  • the physical image table is divided into 56 bytes (14) and filled into the flash memory page 1
  • the physical image table is divided 48 bytes (12) are filled into flash page 2
  • the physical image table is divided into 32 bytes (8) to be filled into flash page 3.
  • the write time of the three pages is 15 ⁇ s shorter than the traditional write time.
  • the fifth embodiment is to prepare a flash memory with a capacity of 128MB, and the size of each flash page is 64 bytes.
  • flash page 1 stores 8 bytes of user data
  • flash page 2 stores 16 bytes of user data
  • flash page 3 Store 32 bytes of user data, and then fill the physical image table with every 4 bytes as a unit.
  • the physical image table is divided into 56 bytes (14) and filled into the flash memory page 1
  • the physical image table is divided 48 bytes (12) are filled into flash page 2
  • the physical image table is divided into 32 bytes (8) to be filled into flash page 3.
  • the write time of the three pages is shortened by 12 ⁇ s compared to the traditional write time.
  • the method of the present invention improves the writing performance compared to the traditional method.

Landscapes

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

Abstract

Un procédé d'enregistrement hybride pour une table de mappage logique-physique comprend les étapes suivantes : étape I, stocker, sur la base d'une relation spatiale d'une mémoire vive statique, une table de mappage logique-physique selon la taille de la mémoire vive statique ; étape II, enregistrer, à l'aide d'une unité de 4 octets, une unité de mappage logique-physique de chaque page de mémoire flash ; étape III, enregistrer séquentiellement l'unité de mappage logique-physique de chaque page de mémoire flash jusqu'à ce que tout l'espace de la mémoire vive statique soit écrit ; et étape VI, lorsqu'une condition d'une mémoire vive statique est satisfaite, combiner des données d'utilisateur et la table de mappage logique-physique en tant que page de mémoire flash, et écrire l'ensemble dans un bloc de mémoire flash, ce qui permet une utilisation d'espace efficace pour des pages de mémoire flash, réduit le nombre d'opérations pour écrire des pages de mémoire flash, et permet d'obtenir des performances d'écriture à grande vitesse et une utilisation efficace de l'espace de mémoire flash.
PCT/CN2018/115516 2018-10-25 2018-11-14 Procédé d'enregistrement hybride pour une table de mappage logique-physique WO2020082455A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811253542.4A CN109446109B (zh) 2018-10-25 2018-10-25 一种混合型记录实体映像表的方法
CN201811253542.4 2018-10-25

Publications (1)

Publication Number Publication Date
WO2020082455A1 true WO2020082455A1 (fr) 2020-04-30

Family

ID=65548447

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/115516 WO2020082455A1 (fr) 2018-10-25 2018-11-14 Procédé d'enregistrement hybride pour une table de mappage logique-physique

Country Status (2)

Country Link
CN (1) CN109446109B (fr)
WO (1) WO2020082455A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100274949A1 (en) * 2009-04-23 2010-10-28 Phison Electronics Corp. Data access method for flash memory and storage system and controller using the same
US9727271B2 (en) * 2013-12-26 2017-08-08 Silicon Motion, Inc. Data storage device and flash memory control method
CN107832013A (zh) * 2017-11-03 2018-03-23 中国科学技术大学 一种管理固态硬盘映射表的方法
CN108681509A (zh) * 2018-04-20 2018-10-19 江苏华存电子科技有限公司 一种快速建立闪存映射表的方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8364931B2 (en) * 2009-06-29 2013-01-29 Mediatek Inc. Memory system and mapping methods using a random write page mapping table
CN103970669A (zh) * 2013-02-06 2014-08-06 Lsi公司 用于加速在固态设备中的回收操作的物理到逻辑地址映射
TWI570559B (zh) * 2015-12-28 2017-02-11 點序科技股份有限公司 快閃記憶體及其存取方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100274949A1 (en) * 2009-04-23 2010-10-28 Phison Electronics Corp. Data access method for flash memory and storage system and controller using the same
US9727271B2 (en) * 2013-12-26 2017-08-08 Silicon Motion, Inc. Data storage device and flash memory control method
CN107832013A (zh) * 2017-11-03 2018-03-23 中国科学技术大学 一种管理固态硬盘映射表的方法
CN108681509A (zh) * 2018-04-20 2018-10-19 江苏华存电子科技有限公司 一种快速建立闪存映射表的方法

Also Published As

Publication number Publication date
CN109446109B (zh) 2021-06-29
CN109446109A (zh) 2019-03-08

Similar Documents

Publication Publication Date Title
US10761780B2 (en) Memory system
US9304904B2 (en) Hierarchical flash translation layer
US8180955B2 (en) Computing systems and methods for managing flash memory device
US8606987B2 (en) Data writing method for flash memory and controller using the same
US11354236B2 (en) Garbage collection method for data storage device
US20090089485A1 (en) Wear leveling method and controller using the same
US20050055532A1 (en) Method for efficiently controlling read/write of flash memory
US20090198875A1 (en) Data writing method for flash memory, and controller and system using the same
JP2003044351A (ja) フラッシュメモリ装置、及び、それに記憶されたデータのマージ方法
US20120166709A1 (en) File system of flash memory
US20190303299A1 (en) Control unit for data storage system and method for updating logical-to-physical mapping table
US9122586B2 (en) Physical-to-logical address map to speed up a recycle operation in a solid state drive
US20100064095A1 (en) Flash memory system and operation method
US20230342055A1 (en) Control method of flash memory controller and associated flash memory controller and storage device
US8429339B2 (en) Storage device utilizing free pages in compressed blocks
EP4033364A1 (fr) Procédé de commande pour contrôleur de mémoire flash et contrôleur de mémoire flash et dispositif de stockage associés
CN109976664A (zh) 固态存储设备的日志数据组织
US20220269440A1 (en) Control method for flash memory controller and associated flash memory controller and storage device
KR20090034135A (ko) 플래시 메모리의 사상 관리 방법
WO2020082455A1 (fr) Procédé d'enregistrement hybride pour une table de mappage logique-physique
KR20110070656A (ko) 플래시 메모리의 데이터 처리 방법 및 장치
CN108062278A (zh) 一种闪存冷热数据分析器及分析方法
KR20090046568A (ko) 플래시 메모리 시스템 및 그것의 쓰기 방법
CN111610929A (zh) 数据储存装置以及非挥发式存储器控制方法
TW202032375A (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: 18938161

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

Country of ref document: EP

Kind code of ref document: A1