Management method of Nand-Flash memory system
A management method and storage system technology, which is applied in the management field of computer Nand-Flash storage systems, can solve the problems of non-sequential page writing, incapable of one-time writing of physical pages, inability of speed and stability to adapt to new Flash devices, etc. Achieve the effects of reducing time delay, ensuring integrity, and reducing search time
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0044] Example 1, see figure 1 , when the system is initialized, the physical block 9 is first searched, and the logical block number represented by it is M, and its forward physical block number is 7. When reading the forward replacement physical block number of the physical block 7, it is found to be HEAD mark, the search for the logical M block chain ends, and the logical M block chain (LBC)-M memory reverse linked list: 9->7 is obtained, and then the logical M block chain (LBC) is constructed according to the memory reverse linked list -M's memory forward linked list: 7->9, and then constitute a complete logical M block chain (LBC) -M's memory double-linked list: 79, such as figure 2 as shown, figure 2 It is a schematic diagram of the memory doubly linked list constructed by the above-mentioned embodiment 1.
Embodiment 2
[0045] Example 2, image 3 A schematic diagram of Embodiment 2 of constructing a memory reverse linked list for the present invention. See image 3 , when the system is initialized, the physical block 4 is first searched, and the logical block number it represents is K, and its forward replacement physical block number is 8, and then the physical block 8 is searched to obtain its forward replacement The physical block number is 5, and when the forward replacement physical block number of 5 is read, it is found to be a HEAD mark, then the search for the logical K block chain ends, and the memory reverse linked list of the logical K block chain (LBC)-K is obtained: 4 ->8->5, and then construct a logical K block chain (LBC)-K memory forward linked list [K] according to the reverse linked list: 5->8->4, and then form a complete logical K block chain ( LBC)-K memory doubly linked list [K]: 584, such as Figure 4 as shown, Figure 4 It is a schematic diagram of the memory doubly...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com