A design method of a page-level flash memory conversion layer of a solid-state hard disk

A flash memory conversion layer and design method technology, applied in computing, memory systems, instruments, etc., can solve the problems of reducing the lifespan of NAND flash memory, limited service life, and not supporting in-place updates, etc., to improve overall performance and service life, reduce The effect of write times and good system response time

Active Publication Date: 2019-03-08
HANGZHOU DIANZI UNIV
View PDF11 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

4) It must be erased before writing data, that is, in-place update is not supported
5) The number of erasing times is limited, exceeding a certain erasing threshold, the overall performance of NAND flash memory will be greatly reduced, that is, the service life is limited
However, due to the continuous c

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A design method of a page-level flash memory conversion layer of a solid-state hard disk
  • A design method of a page-level flash memory conversion layer of a solid-state hard disk
  • A design method of a page-level flash memory conversion layer of a solid-state hard disk

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0083] Embodiment 1: The write request does not hit in W-CMT and R-CMT.

[0084] Suppose the initial state of the mapped buffer is as Figure 5 As shown in the "initial state" in the figure, there is a request "access data page LPN=1280, write access request, request size 1" arrives, and the processing process is as follows:

[0085] C1, when an access request arrives (LPN=1280), first query the W-CMT, and the request mapping item is not found in the W-CMT, and then query in the R-CMT, and the request mapping item is also not found. At this point, the mapping information of the access request needs to be loaded into the W-CMT.

[0086] C2. At this time, the W-CMT is in a full state, and a mapping item needs to be selected for removal. Since there is no clean mapping information in the priority replacement area, the mapping information (LPN=6) at the LRU position is selected as the victim item (ie, the item to be eliminated).

[0087] C3, through the LPN of the victim item, cal

Embodiment 2

[0096] Embodiment 2: The write request hits in the R-CMT.

[0097] Suppose the initial state of the mapped buffer is as Figure 6 As shown in the "initial state" in "Initial State", there is an existing "access data page LPN=1280, write access request, request size is 1" request arrives, and its processing process is as follows: C1, when an access request arrives (LPN= 1280), query W-CMT first, no request mapping item is found in W-CMT,

[0098] C2 then inquires in the R-CMT, and finds the mapping information corresponding to the request in the R-CMT.

[0099] C3, W-CMT is full at this time, query whether there is a clean mapping item in the priority replacement area, and get a clean mapping item of LPN=833, then remove it as a victim item.

[0100] C4, and then migrate the mapping information from the R-CMT to the MRU position of the W-CMT.

[0101] C5, assuming that the newly allocated data page of the flash memory is PPN=661, update the mapping information, and set the upda

Embodiment 3

[0103] Embodiment 3: The write request hits in the W-CMT.

[0104] Suppose the initial state of the mapped buffer is as Figure 7 As shown in the "initial state" in the figure, there is a request "access data page LPN=1280, write access request, request size 1" arrives, and the processing process is as follows:

[0105] C1, when an access request arrives (LPN=1280), first query the W-CMT, and query the request mapping information in the W-CMT.

[0106] C2. Migrate the mapping information to the MRU position of the W-CMT.

[0107] C3, assuming that the newly allocated data page of the flash memory is PPN=661, update the mapping information, and set the update bit to dirty (Update_flag=1).

[0108] To sum up, the status of the mapping buffer after processing is as follows Figure 7 shown in "End State".

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a design method of a page-level flash memory conversion layer of a solid-state hard disk. The invention divides the NAND flash memory into two parts of a data block area and atranslation block area, wherein the data block area is used for storing conventional user data, the translation block area only stores mapping information, and the whole flash memory adopts the page-based mapping. The RAM is divided into W-CMT, R-CMT and GTD three parts. The W-CMT is used for storing write data mapping information with high access frequency. The R-CMT is used to store the read data mapping information with high access frequency, and the GTD is used to record the address mapping entries in the mapping block. The method of the invention realizes the high-flexibility page-level mapping, and at the same time, greatly reduces the frequent updating of translated pages caused by data updating, thereby improving the overall system performance and prolonging the service life of thesolid-state hard disk.

Description

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Owner HANGZHOU DIANZI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products