CN112256200A - Data read-write method and storage medium - Google Patents
Data read-write method and storage medium Download PDFInfo
- Publication number
- CN112256200A CN112256200A CN202011134287.9A CN202011134287A CN112256200A CN 112256200 A CN112256200 A CN 112256200A CN 202011134287 A CN202011134287 A CN 202011134287A CN 112256200 A CN112256200 A CN 112256200A
- Authority
- CN
- China
- Prior art keywords
- data
- memory
- written
- stored
- local
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000002085 persistent effect Effects 0.000 claims abstract description 25
- 230000007246 mechanism Effects 0.000 claims abstract description 19
- 230000002688 persistence Effects 0.000 claims description 23
- 238000004590 computer program Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 230000006399 behavior Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 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/0604—Improving or facilitating administration, e.g. storage management
-
- 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
-
- 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0674—Disk device
- G06F3/0676—Magnetic disk device
Abstract
The invention discloses a data reading and writing method and a storage medium, wherein the method comprises the following steps: carrying out dirty data marking on data to be written so as to determine whether the data to be written is stored in a memory; and if the data to be written is not stored in the memory, storing the data to be written into the memory, and after the data to be written is stored, persistently storing the data to be written into the memory to the local by using a locking mechanism. Thus, data can be stored in a persistent manner quickly and accurately.
Description
Technical Field
The present invention relates to the field of data storage technologies, and in particular, to a data reading and writing method and a storage medium.
Background
With the rapid development of new energy vehicles, the vehicle central control system is changed from the previous Linux system to an android system, and the central control system and an android application program attached to the central control system are becoming more and more important.
Android applications usually store a large amount of data such as user behavior habits, when a large amount of data is stored, it is becoming more and more important to quickly and accurately perform data persistence storage, and in the related art, data storage is performed by using SharedPreferences, which cannot meet the above requirements at the same time.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art. Therefore, a first objective of the present invention is to provide a data reading and writing method, which can perform data persistent storage quickly and accurately.
A second object of the invention is to propose a computer-readable storage medium.
In order to achieve the above object, an embodiment of a first aspect of the present invention provides a data reading and writing method, including the following steps: carrying out dirty data marking on data to be written so as to determine whether the data to be written is stored in a memory; and if the data to be written is not stored in the memory, storing the data to be written into the memory, and after the data to be written is stored, persistently storing the data to be written into the memory to the local by using a locking mechanism.
According to the data reading and writing method provided by the embodiment of the invention, whether the data to be written is stored in the memory is determined by carrying out dirty data marking on the data to be written, if the data to be written is not stored in the memory, the data to be written is stored in the memory, so that the data writing frequency can be reduced, the bottleneck of slow file writing is solved, and then the data to be written is persistently stored to the local from the memory by using a locking mechanism after the data to be written is stored, so that the data can be persistently stored by only one thread at the same time, the correctness of data writing is ensured, and the data can be stored persistently and quickly and accurately.
According to one embodiment of the invention, the memory is a ConcurrentHashMap-based memory.
According to an embodiment of the present invention, the marking the data to be written with dirty data to determine whether the data to be written has been stored in the memory includes: acquiring an ID value of data to be written, and determining whether the ID value is stored in a memory; if the ID value is stored in the memory, determining whether the data to be written is the same as the data corresponding to the ID value in the memory, if so, determining that the data to be written is already stored in the memory, otherwise, determining that the data to be written is not stored in the memory; and if the ID value is not stored in the memory, determining that the data to be written is not stored in the memory.
According to an embodiment of the present invention, persisting data to be written from a memory to a local using a locking mechanism includes: setting a data persistence flag bit by using atomic data AtomicBoolean, and locking a current data persistence storage thread by using a concurrent programming lock ReentrntLock; and after locking is finished, persistently storing the data to be written in the memory to the local, and recovering the data persistence marking bit after the persistent storage is finished.
According to an embodiment of the present invention, the data reading and writing method further includes: determining whether other data persistence storage threads store data to the local persistence; if so, carrying out dirty data marking on the local data to determine whether the local data is the same as the data in the memory; and if not, updating the data in the memory by using a locking mechanism according to the local data.
According to an embodiment of the present invention, updating data in the memory according to local data by using a locking mechanism includes: setting a data updating mark bit by using atomic data AtomicBoolean, and locking a current data updating thread by using a concurrent programming lock ReentrntLock; and after locking is completed, storing the local data into the memory, and after the storage is completed, recovering the data updating mark bit.
According to an embodiment of the present invention, the data reading and writing method further includes: determining whether the local data is deleted; and if the data is deleted, clearing the corresponding data in the memory.
According to an embodiment of the present invention, the data reading and writing method further includes: determining whether an attribute object corresponding to data to be written exists in a memory by using a least recently used algorithm LrucCache, wherein the attribute object comprises a data interface; if yes, calling a data interface in the attribute object to receive data to be written; and if the attribute object does not exist, creating the attribute object, and receiving the data to be written by using a data interface in the created attribute object.
According to an embodiment of the present invention, the data reading and writing method further includes: and adopting an asynchronous thread mode to store the data to be written into the local from the memory in a persistent mode.
To achieve the above object, a computer-readable storage medium is provided in an embodiment of the second aspect of the present invention, on which a computer program is stored, and the computer program is executed by a processor to implement the steps of the above method.
According to the computer-readable storage medium of the embodiment of the invention, by executing the data reading and writing method, data can be stored in a persistent mode quickly and accurately.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a flow chart of a method for reading and writing data according to one embodiment of the invention;
FIG. 2 is a diagram illustrating data reading and writing according to an embodiment of the present invention;
fig. 3 is a flowchart of a data read/write method according to another embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
A data read/write method and a storage medium according to an embodiment of the present invention will be described with reference to the accompanying drawings.
Fig. 1 is a flowchart of a data reading and writing method according to an embodiment of the present invention, and referring to fig. 1, the data reading and writing method may include the following steps:
step S101, perform dirty data marking on the data to be written to determine whether the data to be written has been stored in the memory. The memory may be a memory based on a ConcurrentHashMap.
It should be noted that, referring to fig. 2, when data is stored, data to be written may be stored in the memory for caching, and then persistently stored from the memory to the local. The data to be written refers to external data which needs to be persistently stored to the local, such as user behavior habit data. The memory can be a memory based on ConcurrentHashMap, and has higher read-write efficiency compared with SharedPreferences when a large amount of data is read and written, so that the data read-write performance can be effectively improved, and the requirement of continuously reading and writing data with high performance is met. The local area can be a hard disk, a magnetic disk and other storage devices.
When the data to be written is stored in the memory, dirty data marking can be firstly carried out on the data to be written so as to determine whether the data to be written is stored in the memory or not, if the data to be written is stored, the data to be written is not stored in the memory any more, so that the data writing frequency can be effectively reduced, and the bottleneck of slow file writing is solved; and if not, storing the data to be written into the memory.
In one embodiment, the marking the data to be written with dirty data to determine whether the data to be written has been stored in the memory comprises: acquiring an ID value of data to be written, and determining whether the ID value is stored in a memory; if the ID value is stored in the memory, determining whether the data to be written is the same as the data corresponding to the ID value in the memory, if so, determining that the data to be written is already stored in the memory, otherwise, determining that the data to be written is not stored in the memory; and if the ID value is not stored in the memory, determining that the data to be written is not stored in the memory.
Specifically, before writing the data to be written into the memory, dirty data marking is performed, specifically, an ID value of the data to be written may be obtained first, and then it is determined whether the ID value already exists in the memory (multiple ID values may exist in the memory, and each ID value corresponds to corresponding data), if so, it is further determined whether the data corresponding to the ID value in the memory is the same as the data to be written, if so, it indicates that the data to be written is the same as the data in the memory, at this time, no subsequent operation is performed, that is, the data to be written is not repeatedly written, otherwise, the data to be written is stored in the memory; if the data to be written does not exist, the data to be written is not stored in the memory, and at this time, the data to be written can be stored in the memory.
Step S102, if the data to be written is not stored in the memory, the data to be written is stored in the memory, and after the data to be written is stored, the data to be written is stored from the memory to the local in a persistent mode through a locking mechanism.
After the data to be written is stored in the memory, the data to be written is stored to the local from the memory in a persistent mode, in the process, a locking mechanism is used for ensuring that only one thread performs data persistent storage at the same time, and the problem that local data are disordered due to simultaneous persistent storage of a plurality of threads is solved.
In one embodiment, the persisting the data to be written from the memory to the local using a locking mechanism includes: setting a data persistence flag bit by using atomic data AtomicBoolean, and locking a current data persistence storage thread by using a concurrent programming lock ReentrntLock; and after locking is finished, persistently storing the data to be written in the memory to the local, and recovering the data persistence marking bit after the persistent storage is finished.
That is to say, when data persistence storage is performed, an atomic data atomicBoolean is used to set a data persistence flag bit to inform a system CPU that a thread currently performs data persistence storage, and a concurrent programming lock ReentrntLock is used to lock the thread to ensure that only one thread performs data persistence storage at the same time and ensure the safety of the thread, then data in a memory is copied to the local to realize data persistence storage, and after the copying is completed, the data persistence flag bit is recovered to inform the system that the current thread has been finished, and other threads can perform persistence storage to the local, so that local data confusion caused by multiple threads performing persistence storage to the same local at the same time is effectively avoided.
It should be noted that, when the data to be written is persistently stored to the local, the file read cache buffer input stream and the file channel FileChannel may be used for caching, so as to improve the data writing speed.
In the embodiment, the data to be written is cached through the memory based on the ConcurrentHashMap, the data reading and writing performance can be effectively improved, the data reading and writing rapidity is ensured, meanwhile, the data writing frequency can be effectively reduced by using the dirty data mark, the bottleneck of slow file writing is solved, the locking mechanism can be used for ensuring that only one thread performs data persistent storage at the same time, and the data writing accuracy is ensured.
In an embodiment, referring to fig. 3, the data reading and writing method further includes:
step S201, determine whether there are other data persistence storage threads to store data to the local persistence.
It should be noted that, during data writing, data writing is often performed by multiple threads, and during data reading, data is read from a memory first, and if the local data has changed, the data read from the memory will be error data, so that the local file can be monitored by the file monitoring fileserver, and if there is another thread performing a write operation on the local file, the fileserver monitors an event that the write ends at the end of the write, and according to the event, it can be determined that there is another data persistent storage thread to store data to the local persistent storage.
Step S202, if yes, perform dirty data marking on the local data to determine whether the local data is the same as the data in the memory.
When determining that other data persistence storage threads store data to the local persistence, the local data needs to be loaded into the memory to ensure that the data in the memory is the same as the local data, so that data confusion caused by inconsistency of the data in the memory and the local data is avoided, the consistency of data reading and writing in a multi-thread environment is ensured, and the problem that the data consistency cannot be ensured when SharedPreferences is used in the multi-thread environment is effectively solved. For the specific dirty data marking process, reference may be made to the foregoing description, and details are not repeated here.
In step S203, if the data in the memory is not the same, the data in the memory is updated according to the local data by using the locking mechanism.
When the local data is loaded into the memory, dirty data marking can be carried out on the local data to determine whether the local data is the same as the data in the memory, if so, the local data does not need to be loaded into the memory, the data reading (from local reading into the memory) times are effectively reduced, and the bottleneck of slow file reading is solved; if the local data are different from the local data, updating the data in the memory according to the local data, namely loading the local data into the memory, and in the process, only one thread can update the data at the same time by using a locking mechanism, so that the data is prevented from being written into the local memory to cause data confusion while the data is updated.
In one embodiment, updating the data in the memory according to the local data by using the locking mechanism includes: setting a data updating mark bit by using atomic data AtomicBoolean, and locking a current data updating thread by using a concurrent programming lock ReentrntLock; and after locking is completed, storing the local data into the memory, and after the storage is completed, recovering the data updating mark bit.
That is to say, when data updating is performed, the atomicity data atomicBoolean is used to set a data updating flag bit to inform a system CPU that a thread currently performs data updating, and the thread is locked by using a concurrent programming lock ReentrntLock to ensure that only one thread runs at the same time, then local data is copied to a memory, and after the copying is completed, the data updating flag bit is recovered to inform that the current thread of the system is finished, and other threads can perform persistent storage on the local, so that local data confusion caused by simultaneous operation on the same local by a plurality of threads is effectively avoided.
It should be noted that, when the local data is loaded into the memory, the file read cache buffer input stream and the file channel FileChannel may be used for caching, so as to improve the data update, i.e., the read speed.
In the embodiment, the dirty data mark can effectively reduce the data updating, namely reading times, and solve the bottleneck of slow file reading, and meanwhile, the locking mechanism can ensure that only one thread runs at the same time, so that the data updating, namely reading accuracy is ensured.
It should be noted that, in the above example, each thread may be managed and scheduled through the thread pool, so as to avoid that multiple threads compete for system CPU resources at the same time, which results in that the threads cannot execute and block.
In an embodiment, the above method for reading and writing data further includes: determining whether the local data is deleted; and if the data is deleted, clearing the corresponding data in the memory. That is, when the file monitoring FileObserver monitors that the local file is deleted, the memory is emptied.
In an embodiment, the above method for reading and writing data further includes: determining whether an attribute object corresponding to data to be written exists in a memory by using a least recently used algorithm LrucCache, wherein the attribute object comprises a data interface; if yes, calling a data interface in the attribute object to receive data to be written; and if the attribute object does not exist, creating the attribute object, and receiving the data to be written by using a data interface in the created attribute object.
It should be noted that, when the data to be written is stored in the memory, an attribute object needs to be created for the data to be written, where the attribute object includes a data interface, and the data interface matches with the data type of the data to be written, and specifically, the attribute object may obtain a required data interface by inheriting a sharedpreference. In addition, a serial interface Serializable can be added to the attribute object according to actual requirements. Then, the data to be written is received by using the data interface in the attribute object.
In the process, the created object can be managed by using the least recently used algorithm LruCache, for example, the object created for the first time is stored in a queue list of a memory, then when data to be written is received each time, the corresponding object is obtained from the queue list, and if the data to be written does not exist in the queue list, the object creation is performed again, so that memory occupation caused by repeated creation is avoided, and therefore the effect of reducing the memory occupation is achieved, and the memory occupation is lower than that of sharedpreference.
In an embodiment, the above method for reading and writing data further includes: and adopting an asynchronous thread mode to store the data to be written into the local from the memory in a persistent mode.
That is to say, the application program can be run in a multi-thread multi-task manner, so that when one thread is used to persistently store data to be written into the memory to the local, other threads (excluding other data persistent storage threads) will not be affected, such as a control thread and a display thread, so as to effectively avoid the occurrence of the phenomenon that the application program is stuck because other threads cannot continue to run when a large amount of data is written into the memory due to the synchronous thread manner. For example, when SharedPreferences is used for data saving, synchronization is used, and when a large amount of data needs to be written, a large amount of time is consumed, so that an application program such as a page is stuck and other operations cannot be performed.
In summary, according to the data read-write method of the embodiment of the present invention, the memory based on the ConcurrentHashMap is used to improve the data read-write performance, the locking mechanism and atomicity are used to ensure that only one thread performs data read-write at the same time, the dirty data flag is used to reduce the data synchronization times, and the least recently used algorithm is used to perform cache management to reduce the memory usage, so that the data read-write method can simultaneously meet the requirements of fast, synchronous and accurate data read-write, and the requirement of reading and writing a large amount of data.
Further, an embodiment of the invention proposes a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the above-mentioned method.
According to the computer-readable storage medium of the embodiment of the invention, by executing the data reading and writing method, data can be stored in a persistent mode quickly and accurately.
It should be noted that the logic and/or steps represented in the flowcharts or otherwise described herein, such as an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the present invention, unless otherwise expressly stated or limited, the terms "mounted," "connected," "secured," and the like are to be construed broadly and can, for example, be fixedly connected, detachably connected, or integrally formed; can be mechanically or electrically connected; they may be directly connected or indirectly connected through intervening media, or they may be connected internally or in any other suitable relationship, unless expressly stated otherwise. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
Claims (10)
1. A data read-write method is characterized by comprising the following steps:
carrying out dirty data marking on data to be written so as to determine whether the data to be written is stored in a memory;
and if the data to be written is not stored in the memory, storing the data to be written into the memory, and after the data to be written is stored, persistently storing the data to be written into the memory to the local by using a locking mechanism.
2. A method as claimed in claim 1, wherein said memory is a ConcurrentHashMap-based memory.
3. The method according to claim 1, wherein the marking the data to be written with dirty data to determine whether the data to be written has been stored in the memory comprises:
acquiring the ID value of the data to be written, and determining whether the ID value is stored in the memory;
if the ID value is stored in the memory, determining whether the data to be written is the same as the data corresponding to the ID value in the memory, if so, determining that the data to be written is already stored in the memory, otherwise, determining that the data to be written is not stored in the memory;
and if the ID value is not stored in the memory, determining that the data to be written is not stored in the memory.
4. The data reading and writing method according to claim 1, wherein the persistently storing the data to be written from the memory to the local by using a locking mechanism comprises:
setting a data persistence flag bit by using atomic data AtomicBoolean, and locking a current data persistence storage thread by using a concurrent programming lock ReentrntLock;
and after locking is finished, the data to be written is stored to the local from the memory in a persistent mode, and after persistent storage is finished, the data persistent marking bit is recovered.
5. A method for reading and writing data according to claim 4, further comprising:
determining whether there are other data persistent storage threads to store data to the local persistent storage;
if so, performing dirty data marking on the local data to determine whether the local data is the same as the data in the memory;
and if not, updating the data in the memory by using a locking mechanism according to the local data.
6. The method according to claim 5, wherein the updating the data in the memory according to the local data by using a locking mechanism includes:
setting a data updating mark bit by using atomic data AtomicBoolean, and locking a current data updating thread by using a concurrent programming lock ReentrntLock;
and after locking is finished, storing the local data into the memory, and recovering the data updating mark bit after the storage is finished.
7. A method for reading and writing data according to claim 1, further comprising:
determining whether the local data is deleted;
and if the data is deleted, clearing the corresponding data in the memory.
8. A method for reading and writing data according to any one of claims 1 to 7, further comprising:
determining whether an attribute object corresponding to the data to be written exists in the memory by using a least recently used algorithm LrucCache, wherein the attribute object comprises a data interface;
if yes, calling a data interface in the attribute object to receive the data to be written;
and if the attribute object does not exist, creating the attribute object, and receiving the data to be written by using a data interface in the created attribute object.
9. A method for reading and writing data according to any one of claims 1 to 7, further comprising: and adopting an asynchronous thread mode to store the data to be written into the memory from the memory to the local in a persistent mode.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011134287.9A CN112256200A (en) | 2020-10-21 | 2020-10-21 | Data read-write method and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011134287.9A CN112256200A (en) | 2020-10-21 | 2020-10-21 | Data read-write method and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112256200A true CN112256200A (en) | 2021-01-22 |
Family
ID=74263058
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011134287.9A Pending CN112256200A (en) | 2020-10-21 | 2020-10-21 | Data read-write method and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112256200A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160292014A1 (en) * | 2015-03-30 | 2016-10-06 | Freescale Semiconductor, Inc. | Method, apparatus, and system for unambiguous parameter sampling in a heterogeneous multi-core or multi-threaded processor environment |
| CN106055281A (en) * | 2016-06-29 | 2016-10-26 | 广州华多网络科技有限公司 | Data writing method and device |
| CN107851037A (en) * | 2015-07-22 | 2018-03-27 | 华为技术有限公司 | The consistency protocol that hardware transactional in the shared memory using locking and unlocked nonvolatile storage stores |
| CN109597587A (en) * | 2018-12-10 | 2019-04-09 | 浪潮(北京)电子信息产业有限公司 | A kind of method for writing data, medium and Nonvolatile memory |
| CN110221987A (en) * | 2019-05-05 | 2019-09-10 | 福建天泉教育科技有限公司 | Date storage method, storage medium in the case of system emergency |
| CN111124641A (en) * | 2019-12-12 | 2020-05-08 | 中盈优创资讯科技有限公司 | Data processing method and system using multiple threads |
-
2020
- 2020-10-21 CN CN202011134287.9A patent/CN112256200A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160292014A1 (en) * | 2015-03-30 | 2016-10-06 | Freescale Semiconductor, Inc. | Method, apparatus, and system for unambiguous parameter sampling in a heterogeneous multi-core or multi-threaded processor environment |
| CN107851037A (en) * | 2015-07-22 | 2018-03-27 | 华为技术有限公司 | The consistency protocol that hardware transactional in the shared memory using locking and unlocked nonvolatile storage stores |
| CN106055281A (en) * | 2016-06-29 | 2016-10-26 | 广州华多网络科技有限公司 | Data writing method and device |
| CN109597587A (en) * | 2018-12-10 | 2019-04-09 | 浪潮(北京)电子信息产业有限公司 | A kind of method for writing data, medium and Nonvolatile memory |
| CN110221987A (en) * | 2019-05-05 | 2019-09-10 | 福建天泉教育科技有限公司 | Date storage method, storage medium in the case of system emergency |
| CN111124641A (en) * | 2019-12-12 | 2020-05-08 | 中盈优创资讯科技有限公司 | Data processing method and system using multiple threads |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11842049B2 (en) | Dynamic cache management in hard drives | |
| US7783851B2 (en) | Methods of reusing log blocks in non-volatile memories and related non-volatile memory devices | |
| US9645920B2 (en) | Adaptive cache memory controller | |
| TWI566097B (en) | Lba bitmap usage | |
| US9959053B2 (en) | Method for constructing NVRAM-based efficient file system | |
| EP2439645B1 (en) | Method and apparatus for storing data in a multi-level cell flash memory device | |
| US8131894B2 (en) | Method and system for a sharing buffer | |
| CN113377291A (en) | Data processing method, device, equipment and medium of cache equipment | |
| CN110347338B (en) | Hybrid memory data exchange processing method, system and readable storage medium | |
| KR102351200B1 (en) | Apparatus and method for setting clock speed/voltage of cache memory based on memory request information | |
| EP2740038B1 (en) | Memory coalescing computer-implemented method, system and apparatus | |
| CN112256200A (en) | Data read-write method and storage medium | |
| JP2015035007A (en) | Computer, control program, and dump control method | |
| CN116561091A (en) | Log storage method, device, equipment and readable storage medium | |
| CN108984117B (en) | Data reading and writing method, medium and equipment | |
| US8234418B1 (en) | Periodic and conditional execution of DMA operations | |
| JP2017201481A (en) | Information processing apparatus, method for controlling information processing apparatus, and program for controlling information processing apparatus | |
| KR101897370B1 (en) | Method and apparatus for replace page | |
| US20220300427A1 (en) | Method for executing a transaction | |
| CN117237178A (en) | Thread bundle execution method and related GPU | |
| JP2007172519A (en) | Information processor, link management method for software module, and program | |
| CN117033000B (en) | Data scheduling method and equipment | |
| EP4033346B1 (en) | Affinity-based cache operation for a persistent storage device | |
| JP6859924B2 (en) | Data storage device | |
| JP3898369B2 (en) | Paging processing apparatus and recording medium |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20231129 Address after: 518000 Baoneng Center, No. 3008 Baoneng North Road, Luohu District, Shenzhen, Guangdong Province Applicant after: Shenzhen Shengbo Hairui Management Co.,Ltd. Address before: 510700 Baoneng Cultural Plaza, 59 lichui street, Huangpu District, Guangzhou City, Guangdong Province Applicant before: Baoneng (Guangzhou) Automobile Research Institute Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20210122 |