CN115080255A - Distributed batch data processing method and system based on concurrency security - Google Patents
Distributed batch data processing method and system based on concurrency security Download PDFInfo
- Publication number
- CN115080255A CN115080255A CN202210750013.5A CN202210750013A CN115080255A CN 115080255 A CN115080255 A CN 115080255A CN 202210750013 A CN202210750013 A CN 202210750013A CN 115080255 A CN115080255 A CN 115080255A
- Authority
- CN
- China
- Prior art keywords
- data
- subset
- cache
- batch
- key
- 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
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/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/526—Mutual exclusion algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (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 provides a distributed batch data processing method and a distributed batch data processing system based on concurrency security, which comprise the following steps: acquiring an onlykey set of batch data based on service division; judging whether the subset of the only set exists in the cache or not, and bringing the only set without the subset into the cache; and executing a service code block in the cache based on the only key set without the subset, and deleting the only key set in the cache after the execution is finished, thereby completing the release of the batch lock. The invention can improve the overall speed of concurrent processing of mass data, reduce the probability of data collision and increase the experience of system users.
Description
Technical Field
The invention belongs to the technical field of computer data processing, and particularly relates to a distributed batch data processing method and system based on concurrency security.
Background
With the development of internet technology, many large websites and applications are deployed in a distributed manner, and the distributed design concept is more and more popular in the development of software technology. The problem of data consistency in a distributed scenario has been a data security issue that is important in project development design. In more and more development and design, the distributed CAP theory is distributed according to different design ideas and principles of realizing Consistency (Consistency), Availability (Availability) and Partition fault tolerance (Partition tolerance) by applying different tools more quickly and efficiently. In many scenarios, we need to ensure the final consistency of data, and many technical solutions have been developed to support, such as distributed locks, distributed transactions, and so on.
A distributed lock can be generally understood as: the control distributed system has sequence to operate the shared resources which are in competition under different threads, and consistency is kept through short mutual exclusion. When the service scene occurs, only one thread can get the lock at the same time, namely the authority for operating the shared resource is ensured; the operation completion round is until the next thread takes the lock to complete the operations it needs and so on to ensure that the resources are processed in order.
The problem of ensuring the security of shared resources from the existing distributed lock is that the efficiency of processing batch data in a concurrent request is low, most of the implementation modes are lock locks corresponding to redis in codes with high concurrent bottleneck, when the same resource is operated, only one thread can be ensured to obtain the lock, and when the thread finishes the operation and releases the lock, other threads obtain the lock and execute the lock in sequence again. The method has the following disadvantages that if each piece of data in the batch needs to interact with the database and the safety of concurrent data is ensured, the execution time of the transaction is prolonged, the conflict probability of resource competition is increased, and the operation experience of the whole system is influenced. Therefore, the distributed batch data processing method based on the concurrent security has important significance.
Disclosure of Invention
In order to solve the technical problems, the invention provides a distributed batch data processing method and system based on concurrency safety, overcomes the defects and shortcomings in the prior art, can improve the overall speed of concurrent processing of batch data, reduces the probability of data collision, and increases the experience of system users.
On one hand, in order to achieve the above object, the present invention provides a distributed batch data processing method based on concurrency security, which includes:
acquiring an only set of batch data based on service division, wherein the only set comprises: a set of unique values that can determine the uniqueness of each piece of data in the batch of data;
judging whether the subset of the only set exists in the cache or not, and bringing the only set without the subset into the cache; judging whether the subset of the only set and the code block brought into the only set to the cache exist in the cache, wherein the code block is contained in a designed distributed lock block to ensure the concurrency security of distributed lock setting;
and executing the service code block in the cache based on the only set without the subset, and deleting the only set in the cache after the execution is finished so as to complete the release of the batch lock.
Optionally, acquiring the onlykey set of the batch data includes:
acquiring data analysis, data structure and service attribute of batch data, and extracting a unique condition of the data;
and combining the unique conditions, and acquiring the only set of batch data through an MD algorithm.
Optionally, before determining whether the subset of the onlykey set exists in the cache, the method further includes: packaging code blocks with unsafe threads into a recursion retry function to obtain the maximum recursion times; wherein the maximum recursion number is the retry number after resource conflict occurs.
Optionally, the determining whether the subset of the onlykey set exists in the cache includes: if the subset does not exist, putting the only set into the cache; and if the subset exists, the only set is brought into the queue of the recursive retry function, and the recursive retry function is triggered until the subset does not exist or the maximum recursive times is reached.
Optionally, executing the service code block in the cache includes:
searching business data corresponding to a database to which the only key set belongs in batch through the only key set without the subset, temporarily storing the business data by using a map after the business data is found, using the only key in the only key set as a key, and using the business data as a value, wherein the map is a data structure;
and searching in the map through the only key, and performing batch updating operation on the values existing in the map and performing batch saving operation on the values not existing in the map.
In another aspect, to achieve the above object, the present invention provides a distributed batch data processing system based on concurrent security, including: the device comprises an acquisition module, a judgment module and a deletion module;
the acquisition module is used for acquiring an only key set of batch data according to service division, wherein the only key set comprises: a set of unique values that can determine the uniqueness of each piece of data in the batch of data;
the judging module is used for judging whether the subset of the only set exists in the cache or not and bringing the only set without the subset into the cache;
and the deleting module is used for executing the service code block in the cache according to the only set without the subset, and deleting the only set in the cache after the execution is finished so as to complete the release of the batch lock.
Optionally, acquiring the onlykey set of the batch data includes:
acquiring data analysis, data structure and service attribute of batch data, and extracting a unique condition of the data;
and combining the unique conditions, and acquiring the only set of batch data through an MD algorithm.
Optionally, before determining whether a subset of the only key set exists in the cache, the method further includes: packaging code blocks with unsafe threads into a recursion retry function to obtain the maximum recursion times; wherein the maximum recursion number is the retry number after resource conflict occurs.
Optionally, the determining whether the subset of the onlykey set exists in the cache includes: if the subset does not exist, putting the only set into the cache; and if the subset exists, the only set is brought into the queue of the recursive retry function, and the recursive retry function is triggered until the subset does not exist or the maximum recursive times is reached.
Optionally, executing the service code block in the cache includes:
searching business data corresponding to a database to which the only key set belongs in batch through the only key set without the subset, temporarily storing the business data by using a map after the business data is found, using the only key in the only key set as a key, and using the business data as a value, wherein the map is a data structure;
and searching in the map through the only key, and performing batch updating operation on the values existing in the map and performing batch saving operation on the values not existing in the map.
Compared with the prior art, the invention has the following advantages and technical effects:
firstly, acquiring an onlykey set of batch data based on business division; then judging whether the subset of the only set exists in the cache or not, and bringing the only set without the subset into the cache; and secondly, executing the service code block in the cache based on the only set without the subset, and deleting the only set in the cache after the execution is finished so as to finish the release of the batch lock. Compared with the prior art, the invention can improve the overall speed of concurrent processing of mass data, reduce the probability of data collision and increase the experience of system users.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application. In the drawings:
fig. 1 is a schematic flowchart of a distributed batch data processing method based on concurrent security according to embodiment 1 of the present invention;
fig. 2 is a schematic flow chart of a manner of acquiring an only key set of batch data according to embodiment 1 of the present invention;
FIG. 3 is a schematic diagram of the overall interaction flow in embodiment 1 of the present invention;
fig. 4 is a schematic structural diagram of a distributed batch data processing system based on concurrent security according to embodiment 2 of the present invention.
Detailed Description
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than presented herein.
Example 1
As shown in fig. 1, the embodiment provides a flow diagram of a distributed batch data processing method based on concurrent security, including:
acquiring an only set of batch data based on service division, wherein the only refers to a field set capable of determining uniqueness of the data in each piece of data or a unique value obtained by an algorithm through the field set with uniqueness;
as shown in fig. 2, acquiring the onlykey set of batch data specifically includes:
acquiring data analysis, data structure and service attribute of batch data, and extracting a unique condition of the data;
combining the unique conditions, and acquiring an only key set of the batch data through an MD algorithm (Message Digest algorithm).
In this embodiment, the online analysis method is: for example: the data A and the data B have no association relation on the service, and the attribute fields are the same; the data is determined to be unique through fields such as 'field A', 'field B' and the like, the default of the fields being the same is the same data, otherwise, the other fields are opposite. The MD5 is encrypted into a unique onlykey as a unique value of the positioning data through several field combinations of 'field a', 'field B', etc.
And (3) extracting resource operation code blocks which are unsafe in threads and packaging the resource operation code blocks into a recursion retry function, wherein the maximum recursion frequency is the retry frequency after resource conflict occurs, and the resource conflict probability is fundamentally reduced.
Judging whether a subset of an only set exists in a cache (the only set exists in a redis and is divided by services); bringing the onlykey set without the subset into a cache; judging whether a subset of the only set and a code block brought into the only set to the cache exist in the cache, wherein the code block is contained in a designed distributed lock block, and the concurrence safety of distributed lock setting is ensured;
before determining whether the subset of the onlykey set exists in the cache, the method further includes: encapsulating a code block (which refers to a logic code block with a data safety problem in a concurrent process in a service execution process) with unsafe threads into a recursion retry function to obtain the maximum recursion times; wherein the maximum recursion number is the retry number after resource conflict occurs.
In this embodiment, if there is no subset of the only set, the only set without the subset is brought into the cache; the code block is contained in the designed distributed lock block, and the concurrency safety of the distributed lock setting is guaranteed. The design idea of the distributed locking block is as follows: 1. the logic for judging the cache and setting the cache is in one lock block, so as to ensure that the condition of data missing judgment caused by the fact that code blocks entering the judgment cache and the setting cache simultaneously do not exist during concurrence; 2. the business logic code block has data unsafe behavior.
The way of executing the service code block in the cache is as follows:
through the only set without the subset, searching the business data corresponding to the database to which the only set belongs in batch, and temporarily storing the business data by using a map after the business data is found (wherein the map refers to a data structure and stores a key-value pair data structure which takes the only set as a key and takes the data as a value, and the key-value pair data structure is hereinafter referred to as map); using an only key in the only key set as a key, and using the service data as a value;
and searching the map through the only key, performing batch updating operation on the values existing in the map, and performing batch saving operation on the values not existing in the map.
The analysis method comprises the following steps: the custom distributed lock is implemented in conjunction with the set syntax of reads.
Setting the only key as a designated character string value, deleting the only key in the cache after the correct data flow is executed by combining the service flow, and setting the failure time to avoid data abnormal conflict.
If the subset exists, the data is processed, the only key set is brought into a queue of the recursive retry function, and the recursive retry function is waited to be triggered until the maximum recursive times is reached or the data is successfully processed.
And putting the current data into a queue, waiting for triggering a recursive retry function, inquiring the latest data of the collided data in real time when the retry function is noticed, and taking the cache data as the rest. The memory consumption is saved to the maximum extent, and the data interaction times are reduced.
And executing the service code block in the cache based on the only set without the subset, and deleting the only set in the cache after the execution is finished so as to finish the release of the batch lock.
In this embodiment, the analysis method is: in combination with the programs unlocking grammar and in combination with the programs single thread feature, the lock releasing comprises three steps: 'GET', judgment and 'DEL', the atomicity of the data operation of the above steps can be guaranteed by using the Lua script.
In this embodiment, the overall interaction manner of the distributed batch data processing method based on concurrent security of the present invention is shown in fig. 3.
Example 2
As shown in fig. 4, the present embodiment provides a distributed batch data processing system based on concurrent security, including: the device comprises an acquisition module, a judgment module and a deletion module;
the acquisition module is used for acquiring an only set of batch data according to service division (the only refers to a field set capable of determining uniqueness of the data in each piece of data or a unique value obtained by an algorithm through the field set with uniqueness, and is hereinafter referred to as the only);
the judging module is used for judging whether the subset of the only set exists in the cache or not and bringing the only set without the subset into the cache;
and the deleting module is used for executing the service code block in the cache according to the only set without the subset, and deleting the only set in the cache after the execution is finished so as to complete the release of the batch lock.
Acquiring an onlykey set of batch data comprises the following steps:
acquiring data analysis, data structure and service attribute of batch data, and extracting a unique condition of the data;
and combining the unique conditions, and acquiring an onlykey set of batch data through an MD algorithm.
Before determining whether the subset of the onlykey set exists in the cache, the method further includes: packaging code blocks with unsafe threads into a recursion retry function to obtain the maximum recursion times; wherein the maximum recursion number is the number of retries after resource collision occurs.
Determining whether a subset of the onlykey set exists in the cache comprises: if the subset does not exist, putting the only set into a cache; if the subset exists, the only set is brought into a queue of the recursive retry function, and the recursive retry function is triggered until the subset does not exist or the maximum recursive number is reached.
Executing the service code block in the cache includes:
searching business data corresponding to a database to which the only key set belongs in batch through the only key set without the subset, temporarily storing the business data by using a map (the map refers to a data structure, the stored key-value pair data structure takes the only key as a key and the data itself as a value, hereinafter referred to as map), taking the only key in the only key set as a key, and taking the business data as a value;
and searching in the map through the only key, and performing batch updating operation on the values existing in the map and performing batch saving operation on the values not existing in the map.
The above description is only for the preferred embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A distributed batch data processing method based on concurrency security is characterized by comprising the following steps:
acquiring an only set of batch data based on service division, wherein the only set comprises: a set of unique values that can determine the uniqueness of each piece of data in the batch of data;
judging whether the subset of the only set exists in the cache or not, and bringing the only set without the subset into the cache; judging whether the subset of the only set and the code block brought into the only set to the cache exist in the cache, wherein the code block is contained in a designed distributed lock block to ensure the concurrency security of distributed lock setting;
and executing the service code block in the cache based on the only set without the subset, and deleting the only set in the cache after the execution is finished so as to complete the release of the batch lock.
2. The concurrent security-based distributed batch data processing method of claim 1, wherein obtaining an onlykey set of batch data comprises:
acquiring data analysis, data structure and service attribute of batch data, and extracting a unique condition of the data;
and combining the unique conditions, and acquiring the only set of batch data through an MD algorithm.
3. The concurrent security-based distributed batch data processing method according to claim 1, further comprising, before determining whether the subset of the only set exists in the cache: packaging code blocks with unsafe threads into a recursion retry function to obtain the maximum recursion times; wherein the maximum recursion number is the retry number after resource conflict occurs.
4. The concurrent security-based distributed batch data processing method of claim 3, wherein determining whether the subset of the only set exists in the cache comprises: if the subset does not exist, putting the only set into the cache; and if the subset exists, the only set is brought into the queue of the recursive retry function, and the recursive retry function is triggered until the subset does not exist or the maximum recursive times is reached.
5. The concurrent security-based distributed batch data processing method of claim 4, wherein executing the service code block in the cache comprises:
searching business data corresponding to a database to which the only key set belongs in batch through the only key set without the subset, temporarily storing the business data by using a map after the business data is found, using the only key in the only key set as a key, and using the business data as a value, wherein the map is a data structure;
and searching in the map through the only key, and performing batch updating operation on the values existing in the map and performing batch saving operation on the values not existing in the map.
6. A distributed batch data processing system based on concurrent security, comprising: the device comprises an acquisition module, a judgment module and a deletion module;
the acquisition module is used for acquiring an only key set of batch data according to service division, wherein the only key set comprises: a set of unique values that can determine the uniqueness of each piece of data in the batch of data;
the judging module is used for judging whether the subset of the only set exists in the cache or not and bringing the only set without the subset into the cache;
and the deleting module is used for executing the service code block in the cache according to the only set without the subset, and deleting the only set in the cache after the execution is finished so as to complete the release of the batch lock.
7. The concurrent security-based distributed batch data processing system of claim 6, wherein obtaining an onlykey set of batch data comprises:
acquiring data analysis, data structure and service attribute of batch data, and extracting a unique condition of the data;
and combining the unique conditions, and acquiring the only set of batch data through an MD algorithm.
8. The concurrent security-based distributed batch data processing system of claim 6, further comprising, prior to determining whether the subset of the only set exists in the cache: packaging code blocks with unsafe threads into a recursion retry function to obtain the maximum recursion times; wherein the maximum recursion number is the retry number after resource conflict occurs.
9. The concurrent security-based distributed batch data processing system of claim 8, wherein determining whether the subset of the onlykey set exists in a cache comprises: if the subset does not exist, putting the only set into the cache; and if the subset exists, the only set is brought into the queue of the recursive retry function, and the recursive retry function is triggered until the subset does not exist or the maximum recursive times is reached.
10. The concurrent security-based distributed batch data processing system of claim 9, wherein executing the block of business code in the cache comprises:
searching business data corresponding to a database to which the only key set belongs in batch through the only key set without the subset, temporarily storing the business data by using a map after the business data is found, and taking the only key in the only key set as a key and the business data as a value, wherein the map is a data structure;
and searching in the map through the only key, and performing batch updating operation on the values existing in the map and performing batch saving operation on the values not existing in the map.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210750013.5A CN115080255B (en) | 2022-06-28 | 2022-06-28 | Distributed batch data processing method and system based on concurrency security |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210750013.5A CN115080255B (en) | 2022-06-28 | 2022-06-28 | Distributed batch data processing method and system based on concurrency security |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115080255A true CN115080255A (en) | 2022-09-20 |
| CN115080255B CN115080255B (en) | 2023-03-24 |
Family
ID=83255336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210750013.5A Active CN115080255B (en) | 2022-06-28 | 2022-06-28 | Distributed batch data processing method and system based on concurrency security |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115080255B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6910039B2 (en) * | 2001-11-14 | 2005-06-21 | Sun Microsystems, Inc. | Validation technique for bulk lock delegation |
| CN105095495A (en) * | 2015-08-21 | 2015-11-25 | 浪潮(北京)电子信息产业有限公司 | Distributed file system cache management method and system |
| CN105302840A (en) * | 2014-07-31 | 2016-02-03 | 阿里巴巴集团控股有限公司 | Cache management method and device |
| CN108845843A (en) * | 2018-05-25 | 2018-11-20 | 腾讯科技（深圳）有限公司 | A kind of function processing method, device and relevant device |
| CN110196856A (en) * | 2019-05-09 | 2019-09-03 | 腾讯科技（深圳）有限公司 | A kind of distributed data read method and device |
| US20200044682A1 (en) * | 2008-07-09 | 2020-02-06 | Secureall Corporation | Methods and Systems for Comprehensive Security-Lockdown |
| CN112764795A (en) * | 2021-01-21 | 2021-05-07 | 奇秦科技(北京)股份有限公司 | Service-oriented cross-platform and cross-terminal information publishing system and method |
-
2022
- 2022-06-28 CN CN202210750013.5A patent/CN115080255B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6910039B2 (en) * | 2001-11-14 | 2005-06-21 | Sun Microsystems, Inc. | Validation technique for bulk lock delegation |
| US20200044682A1 (en) * | 2008-07-09 | 2020-02-06 | Secureall Corporation | Methods and Systems for Comprehensive Security-Lockdown |
| CN105302840A (en) * | 2014-07-31 | 2016-02-03 | 阿里巴巴集团控股有限公司 | Cache management method and device |
| CN105095495A (en) * | 2015-08-21 | 2015-11-25 | 浪潮(北京)电子信息产业有限公司 | Distributed file system cache management method and system |
| CN108845843A (en) * | 2018-05-25 | 2018-11-20 | 腾讯科技（深圳）有限公司 | A kind of function processing method, device and relevant device |
| CN110196856A (en) * | 2019-05-09 | 2019-09-03 | 腾讯科技（深圳）有限公司 | A kind of distributed data read method and device |
| CN112764795A (en) * | 2021-01-21 | 2021-05-07 | 奇秦科技(北京)股份有限公司 | Service-oriented cross-platform and cross-terminal information publishing system and method |
Non-Patent Citations (2)
| Title |
|---|
| YINGQIU MAO: "Recent Advances on Quantum Key Distribution Overcoming the Linear Secret Key Capacity Bound", 《ADVANCED QUANTUM TECHNOLOGIES》 * |
| 为之: "Java+RedisTemplate 实现redis分布式锁", 《HTTPS://BLOG.CSDN.NET/FAL1230/ARTICLE/DETAILS/106429851/》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115080255B (en) | 2023-03-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108572876B (en) | Method and device for realizing read-write lock | |
| CN110188110B (en) | Method and device for constructing distributed lock | |
| CN112052264B (en) | Business data query method and device, electronic equipment and readable storage medium | |
| CN112486694A (en) | Network lock processing method and device based on Redis | |
| US10318520B2 (en) | System and method for reducing communications overhead in a distributed transactions environment by modifying implementation of the transaction end function | |
| CN112099962A (en) | Distributed lock implementation method and device and electronic equipment | |
| CN113760976A (en) | Service processing method, device, equipment and storage medium | |
| CN109542922B (en) | Processing method for real-time service data and related system | |
| CN113806031A (en) | Method and apparatus for securing resources through object locks | |
| CN112148480A (en) | Task processing method, device and equipment based on multithreading and storage medium | |
| CN115080255B (en) | Distributed batch data processing method and system based on concurrency security | |
| CN113703946A (en) | Application recovery method and device, electronic equipment and computer readable storage medium | |
| CN112988777A (en) | Object processing method and device, computer equipment and storage medium | |
| CN113312185A (en) | Distributed lock | |
| CN111241594B (en) | Method, device, computer equipment and storage medium for signing transaction information | |
| CN111984428A (en) | Method, device and equipment for realizing spin lock during resource access | |
| CN111930503A (en) | Resource lock acquisition method based on ETCD | |
| CN108345505B (en) | Multithreading resource management method and system | |
| CN114036195A (en) | Data request processing method, device, server and storage medium | |
| CN106815061B (en) | Service processing method and device | |
| US9984096B2 (en) | System and method for reducing communications overhead in a distributed transactions environment by modifying implementation of the transaction start function | |
| CN113961364A (en) | Large-scale lock system implementation method and device, storage medium and server | |
| CN111767155A (en) | Deadlock detection method, device, equipment and computer readable storage medium | |
| CN115756768B (en) | Distributed transaction processing method, device, equipment and medium based on saga | |
| CN113806388A (en) | Service processing method and device based on distributed lock |
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 |