CN111459691A - Read-write method and device for shared memory - Google Patents
Read-write method and device for shared memory Download PDFInfo
- Publication number
- CN111459691A CN111459691A CN202010285777.2A CN202010285777A CN111459691A CN 111459691 A CN111459691 A CN 111459691A CN 202010285777 A CN202010285777 A CN 202010285777A CN 111459691 A CN111459691 A CN 111459691A
- Authority
- CN
- China
- Prior art keywords
- write
- read
- read operation
- memory
- thread
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a read-write method and a read-write device for a shared memory, wherein the method comprises the following steps: acquiring read operation information of the memory, wherein the read operation information is used for indicating whether a thread for executing memory read operation exists at present; responding to the read operation information to indicate that a thread for executing the memory read operation does not exist currently, executing a write data lock operation and performing write operation on the memory to update data in the memory, wherein the write data lock is used for preventing the thread from executing the read operation when the write operation is executed; and after the write operation is finished, updating the data version information so as to facilitate the thread to read according to the data version information. The invention can improve the performance of a plurality of threads when reading and writing the memory shared data.
Description
Technical Field
The invention relates to the field of computers, in particular to a read-write method and a read-write device for a shared memory.
Background
Multiple processes executing on a single machine need to share data, so that updating and reading operations are frequent, and in order to synchronize data operations, each process needs to apply a global lock to the shared data when performing reading operations. Under the scenes of more shared data and longer loading time (read operation), the performance is seriously influenced by locking. For example, a plurality of processes access a shared memory simultaneously on the same machine, when one process updates the content of the shared memory, other processes need to read and refresh the shared memory, and at this time, the read operation of each process needs to be locked, and when the locking time is too long, the read operation performance of all processes is seriously affected.
Disclosure of Invention
In view of the above, the present invention provides a method and an apparatus for reading and writing a shared memory, so as to solve at least one of the above-mentioned problems.
According to a first aspect of the present invention, there is provided a method for reading and writing a shared memory, the method comprising: acquiring read operation information of a memory, wherein the read operation information is used for indicating whether a thread for executing memory read operation exists at present; responding to the read operation information to indicate that no thread for executing memory read operation exists at present, executing a write data lock operation and performing write operation on the memory to update data in the memory, wherein the write data lock is used for preventing the thread from executing the read operation when the write operation is executed; and after the write operation is completed, updating the data version information so that the thread can perform read operation according to the data version information.
According to a second aspect of the present invention, there is provided a read/write apparatus for sharing a memory, the apparatus comprising: the information acquisition unit is used for acquiring the read operation information of the memory, wherein the read operation information is used for indicating whether a thread for executing the memory read operation exists at present; the write lock unit is used for responding to the read operation information and indicating that no thread for executing the memory read operation exists currently, and executing write data lock operation, wherein the write data lock is used for preventing the thread from executing the read operation when the write operation is executed; the write operation unit is used for performing write operation on the memory so as to update data in the memory; and the version updating unit is used for updating the data version information after the write operation is completed so as to facilitate the thread to read according to the data version information.
According to a third aspect of the present invention, there is provided an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method when executing the program.
According to a fourth aspect of the invention, the invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the above-mentioned method.
According to the technical scheme, whether a thread for executing the memory read operation exists or not is judged according to the acquired memory read operation information, when the thread does not exist, the write data lock operation can be executed, the memory is written, the data in the memory is updated, and after the write operation is completed, the data version information is updated, so that the thread can perform the read operation according to the data version information.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of a method for reading and writing a shared memory according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a global lock operating principle according to an embodiment of the present invention;
FIG. 3 is a flow chart illustrating a read operation according to an embodiment of the present invention;
FIG. 4 is a flow chart illustrating a write operation according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a write-read application scenario of a shared memory read-write method according to an embodiment of the present invention;
fig. 6 is a schematic view of a read/write application scenario of a shared memory read/write method according to an embodiment of the present invention;
fig. 7 is a schematic diagram of an application scenario between read operations of a shared memory read/write method according to an embodiment of the present invention;
FIG. 8 is a block diagram of a shared memory read/write apparatus according to an embodiment of the present invention;
FIG. 9 is a detailed block diagram of a shared memory read/write apparatus according to an embodiment of the present invention;
FIG. 10 is a schematic diagram of an electronic device according to an embodiment of the invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. 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 invention.
At present, each process needs to be locked for reading, so that the locking time is too long, and the performance of reading of all processes is seriously affected. Embodiments of the present invention are described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart of a method for reading and writing a shared memory according to an embodiment of the present invention, as shown in fig. 1, the method includes:
And step 102, in response to the read operation information indicating that no thread for executing the memory read operation exists currently, executing a write data lock operation and performing a write operation on the memory to update data in the memory, wherein the write data lock is used for preventing the thread from executing the read operation when the write operation is executed.
And 103, after the write operation is completed, updating the data version information so that the thread can perform read operation according to the data version information.
At this point, the write data lock operation is released, after which the thread may perform a read operation.
The method comprises the steps of judging whether a thread for executing the memory read operation exists at present according to the acquired memory read operation information, executing a write data lock operation and performing the write operation on the memory when the thread does not exist, updating data in the memory, and updating data version information after the write operation is completed, so that the thread can perform the read operation according to the data version information.
In actual operation, the read operation information can be represented by a numerical value, and when the thread performs read operation according to the updated data version information, the value of the read operation information is increased; when the read operation of the thread is completed, the read operation information value is decreased.
When the read information value is zero, it indicates that no thread is performing a read operation at this time.
In the specific implementation process, before the thread performs the read operation according to the updated data version information, whether the write data lock is in a release state or not can be judged; when the write data lock is in a release state, the read operation can be executed, the read data lock can be added and the read operation can be carried out, and the read data lock is used for preventing the write operation from being executed when the read operation is executed by the thread.
That is, the read operation lock and the write data lock are mutually exclusive for the read and write operations, and the read operation lock does not restrict the read operations. Therefore, the performance of a plurality of processes for simultaneously performing read operation can be improved.
Fig. 2 is a schematic diagram illustrating an operation principle of a global lock according to an embodiment of the present invention, and as shown in fig. 2, a read operation reference count (i.e., the read operation information) and a data version number (i.e., the data version information) are added to a shared memory area.
The read operation reference count is used for indicating the number of threads currently executing the memory read operation, and when the reference count is not zero, the write operation cannot be executed. The reference count is mainly used to control the mutual exclusion between read and write operations.
The read reference count may be an integer type and stored in the shared memory. Reference counts compiled by different compilers are of different lengths (e.g., 4 bytes compiled out of 32-bit g + +). The number of reference counts needs to be increased/decreased during the process of adding/reading a lock. All processes on the same machine (e.g., computer) can determine from this reference count whether a read lock is not currently released, i.e., the read operation is not complete.
The data version number is to reduce unnecessary read operations, the version number is updated after each write operation, and the execution of a read operation is continued until the version number is found to have changed.
The data version number may be an integer type and stored in the shared memory. The version numbers compiled by different compilers are different lengths (e.g., 4 bytes compiled by 32bit g + +). The write operation is performed to update the version number, for example, by adding 1 to the version number. All processes on the same machine (e.g., computer) can determine from this version number whether the shared memory needs to be reloaded. When the version number is updated, it indicates that new data is added to the memory, and at this time, the shared memory needs to be loaded, i.e., read operation is performed.
In actual operation, the reference count uses one lock, and the version number and the real data in memory use the other lock, and synchronization to the shared region is achieved through the two global locks.
Fig. 3 is a schematic diagram of a read operation flow according to an embodiment of the present invention, as shown in fig. 3, the flow includes:
and step 310, when the reference count is zero, the reference count lock is released, and the read operation flow is ended, which indicates that all the added programs finish loading data.
Wherein, the step 301-306 constitutes the locking of the read operation, and the principle thereof is as follows:
1. and the version number controls whether the data has change, and if the data has no change, the data is directly returned, namely the reading operation flow is ended.
2. Two locks are used, a data lock and a reference count lock. After the read operation is locked, both locks are in a release state, so that no mutual exclusion operation exists between the read operations.
3. Write operations are locked mutually exclusively using the reference count, and write operations are not allowed to be locked when the reference count is not zero.
FIG. 4 is a flow chart of a write operation according to an embodiment of the present invention, as shown in FIG. 4, the flow chart includes:
The step 401-.
For better understanding of the embodiments of the present invention, the following description is made in detail with reference to application scenarios of the shared memory read/write method shown in fig. 5 to 7.
As shown in fig. 5, for write operation and read operation mutual exclusion, when write operation is performed, write lock adding operation is performed first, then write data is started, and a data version number is updated, then write lock is released, and write operation is completed; for the read operation, when the write operation is executed, the read lock addition needs to wait, the write lock can be successfully added after being released, when the write operation is completed, the read lock addition is successful, meanwhile, the read reference count is increased by 1, if the data version number is not changed, the return is carried out (indicating that the data is not updated), otherwise, the data reading is carried out, after the read operation is completed, the read operation release is completed, meanwhile, the read reference count is reduced by 1, and when the read reference count is zero, the read operation is completed.
As shown in fig. 6, for the read operation and the write operation, the mutex is read, when the read operation starts, the read lock is added and the read reference count is increased, when the read operation is released and completed, the read reference count is decreased by 1, until the read reference count is zero, the read operation is completed; at this time, the write lock is successfully added, the write lock is in a waiting state before, the write lock can be successfully added only when the read reference count is 0, and after the write data is completed, the data version number is added, the write lock is released, and the write operation is completed.
As shown in FIG. 7, in order to avoid mutual exclusion between read operations, the time for each process to complete a read operation depends on the scheduling of the operating system.
As can be seen from the above description, the mutual exclusion operation only occurs between the two operations, i.e., the read operation and the write operation, and multiple read operations can occur in parallel and the write operations are mutually exclusive. The embodiment of the invention is suitable for the condition that a plurality of application processes read and write shared resources at high concurrency, and the longer the time consumed by reading and writing the shared resources is, the better the advantage of the read-write lock of the embodiment of the invention can be embodied.
Based on similar inventive concepts, embodiments of the present invention further provide a read/write apparatus for sharing a memory, where the apparatus is preferably configured to implement the steps in the foregoing method embodiments.
Fig. 8 is a block diagram of the shared memory read/write apparatus, and as shown in fig. 8, the apparatus includes: an information acquisition unit 81, a write lock unit 82, a write operation unit 83, and a version update unit 84, wherein:
an information obtaining unit 81, configured to obtain read operation information of a memory, where the read operation information is used to indicate whether a thread for executing a memory read operation exists currently;
a write lock unit 82, configured to execute a write data lock operation in response to the read operation information indicating that a thread that performs a memory read operation does not currently exist, where the write data lock is used to prevent the thread from performing the read operation when the write operation is performed;
a write operation unit 83, configured to perform a write operation on the memory to update data in the memory;
and a version updating unit 84, configured to update the data version information after the write operation is completed, so that a thread performs a read operation according to the data version information.
Whether a thread for executing the memory read operation exists at present is judged according to the memory read operation information acquired by the information acquisition unit 81, when the thread does not exist, the write lock unit 82 can execute the write data lock operation, the write operation unit 83 performs the write operation on the memory to update the data in the memory, and after the write operation is completed, the version update unit 84 updates the data version information, so that the thread can perform the read operation according to the data version information.
Preferably, the read operation information may be represented by a numerical value.
As shown in fig. 9, the above apparatus further includes: and the counting unit 85 is used for increasing the information value of the read operation when the thread performs the read operation according to the updated data version information, and decreasing the information value of the read operation after the execution of the read operation of the thread is finished.
The above-mentioned device still includes: a write lock release unit 86 for releasing the write data lock operation.
In one embodiment, with continued reference to fig. 9, the apparatus further comprises:
a judging unit 87, configured to judge whether the write data lock is in a released state;
a read-add lock unit 88, configured to execute a read data lock operation in response to the write data lock being in a released state, where the read data lock is configured to prevent a write operation from being executed when a thread executes the read operation;
a read operation unit 89 for performing a read operation.
For the specific execution process of each unit, reference may be made to the description in the foregoing method embodiment, and details are not described here again.
In practical operation, the units may be arranged in combination or in a single arrangement, and the present invention is not limited thereto.
FIG. 10 is a schematic diagram of an electronic device according to an embodiment of the invention. The electronic device shown in fig. 10 is a general-purpose data processing apparatus comprising a general-purpose computer hardware structure including at least a processor 1001 and a memory 1002. The processor 1001 and the memory 1002 are connected by a bus 1003. The memory 1002 is adapted to store one or more instructions or programs that are executable by the processor 1001. The one or more instructions or programs are executed by the processor 1001 to implement the steps of the above-described shared memory read/write method.
The processor 1001 may be an independent microprocessor or a set of one or more microprocessors. Thus, the processor 1001 implements the processing of data and the control of other devices by executing commands stored in the memory 1002 to thereby execute the method flows of the embodiments of the present invention as described above. The bus 1003 connects the above components together, and also connects the above components to a display controller 1004 and a display device and an input/output (I/O) device 1005. Input/output (I/O) devices 1005 may be a mouse, keyboard, modem, network interface, touch input device, motion sensing input device, printer, and other devices known in the art. Typically, input/output (I/O) devices 1005 are connected to the system through an input/output (I/O) controller 1006.
The memory 1002 may store, among other things, software components such as an operating system, communication modules, interaction modules, and application programs. Each of the modules and applications described above corresponds to a set of executable program instructions that perform one or more functions and methods described in embodiments of the invention.
The embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the steps of the above-mentioned shared memory read-write method.
In summary, the shared memory read-write scheme provided in the embodiments of the present invention achieves the following effects: (1) no data need to be read without the update data (version number unchanged); (2) after updating data (version number change), multiple read operations are not mutually exclusive; (3) mutual exclusion occurs between write operations, between write operations and read operations, and between read operations. The embodiment of the invention optimizes the efficiency of the global lock, improves the performance when a plurality of processes read and write a large amount of memory shared data simultaneously, and improves the efficiency of accessing the shared memory.
The preferred embodiments of the present invention have been described above with reference to the accompanying drawings. The many features and advantages of the embodiments are apparent from the detailed specification, and thus, it is intended by the appended claims to cover all such features and advantages of the embodiments which fall within the true spirit and scope thereof. Further, since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the embodiments of the invention to the exact construction and operation illustrated and described, and accordingly, all suitable modifications and equivalents may be resorted to, falling within the scope thereof.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principle and the implementation mode of the invention are explained by applying specific embodiments in the invention, and the description of the embodiments is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (10)
1. A method for reading and writing a shared memory, the method comprising:
acquiring read operation information of a memory, wherein the read operation information is used for indicating whether a thread for executing memory read operation exists at present;
responding to the read operation information to indicate that no thread for executing memory read operation exists at present, executing a write data lock operation and performing write operation on the memory to update data in the memory, wherein the write data lock is used for preventing the thread from executing the read operation when the write operation is executed;
and after the write operation is completed, updating the data version information so that the thread can perform read operation according to the data version information.
2. The method of claim 1, wherein the read operation information is represented by a numerical value, the method further comprising:
when the thread carries out reading operation according to the updated data version information, the value of the reading operation information is increased;
when the read operation of the thread is completed, the read operation information value is decreased.
3. The method of claim 1, wherein after the write operation execution is complete, the method further comprises:
the write data lock operation is released.
4. The method of claim 3, wherein before the thread performs a read operation based on the updated data version information, the method further comprises:
judging whether the write data lock is in a release state;
and responding to the condition that the write data lock is in a release state, executing a read data lock operation and performing a read operation, wherein the read data lock is used for preventing the write operation from being executed when the thread executes the read operation.
5. A shared memory read/write apparatus, comprising:
the information acquisition unit is used for acquiring the read operation information of the memory, wherein the read operation information is used for indicating whether a thread for executing the memory read operation exists at present;
the write lock unit is used for responding to the read operation information and indicating that no thread for executing the memory read operation exists currently, and executing write data lock operation, wherein the write data lock is used for preventing the thread from executing the read operation when the write operation is executed;
the write operation unit is used for performing write operation on the memory so as to update data in the memory;
and the version updating unit is used for updating the data version information after the write operation is completed so as to facilitate the thread to read according to the data version information.
6. The apparatus of claim 5, wherein the read operation information is represented by a numerical value, the apparatus further comprising:
and the counting unit is used for increasing the read operation information value when the thread performs read operation according to the updated data version information, and decreasing the read operation information value after the read operation of the thread is completed.
7. The apparatus of claim 5, further comprising:
and the write lock releasing unit is used for releasing the write data lock operation.
8. The apparatus of claim 7, further comprising:
the judging unit is used for judging whether the write data lock is in a release state or not;
the read-add lock unit is used for responding to the situation that the write data lock is in a release state, executing read data lock operation, and the read data lock is used for preventing the write operation from being executed when a thread executes the read operation;
and the reading operation unit is used for performing reading operation.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 4 are implemented when the processor executes the program.
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 of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010285777.2A CN111459691A (en) | 2020-04-13 | 2020-04-13 | Read-write method and device for shared memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010285777.2A CN111459691A (en) | 2020-04-13 | 2020-04-13 | Read-write method and device for shared memory |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111459691A true CN111459691A (en) | 2020-07-28 |
Family
ID=71685275
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010285777.2A Pending CN111459691A (en) | 2020-04-13 | 2020-04-13 | Read-write method and device for shared memory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111459691A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112486694A (en) * | 2020-11-30 | 2021-03-12 | 山东浪潮通软信息科技有限公司 | Network lock processing method and device based on Redis |
| CN112685063A (en) * | 2020-12-30 | 2021-04-20 | 北京天融信网络安全技术有限公司 | Feature library updating method and device, network equipment and readable storage medium |
| CN113407573A (en) * | 2021-06-11 | 2021-09-17 | 广发证券股份有限公司 | Method for realizing concurrent reading and writing of multi-index memory data |
| CN115599575A (en) * | 2022-09-09 | 2023-01-13 | 中电信数智科技有限公司（Cn） | Novel method for solving concurrent activation and deactivation of cluster logical volume |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104572568A (en) * | 2013-10-15 | 2015-04-29 | 阿里巴巴集团控股有限公司 | Read lock operation method, write lock operation method and system |
| CN108804234A (en) * | 2017-04-28 | 2018-11-13 | 腾讯科技（深圳）有限公司 | Data-storage system and its operating method |
| CN109298953A (en) * | 2018-08-29 | 2019-02-01 | 北京机电工程研究所 | A kind of device and method of shared drive reading and writing data |
| CN110377436A (en) * | 2019-07-12 | 2019-10-25 | 清华大学 | Data storage access method, equipment and the device of persistence memory |
-
2020
- 2020-04-13 CN CN202010285777.2A patent/CN111459691A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104572568A (en) * | 2013-10-15 | 2015-04-29 | 阿里巴巴集团控股有限公司 | Read lock operation method, write lock operation method and system |
| CN108804234A (en) * | 2017-04-28 | 2018-11-13 | 腾讯科技（深圳）有限公司 | Data-storage system and its operating method |
| CN109298953A (en) * | 2018-08-29 | 2019-02-01 | 北京机电工程研究所 | A kind of device and method of shared drive reading and writing data |
| CN110377436A (en) * | 2019-07-12 | 2019-10-25 | 清华大学 | Data storage access method, equipment and the device of persistence memory |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112486694A (en) * | 2020-11-30 | 2021-03-12 | 山东浪潮通软信息科技有限公司 | Network lock processing method and device based on Redis |
| CN112486694B (en) * | 2020-11-30 | 2023-07-25 | 浪潮通用软件有限公司 | Redis-based network lock processing method and device |
| CN112685063A (en) * | 2020-12-30 | 2021-04-20 | 北京天融信网络安全技术有限公司 | Feature library updating method and device, network equipment and readable storage medium |
| CN112685063B (en) * | 2020-12-30 | 2023-11-28 | 北京天融信网络安全技术有限公司 | Feature library updating method, device, network equipment and readable storage medium |
| CN113407573A (en) * | 2021-06-11 | 2021-09-17 | 广发证券股份有限公司 | Method for realizing concurrent reading and writing of multi-index memory data |
| CN115599575A (en) * | 2022-09-09 | 2023-01-13 | 中电信数智科技有限公司（Cn） | Novel method for solving concurrent activation and deactivation of cluster logical volume |
| WO2024051468A1 (en) * | 2022-09-09 | 2024-03-14 | 中电信数智科技有限公司 | New method for solving concurrent activation and deactivation of cluster logic volume |
| CN115599575B (en) * | 2022-09-09 | 2024-04-16 | 中电信数智科技有限公司 | Novel method for solving concurrent activation and deactivation of cluster logical volumes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111459691A (en) | Read-write method and device for shared memory | |
| US7031989B2 (en) | Dynamic seamless reconfiguration of executing parallel software | |
| US8996811B2 (en) | Scheduler, multi-core processor system, and scheduling method | |
| US8364909B2 (en) | Determining a conflict in accessing shared resources using a reduced number of cycles | |
| EP3701377B1 (en) | Method and apparatus for updating shared data in a multi-core processor environment | |
| CN110888727B (en) | Method, device and storage medium for realizing concurrent lock-free queue | |
| US20080276025A1 (en) | Lock inference for atomic sections | |
| CN101631328A (en) | Synchronous method performing mutual exclusion access on shared resource, device and network equipment | |
| US20150254113A1 (en) | Lock Spin Wait Operation for Multi-Threaded Applications in a Multi-Core Computing Environment | |
| JP2016517102A (en) | Method and apparatus for processing replay data in a database | |
| US11269692B2 (en) | Efficient sequencer for multiple concurrently-executing threads of execution | |
| US20120144406A1 (en) | Wait on address synchronization interface | |
| CN111666210A (en) | Chip verification method and device | |
| US10360079B2 (en) | Architecture and services supporting reconfigurable synchronization in a multiprocessing system | |
| US20240045787A1 (en) | Code inspection method under weak memory ordering architecture and corresponding device | |
| CN109885489B (en) | Data race detection method and device in driver | |
| CN115905040B (en) | Counter processing method, graphics processor, device and storage medium | |
| US11645124B2 (en) | Program execution control method and vehicle control device | |
| CN112346879B (en) | Process management method, device, computer equipment and storage medium | |
| CN106940626B (en) | Method and system for acquiring difference data among multiple disks of virtual machine | |
| CN110543373B (en) | Method for accessing kernel by user thread | |
| US9141310B1 (en) | Methods and apparatuses for shared state information among concurrently running processes or threads | |
| US20140157279A1 (en) | Information processing apparatus, information processing system, information processing method and control program storage medium | |
| US20130166887A1 (en) | Data processing apparatus and data processing method | |
| CN117632530B (en) | Slave core number adjustment parallel acceleration method based on new generation Shenwei many-core processor |
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 |