Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

An Efficient Page Organization and Management Method for Non-Volatile Memory

A technology of non-volatile memory and management method, which is applied in the field of computer memory page management, and can solve the problems of high number of page erases, performance bottlenecks, and failure to consider NVM wear leveling, etc.

Active Publication Date: 2019-07-05
诸葛晴凤
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These NVM page management schemes do not take NVM wear leveling into account when reclaiming and allocating NVM space, which may lead to excessive number of erasing and writing of some NVM pages, reducing the actual service life of NVM memory
In addition, the existing global and centralized memory management data structure needs to be locked when multiple processes need to allocate / reclaim memory pages at the same time to ensure data consistency. Take advantage of concurrent execution and affect system performance

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
  • An Efficient Page Organization and Management Method for Non-Volatile Memory
  • An Efficient Page Organization and Management Method for Non-Volatile Memory
  • An Efficient Page Organization and Management Method for Non-Volatile Memory

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0067] As shown in the figure, a tree data structure based on the wear counting mechanism provided in this embodiment manages the free space of the NVM, including the following steps:

[0068] Divide the NVM space into fixed-size pages (for example, 4KB, 2MB, or a collection of pages of different sizes), and use a continuous area in the NVM memory to store the "wear count value" of each page. The "wear count value" records The cumulative number of writes per page;

[0069] Each NVM page has two sets of pointer management, one of which is used to link all pages into a "free list", and the other pointer is used to combine all NVM pages into different intervals according to the wear count value;

[0070] When the system is running, the free pages in NVM are organized in a tree structure, which is called "wear index tree". The bottom layer of the wear degree index tree is the free pages in NVM. The free pages are divided into multiple intervals according to the wear count value, ...

Embodiment 2

[0081] The index initialization or reconstruction process provided by this embodiment, such as figure 1 Shown:

[0082] The process starts at step 801 and proceeds as follows:

[0083] In step 802, it is judged whether there is a free page in the NVM, if not, then the process ends in step 811; if there is, in step 803, the free linked list of the NVM page is scanned;

[0084] In step 804, read the address and wear count information of each scanned page into DRAM;

[0085] In step 805, it is judged whether there is already a wear degree index tree in the DRAM. If not, go to step 806; otherwise go to step 807.

[0086] In step 806, create a new wear degree index tree root node, and save the pointer of this node to NVM;

[0087] In step 807, find the correct position of the page from the wear degree index tree, and insert the data, that is, it is necessary to ensure that the primary keys of the nodes in the DRAM are arranged in an orderly manner;

[0088] In step 808, it is ...

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 an efficient page organization and management method facing an NVM (Non-Volatile Memory). The efficient page organization and management method comprises the steps of: firstly, establishing and organizing index structures of idle pages in the NVM by a tree-shaped structure, and generating a wear degree index tree; then partitioning the idle pages in the NVM into a plurality of intervals according to sizes of wear count values, and connecting the idle pages inside each interval in a link list form to form an interval link list; storing all internal nodes of the wear degree index tree besides leaf nodes in a DRAM (Dynamic Random Access Memory) for rapid indexing; and enabling nodes on the last layer in the DRAM to point to the interval link lists of NVM pages. The efficient page organization and management method facing the NVM, which is provided by the invention, solves the problem of an NVM page organization and management method in the prior art, and enables pages with low write wear to be preferably selected, thereby fulfilling the aim of uniformly distributing write operations into each page as far as possible; meanwhile, when write wear leveling is ensured, high-performance NVM page distribution and recovery management is achieved; and a multi-core architecture is sufficiently utilized, and parallel distribution and recovery are achieved.

Description

technical field [0001] The invention relates to the field of computer memory page management, in particular to an efficient page organization and management method for non-volatile memory. Background technique [0002] Non-volatile memory (Non-Volatile Memory, NVM) has the characteristics of not losing data when power is turned off, high storage density, low power consumption, and high-speed reading and writing. Like traditional DRAM (Dynamic Random Access Memory, DRAM), NVM can be directly connected to the memory bus of the system, share the address space, and access it directly through the CPU's load / store instruction. However, unlike DRAM, the durability of NVM storage units is limited, and its storage medium will be worn during the erasing and writing process. When the wear reaches a certain level, the corresponding storage unit will fail. Therefore, if the same NVM area is frequently erased and written, the NVM will be damaged in a short period of time, which will grea...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F12/02
CPCG06F12/0238
Inventor 诸葛晴凤沙行勉吴林
Owner 诸葛晴凤
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products