CN112068769A - Bidirectional linked list management method of flash memory device and flash memory device - Google Patents
Bidirectional linked list management method of flash memory device and flash memory device Download PDFInfo
- Publication number
- CN112068769A CN112068769A CN202010740009.1A CN202010740009A CN112068769A CN 112068769 A CN112068769 A CN 112068769A CN 202010740009 A CN202010740009 A CN 202010740009A CN 112068769 A CN112068769 A CN 112068769A
- Authority
- CN
- China
- Prior art keywords
- flash memory
- linked list
- pointer
- category
- range
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
- 230000002457 bidirectional effect Effects 0.000 title claims abstract description 26
- 238000007726 management method Methods 0.000 title description 25
- 238000000034 method Methods 0.000 claims abstract description 24
- 230000005055 memory storage Effects 0.000 claims abstract description 10
- 229920006395 saturated elastomer Polymers 0.000 claims description 12
- 239000000523 sample Substances 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 abstract description 4
- 230000009471 action Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a method for managing a bidirectional linked list of a flash memory device and the flash memory device, which are applied to the technical field of flash memory management, and are used for acquiring the flash memory device and calibrating a plurality of physical blocks of the flash memory device; creating a doubly linked list according to a plurality of physical blocks of the flash memory storage device, wherein the doubly linked list is provided with a Prev array and a Next array; determining a first category range with a plurality of physical blocks on a double linked list by a Head pointer and a Tail pointer, and respectively determining the category ranges of all the physical blocks by adopting a plurality of Head pointers and a plurality of Tail pointers; and inputting an operation instruction to the Head pointer and the Tail pointer to control the category range to execute the management operations of adding, taking out and range adjustment, and adopting a group of two-way linked lists to be matched with different types of pointer management to effectively meet the management and maintenance of a plurality of different types of physical block sequences, thereby more effectively using a cache space and reducing the complexity of a management algorithm.
Description
Technical Field
The present invention relates to the field of flash memory management technologies, and in particular, to a method for managing a bidirectional linked list of a flash memory device and a flash memory storage device.
Background
The flash memory structure is composed of a plurality of physical blocks, the erasing work of the flash memory is also the physical block unit, and generally, when the flash memory is operated, the flash memory is managed by the concept of taking one block as a unit. In this management mode, there will be multiple sequences to represent the state or type of each physical block;
because the number of the flash memory physical blocks is hundreds and thousands, and different sequences are required to represent the attributes or states of different physical blocks in the management process, a considerable memory space is consumed to store the sequence tables in the conventional method, which causes unnecessary waste of cache space and increases the complexity of management.
Disclosure of Invention
The application provides a method for managing a bidirectional linked list of a flash memory device and the flash memory device, which can effectively satisfy the management and maintenance of a plurality of physical block sequences of different types by adopting a method of a group of bidirectional linked lists and matching with pointer management of different types, thereby being capable of more effectively using a buffer space and reducing the complexity of a management algorithm.
The application adopts the following technical means for solving the technical problems:
the application provides a method for managing a bidirectional linked list of flash memory equipment, which comprises the following steps:
acquiring a flash memory device, and calibrating a plurality of physical blocks of the flash memory device;
creating a bidirectional linked list according to a plurality of physical blocks of the flash memory storage device, wherein the bidirectional linked list is provided with a Prev array and a Next array, the Prev array records the serial number of the previous position of each physical block linked list, and the Next array records the serial number of the Next position of each physical block linked list;
determining a first category range with a plurality of physical blocks on a double linked list by a Head pointer and a Tail pointer, and respectively determining the category ranges of all the physical blocks by adopting a plurality of Head pointers and a plurality of Tail pointers;
and inputting an operation instruction to the Head pointer and the Tail pointer so as to control the category range to execute management operations of adding, taking out and adjusting the range.
Further, the step of determining a first class range having a number of physical blocks on a doubly linked list by a Head pointer and a Tail pointer comprises:
setting the starting positions and the end positions of the Head pointer and the Tail pointer according to the use requirements of a plurality of physical blocks; the Head pointer is used for marking the position of a starting point, and the Tail pointer is used for marking the position of an ending point.
Further, the step of inputting operation instructions to the Head pointer and the Tail pointer to control the category range to perform the management operations of adding, fetching and adjusting the range includes:
adding a range adjustment probe to a category range formed by a Head pointer and a Tail pointer;
determining whether the category range is saturated through the range adjustment probe to feed back two feedback signals, namely a saturated signal and an unsaturated signal;
if the saturated signal is fed back, the category range is not adjusted;
if the unsaturated signal is fed back, the category range is reduced until the saturated signal is fed back.
Further, the method for identifying the storage content in each category range and combining the category ranges comprises the following steps:
identifying a file suffix name in each of the category ranges;
retrieving the same file suffix name in all the category ranges, modifying a Head pointer and a Tail pointer corresponding to each category range of the same file suffix name into a Head _ A, Tail _ A;
and merging the category ranges according to the same Head pointer and Tail pointer.
The application also provides a flash memory storage device, which comprises a storage medium and an actuator, wherein the storage medium stores the bidirectional linked list, and the actuator executes the bidirectional linked list management method of the flash memory device.
The application provides a method for managing a bidirectional linked list of a flash memory device and the flash memory device, which have the following beneficial effects:
the application provides a method for managing a bidirectional linked list of flash memory equipment, which comprises the following steps:
acquiring a flash memory device, and calibrating a plurality of physical blocks of the flash memory device; creating a bidirectional linked list according to a plurality of physical blocks of the flash memory storage device, wherein the bidirectional linked list is provided with a Prev array and a Next array, the Prev array records the serial number of the previous position of each physical block linked list, and the Next array records the serial number of the Next position of each physical block linked list; determining a first category range with a plurality of physical blocks on a double linked list by a Head pointer and a Tail pointer, and respectively determining the category ranges of all the physical blocks by adopting a plurality of Head pointers and a plurality of Tail pointers; and inputting an operation instruction to the Head pointer and the Tail pointer to control the category range to execute the management operations of adding, taking out and range adjustment, and adopting a group of two-way linked lists to be matched with different types of pointer management to effectively meet the management and maintenance of a plurality of different types of physical block sequences, thereby more effectively using a cache space and reducing the complexity of a management algorithm.
Drawings
FIG. 1 is a schematic flow chart illustrating an embodiment of a method for managing a doubly linked list of a flash memory device according to the present application;
FIG. 2 is a schematic diagram of a bidirectional linked list principle of an embodiment of a method for managing a bidirectional linked list of a flash memory device according to the present application;
fig. 3 is a schematic diagram of a doubly linked list principle of another embodiment of a method for managing a doubly linked list of a flash memory device according to the present application.
The implementation, functional features and advantages of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It is noted that the terms "comprises," "comprising," and "having" and any variations thereof in the description and claims of this application and the drawings described above are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. In the claims, the description and the drawings of the specification of the present application, relational terms such as "first" and "second", and the like, may be used solely to distinguish one entity/action/object from another entity/action/object without necessarily requiring or implying any actual such relationship or order between such entities/actions/objects.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
Referring to fig. 1, a schematic flow chart of a method for managing a doubly linked list of a flash memory device in an embodiment of the present application is shown;
the application provides a method for managing a bidirectional linked list of a flash memory device, which comprises the following steps:
s1, acquiring the flash memory device and calibrating a plurality of physical blocks of the flash memory device;
s2, creating a double linked list according to the physical blocks of a plurality of flash memory devices, wherein the double linked list is provided with a Prev array and a Next array, the Prev array records the serial number of the previous position of each physical block linked list, and the Next array records the serial number of the Next position of each physical block linked list;
s3, determining a first category range with a plurality of physical blocks on a double linked list by a Head pointer and a Tail pointer, and respectively determining the category ranges of all the physical blocks by adopting a plurality of Head pointers and a plurality of Tail pointers;
s4, input operation instructions to the Head pointer and Tail pointer to control the category range to execute the management operations of adding, fetching and range adjustment.
Referring to fig. 2 and 3, schematic diagrams of a doubly linked list are shown;
specifically, the step of determining a first class range having a plurality of physical blocks on a doubly linked list by a Head pointer and a Tail pointer comprises:
setting the starting positions and the end positions of a Head pointer and a Tail pointer according to the use requirements of a plurality of physical blocks; the Head pointer marks the position of the starting point, and the Tail pointer marks the position of the ending point.
The invention mainly manages a plurality of sequence lists with different attributes or classifications on a shared linked list framework by matching different classified pointer classes through a structure of a bidirectional linked list, thereby reducing the waste of cache resources and the management complexity.
When the flash memory device is initialized, two arrays with the number of cells n are constructed, i.e., Prev [ n ] and Next [ n ], respectively. Index 0-n-1 respectively represents the physical block number of the flash memory, the Prev array records the physical block number of the previous position of each physical block in the chain table, otherwise, the Next array records the number of the Next physical block, when the physical block is the starting point of the sequence, the value recorded in the Prev array is an invalid value, and similarly, when one physical block is the end point of the sequence, the value recorded in the Next array is an invalid value. During initialization, the Prev and the Next arrays are sorted according to the sequence number of the physical block;
after the bidirectional linked list is constructed, respective initial positions and end positions can be set according to the use requirements of the sequence types, and the management effect of the shared linked list of the sequence types can be achieved only by using a Head pointer and a Tail pointer corresponding to the type;
based on the framework, if a physical block needs to be added or taken out of a certain type of sequence, effective processing can be carried out only by adjusting the values in the Head/Tail pointer and the Prev/Next linked list; the architecture can also simultaneously support a plurality of sequences of different types, and the requirement can be met only by adding a Head/Tail pointer.
In one embodiment, the step of inputting operation commands to the Head pointer and the Tail pointer to control the category scope to perform the management operations of adding, fetching and scope adjustment comprises:
adding a range adjustment probe to a category range formed by a Head pointer and a Tail pointer;
determining whether the category range is saturated or not through a range adjustment probe to feed back two feedback signals, namely a saturated signal and an unsaturated signal;
if the saturated signal is fed back, the category range is not adjusted;
if the unsaturated signal is fed back, the category range is reduced until the saturated signal is fed back.
In one embodiment, the method for identifying the storage content in each category range to be merged with the category range comprises the following steps:
identifying file suffix names in the respective category ranges;
searching the same file suffix name in all the category ranges, modifying a Head pointer and a Tail pointer corresponding to each category range of the same file suffix name into a Head _ A, Tail _ A;
and merging the category ranges according to the same Head pointer and Tail pointer.
The application also provides a flash memory storage device, which comprises a storage medium and an actuator, wherein the storage medium stores the bidirectional linked list, and the actuator executes the bidirectional linked list management method of the flash memory device.
In conclusion, the flash memory storage device is obtained, and a plurality of physical blocks of the flash memory storage device are calibrated; creating a bidirectional linked list according to a plurality of physical blocks of the flash memory storage device, wherein the bidirectional linked list is provided with a Prev array and a Next array, the Prev array records the serial number of the previous position of each physical block linked list, and the Next array records the serial number of the Next position of each physical block linked list; determining a first category range with a plurality of physical blocks on a double linked list by a Head pointer and a Tail pointer, and respectively determining the category ranges of all the physical blocks by adopting a plurality of Head pointers and a plurality of Tail pointers; and inputting an operation instruction to the Head pointer and the Tail pointer to control the category range to execute the management operations of adding, taking out and range adjustment, and adopting a group of two-way linked lists to be matched with different types of pointer management to effectively meet the management and maintenance of a plurality of different types of physical block sequences, thereby more effectively using a cache space and reducing the complexity of a management algorithm.
Although embodiments of the present application have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the application, the scope of which is defined in the appended claims and their equivalents.
Claims (5)
1. A method for managing a doubly linked list of a flash memory device, comprising:
acquiring a flash memory device, and calibrating a plurality of physical blocks of the flash memory device;
creating a bidirectional linked list according to a plurality of physical blocks of the flash memory storage device, wherein the bidirectional linked list is provided with a Prev array and a Next array, the Prev array records the serial number of the previous position of each physical block linked list, and the Next array records the serial number of the Next position of each physical block linked list;
determining a first category range with a plurality of physical blocks on a double linked list by a Head pointer and a Tail pointer, and respectively determining the category ranges of all the physical blocks by adopting a plurality of Head pointers and a plurality of Tail pointers;
and inputting an operation instruction to the Head pointer and the Tail pointer so as to control the category range to execute management operations of adding, taking out and adjusting the range.
2. The method of claim 1, wherein determining a first class range on the doubly linked list with a Head pointer and a Tail pointer comprises:
setting the starting positions and the end positions of the Head pointer and the Tail pointer according to the use requirements of a plurality of physical blocks; the Head pointer is used for marking the position of a starting point, and the Tail pointer is used for marking the position of an ending point.
3. The method of claim 1, wherein the step of inputting operation commands to the Head pointer and the Tail pointer to control the class range to perform join, retrieve, and range adjustment management operations comprises:
adding a range adjustment probe to a category range formed by a Head pointer and a Tail pointer;
determining whether the category range is saturated through the range adjustment probe to feed back two feedback signals, namely a saturated signal and an unsaturated signal;
if the saturated signal is fed back, the category range is not adjusted;
if the unsaturated signal is fed back, the category range is reduced until the saturated signal is fed back.
4. The method of claim 1, wherein identifying the storage content in each of the category ranges by merging with the category ranges comprises:
identifying a file suffix name in each of the category ranges;
retrieving the same file suffix name in all the category ranges, modifying a Head pointer and a Tail pointer corresponding to each category range of the same file suffix name into a Head _ A, Tail _ A;
and merging the category ranges according to the same Head pointer and Tail pointer.
5. A flash memory device comprising a storage medium and an executor, wherein the storage medium stores the doubly linked list of any one of claims 1 to 4, and the executor executes the method for managing doubly linked list of a flash memory device of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010740009.1A CN112068769B (en) | 2020-07-28 | 2020-07-28 | Flash memory device bidirectional linked list management method and flash memory storage device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010740009.1A CN112068769B (en) | 2020-07-28 | 2020-07-28 | Flash memory device bidirectional linked list management method and flash memory storage device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112068769A true CN112068769A (en) | 2020-12-11 |
| CN112068769B CN112068769B (en) | 2023-11-14 |
Family
ID=73657769
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010740009.1A Active CN112068769B (en) | 2020-07-28 | 2020-07-28 | Flash memory device bidirectional linked list management method and flash memory storage device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112068769B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101329656A (en) * | 2008-05-06 | 2008-12-24 | 无锡紫芯集成电路系统有限公司 | Management method of Nand-Flash memory system |
| CN101425041A (en) * | 2007-10-30 | 2009-05-06 | 安凯（广州）软件技术有限公司 | Optimizing method for establishing FAT file systems on NAND FLASH memory |
| CN101740110A (en) * | 2009-12-17 | 2010-06-16 | 中兴通讯股份有限公司 | Method and device for erasure balance of Nand Flash |
| US20120324145A1 (en) * | 2011-06-15 | 2012-12-20 | Phison Electronics Corp. | Memory erasing method, memory controller, and memory storage apparatus |
| CN102866956A (en) * | 2012-09-14 | 2013-01-09 | 上海宝存信息科技有限公司 | System and method for data real-time tracking and storage based on solid-state storage medium |
| CN104239564A (en) * | 2014-09-28 | 2014-12-24 | 深圳市锐明视讯技术有限公司 | Method and device for organizing and repairing indexes of files |
| CN104679440A (en) * | 2013-11-29 | 2015-06-03 | 深圳市国微电子有限公司 | Flash memory array management method and device |
| CN106844227A (en) * | 2017-01-14 | 2017-06-13 | 郑州云海信息技术有限公司 | Solid state hard disc abrasion equilibrium method and device based on grouping mechanism |
| CN108121503A (en) * | 2017-08-08 | 2018-06-05 | 鸿秦（北京）科技有限公司 | A kind of NandFlash address of cache and block management algorithm |
| CN109634960A (en) * | 2018-12-04 | 2019-04-16 | 深圳大学 | Key assignments date storage method, device, equipment and storage medium |
| US10261704B1 (en) * | 2016-06-29 | 2019-04-16 | EMC IP Holding Company LLC | Linked lists in flash memory |
| CN109656481A (en) * | 2018-12-14 | 2019-04-19 | 成都三零嘉微电子有限公司 | A method of it improving smart card document system FLASH and the service life is written |
-
2020
- 2020-07-28 CN CN202010740009.1A patent/CN112068769B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425041A (en) * | 2007-10-30 | 2009-05-06 | 安凯（广州）软件技术有限公司 | Optimizing method for establishing FAT file systems on NAND FLASH memory |
| CN101329656A (en) * | 2008-05-06 | 2008-12-24 | 无锡紫芯集成电路系统有限公司 | Management method of Nand-Flash memory system |
| CN101740110A (en) * | 2009-12-17 | 2010-06-16 | 中兴通讯股份有限公司 | Method and device for erasure balance of Nand Flash |
| US20120324145A1 (en) * | 2011-06-15 | 2012-12-20 | Phison Electronics Corp. | Memory erasing method, memory controller, and memory storage apparatus |
| CN102866956A (en) * | 2012-09-14 | 2013-01-09 | 上海宝存信息科技有限公司 | System and method for data real-time tracking and storage based on solid-state storage medium |
| CN104679440A (en) * | 2013-11-29 | 2015-06-03 | 深圳市国微电子有限公司 | Flash memory array management method and device |
| CN104239564A (en) * | 2014-09-28 | 2014-12-24 | 深圳市锐明视讯技术有限公司 | Method and device for organizing and repairing indexes of files |
| US10261704B1 (en) * | 2016-06-29 | 2019-04-16 | EMC IP Holding Company LLC | Linked lists in flash memory |
| CN106844227A (en) * | 2017-01-14 | 2017-06-13 | 郑州云海信息技术有限公司 | Solid state hard disc abrasion equilibrium method and device based on grouping mechanism |
| CN108121503A (en) * | 2017-08-08 | 2018-06-05 | 鸿秦（北京）科技有限公司 | A kind of NandFlash address of cache and block management algorithm |
| CN109634960A (en) * | 2018-12-04 | 2019-04-16 | 深圳大学 | Key assignments date storage method, device, equipment and storage medium |
| CN109656481A (en) * | 2018-12-14 | 2019-04-19 | 成都三零嘉微电子有限公司 | A method of it improving smart card document system FLASH and the service life is written |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112068769B (en) | 2023-11-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8719206B2 (en) | Pattern-recognition processor with matching-data reporting module | |
| DE112004002848B4 (en) | A microprocessor and method for verifying a memory file in such a microprocessor | |
| US8880488B1 (en) | Efficient extent-based B-tree insertion | |
| CN107102819B (en) | Method and equipment for writing data into solid state disk | |
| DE112011105774B4 (en) | Movable storage that supports in-memory data structures | |
| US8527559B2 (en) | Garbage collector with concurrent flipping without read barrier and without verifying copying | |
| CN107113341A (en) | The system of the high-throughput processing of affairs in the Distributed Relation Database Management System divided for data | |
| DE112012004571T5 (en) | Support incomplete data segments in flash caches | |
| CN109391646A (en) | Message-oriented middleware message acquisition method, device and system | |
| CN111290708B (en) | Data processing method and device of ring buffer area based on dynamic adjustment | |
| CN101470667A (en) | Method for physical internal memory allocation in assigned address range on Linux system platform | |
| KR20160100226A (en) | Method and device for constructing on-line real-time updating of massive audio fingerprint database | |
| JPH01500377A (en) | Apparatus and method for providing a cache memory unit with write operations that utilize two system clock cycles | |
| CN110168532A (en) | Data-updating method and storage device | |
| CN101063976B (en) | Method and equipment for fast deletion of physically clustered data | |
| WO2020244445A1 (en) | Coverage information obtaining method and device | |
| CN106095393B (en) | Merge the system and method for partial write result during retraction phase | |
| US20060224949A1 (en) | Exclusion control method and information processing apparatus | |
| US20180011897A1 (en) | Data processing method having structure of cache index specified to transaction in mobile environment dbms | |
| CN112068769A (en) | Bidirectional linked list management method of flash memory device and flash memory device | |
| US20040181504A1 (en) | Apparatus and method for distribution of work on a doubly linked list among processing threads | |
| CN115795521A (en) | Access control method, device, electronic equipment and storage medium | |
| CN111143326B (en) | Method, apparatus, computer device and storage medium for reducing database operations | |
| CN115509446A (en) | Metadata garbage identification method, device and equipment | |
| CN113849482A (en) | Data migration method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |