CN107832159A - Manage the method and computer-readable recording medium of distributed lock - Google Patents
Manage the method and computer-readable recording medium of distributed lock Download PDFInfo
- Publication number
- CN107832159A CN107832159A CN201711102625.9A CN201711102625A CN107832159A CN 107832159 A CN107832159 A CN 107832159A CN 201711102625 A CN201711102625 A CN 201711102625A CN 107832159 A CN107832159 A CN 107832159A
- Authority
- CN
- China
- Prior art keywords
- access request
- distributed lock
- lock
- temporal information
- computer
- 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
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/52—Indexing scheme relating to G06F9/52
- G06F2209/521—Atomic
Abstract
The invention discloses a kind of method and computer-readable recording medium for managing distributed lock.Methods described, applied to Redis systems, including：Obtain at least two access requests concurrent in Redis systems；According to the ordering strategy pre-set, it is ranked up at least two access request, turns into access tandem queue；To accessing each access request in tandem queue, distributed lock is set respectively；Notify to respond the access request for setting up distributed lock.
Description
Technical field
The present invention relates to field of information processing, espespecially a kind of method and computer-readable storage medium for managing distributed lock
Matter.
Background technology
Current almost many large-scale websites and application are all distributed deployments, and the data consistency in distributed scene is asked
Topic is always an important topic.Because any one distributed system can not all meet uniformity simultaneously
(Consistency), availability (Availability) and subregion fault-tolerance (Partition tolerance), at most can only
Meet two simultaneously, so, many systems will make choice at the beginning of design to this three.In the exhausted most of internet arena
In several scenes, it is required for sacrificing strong consistency to exchange the high availability of system for, system often only needs to ensure " finally unanimously
Property ", as long as this final time is in the range of user's acceptable.
In many scenes, we in order to ensure the final consistency of data, it is necessary to many technical scheme is supported, than
Such as distributed transaction, distributed lock.Sometimes, it would be desirable to ensure that a method can only be same within the same time
Thread performs.Provide the related API of many concurrent processing in fact in stand-alone environment, in Java, but these API are being distributed
It is just helpless in formula scene.That is simple Java Api can not provide the ability of distributed lock.
Distributed lock is a kind of mode of synchronization of access shared resource between control distributed system.In distributed system
In, it is often necessary to coordinate their action.If it have shared one between different systems or the different main frames of same system
Individual or one group of resource, then when accessing these resources, generally require mutual exclusion prevent it is interfering with each other ensure uniformity,
In this case, distributed lock is just needed to use.
Redis is a high performance key-value database, and it supports that the value types of storage are relatively more, including
String (character string), list (chained list), set (set), zset (sorted set ordered sets) and hash (Hash type).
These data types all support push/pop, add/remove and take common factor union and difference set and more rich operation, and this
A little operations are all atomicities.
So, how to realize that the management of distributed lock is urgent problem to be solved in Redis.
The content of the invention
In order to solve the above-mentioned technical problem, the invention provides a kind of method for managing distributed lock and computer-readable deposit
Storage media, the management of distributed lock can be realized in Redis.
In order to reach the object of the invention, the invention provides a kind of method for managing distributed lock, applied to Redis systems
System, including：
Obtain at least two access requests concurrent in Redis systems；
According to the ordering strategy pre-set, it is ranked up at least two access request, turns into and access serial team
Row；
To accessing each access request in tandem queue, distributed lock is set respectively；
Notify to respond the access request for setting up distributed lock.
Wherein, methods described also has following features：The notice is rung to the access request for setting up distributed lock
After answering, methods described also includes：
Detect whether the access request has responded to complete；
If detecting the access request to have responded to complete, the distributed lock of the access request is discharged.
Wherein, methods described also has following features：The notice is rung to the access request for setting up distributed lock
After answering, methods described also includes：
According to the acquisition time parameter method pre-set, the temporal information on the distributed lock of access request is obtained；
The temporal information that currently available very first time information obtains with the last time is contrasted；
If currently available very first time information is identical with the temporal information that the last time obtains, it is determined that the access please
The distributed lock asked is in malfunction.
Wherein, methods described also has following features：If the currently available very first time information obtains with the last time
After the temporal information that takes is identical, methods described also includes：
According to the acquisition time parameter method, obtain the temporal information on the distributed lock of access request again, and with it is described
Very first time information is compared, and when comparative result is that identical number is more than the threshold value pre-set, the access please
The distributed lock asked is in malfunction.
Wherein, methods described also has following features：The distributed lock for determining the access request is in failure shape
After state, methods described also includes：
Obtain the physical resource shared by access request corresponding to the distributed lock to break down；
Judge whether the physical resource hinders the task of other threads to handle；
If the physical resource hinders the task of other threads to handle, the distributed lock of the failure is discharged.
A kind of computer-readable recording medium, is stored thereon with computer program, and the program is realized when being executed by processor
Following steps, including：
Acquisition request step, obtain at least two access requests concurrent in Redis systems；
Sequence step is asked, according to the ordering strategy pre-set, is ranked up at least two access request, into
To access tandem queue；
Setting steps, distributed lock is set respectively to accessing each access request in tandem queue；
Notifying process, notify to respond the access request for setting up distributed lock.
Wherein, the computer-readable recording medium also has following features：Described when the program is executed by processor
Notify after being responded to the access request for setting up distributed lock, also realize following steps：
Detecting step, detects whether the access request has responded to complete；
Release steps, have responded to complete if detecting the access request, discharge the distribution of the access request
Lock.
Wherein, the computer-readable recording medium also has following features：Notified when the program is executed by processor
After being responded to the access request for setting up distributed lock, following steps are also realized：
Time obtaining step, according to the acquisition time parameter method pre-set, obtain on the distributed lock of access request when
Between information；
Time comparison step, the temporal information that currently available very first time information obtains with the last time is contrasted；
Step is determined, if currently available very first time information is identical with the temporal information that the last time obtains, it is determined that
The distributed lock of the access request is in malfunction.
Wherein, the computer-readable recording medium also has following features：Current when the program is executed by processor
After obtained very first time information is identical with the temporal information that the last time obtains, following steps are also realized：
Processing step, according to the acquisition time parameter method, the temporal information on the distributed lock of access request is obtained again,
And compared with the very first time information, when comparative result is that identical number is more than the threshold value pre-set, institute
The distributed lock for stating access request is in malfunction.
Wherein, the computer-readable recording medium also has following features：When the program is executed by processor it is determined that
The distributed lock of the access request is in after malfunction, also realizes following steps：
Resource acquisition step, obtain the physical resource shared by access request corresponding to the distributed lock of failure；
Judgment step, judges whether the physical resource hinders the task of other threads to handle；
Release steps, if the physical resource hinders the task of other threads to handle, discharge the failure
Distributed lock.
Embodiment provided by the invention, parallel access request is converted into serial process sequence, and to serial process sequence
Each access request in row sets distributed lock, then the processing for the request that conducts interviews, and realizes that redis is memory database distributed
Performance, the efficiency of lock, so as to improve the performance of the application using the program, response speed, it can be applied to the high concurrents such as internet
Under scene.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
Obtain it is clear that or being understood by implementing the present invention.The purpose of the present invention and other advantages can be by specification, rights
Specifically noted structure is realized and obtained in claim and accompanying drawing.
Brief description of the drawings
Accompanying drawing is used for providing further understanding technical solution of the present invention, and a part for constitution instruction, with this
The embodiment of application is used to explain technical scheme together, does not form the limitation to technical solution of the present invention.
Fig. 1 is the flow chart of the method for management distributed lock provided by the invention；
Fig. 2 is the structure chart of computer-readable recording medium provided by the invention.
Embodiment
For the object, technical solutions and advantages of the present invention are more clearly understood, below in conjunction with accompanying drawing to the present invention
Embodiment be described in detail.It should be noted that in the case where not conflicting, in the embodiment and embodiment in the application
Feature can mutually be combined.
Can be in the computer system of such as one group computer executable instructions the flow of accompanying drawing illustrates the step of
Perform.Also, although logical order is shown in flow charts, in some cases, can be with suitable different from herein
Sequence performs shown or described step.
Fig. 1 is the flow chart of the method for management distributed lock provided by the invention.Method includes shown in Fig. 1：
Step 101, obtain at least two access requests concurrent in Redis systems；
Specifically, in Redis systems, access request is concurrently to perform, and therefore, can obtain multiple access please
Ask；
Step 102, according to the ordering strategy pre-set, be ranked up at least two access request, turn into visit
Ask tandem queue；
Wherein, ordering strategy can be ranked up according to the acquisition time of request, can also be according to other sequence plans
Slightly multiple access requests are ranked up, parallel access request is treated as serial access request；
Step 103, distributed lock is set respectively to accessing each access request in tandem queue；
Specifically, because access request has been transformed into serial sequence, therefore can be that each access request be set gradually point
Cloth is locked；
Step 104, notice respond to the access request for setting up distributed lock.
Specifically, after the setting of distributed lock is completed, other processing modules can be notified to respond access request.
Embodiment of the method provided by the invention, parallel access request is converted into serial process sequence, and to serial place
Manage each access request in sequence and distributed lock, then the processing for the request that conducts interviews are set, realize redis memory databases point
Performance, the efficiency of cloth lock, so as to improve the performance of the application using the program, response speed, it is contour to can be applied to internet
Under concurrent scene.
Embodiment of the method provided by the invention is described further below：
It will concurrently be accessed using lining up mode and become serial access.Number order SETNX, GETSET are provided using Redis,
Distributed lock mechanism can conveniently be realized.
After notifying to respond the access request for setting up distributed lock, methods described also includes：
Detect whether the access request has responded to complete；
If detecting the access request to have responded to complete, the distributed lock of the access request is discharged.
Specifically, for the access request of the distributed lock set, the key values of the access request are recorded, it is pre- passing through
In the time first set, the result asked with the queried access of key values is surveyed, if it is determined that access request feedback processing
As a result, then it represents that the access request has responded to complete；Then conducted interviews the inquiry of request by key values, and it is corresponding to delete the key
Distributed lock, the release to distributed lock is realized, so as to complete the management of distributed lock.
Specifically, the management that distributed lock can be completed by using such as issuing orders, including：
(1)setnx:SETNX key value
Key value is set to value, and if only if, and key is not present；If given key has been present, SETNX is not done
Any action.
(2)getset:GETSET key value
Given key value is set to value, and returns to key old value (old value).When key is present but is not character
During string type, a mistake is returned.
(3)get:get key
Value values corresponding to key are returned to, if key, which is not present, returns to particular value nil.
(4)del：del key
Key values are deleted, the key being not present can be ignored.
In the inventive method embodiment, above-mentioned instruction can be utilized to complete the management of lock, including：
(1) lock
SETNX foo.lock<current unix time>
If returning to 1, represent that client has obtained lock, can down operate
(2) release lock
After the completion of operation, it can be discharged and locked by DEL foo.lock.
(3) deadlock is handled
If deadlock easily occurs in client collapse, such case can be found by detecting --- because the key to lock
What is preserved is unix timestamps, if the timestamp of key values is less than current timestamp, represents that lock is no longer valid.
For the above situation, the present invention provides following manner：
According to the acquisition time parameter method pre-set, the temporal information on the distributed lock of access request is obtained；
The temporal information that currently available very first time information obtains with the last time is contrasted；
If currently available very first time information is identical with the temporal information that the last time obtains, it is determined that the access please
The distributed lock asked is in malfunction.
Preferably, by setting overtime administrative mechanism, the release of next further optimum management distributed lock, specifically,
After if the currently available very first time information is identical with the temporal information that the last time obtains, methods described also includes：
According to the acquisition time parameter method, obtain the temporal information on the distributed lock of access request again, and with it is described
Very first time information is compared, and when comparative result is that identical number is more than the threshold value pre-set, the access please
The distributed lock asked is in malfunction.
Certainly, the distributed lock for determining the access request is in after malfunction, and methods described also includes：
Obtain the physical resource shared by access request corresponding to the distributed lock to break down；
Judge whether the physical resource hinders the task of other threads to handle；
If the physical resource hinders the task of other threads to handle, the distributed lock of the failure is discharged.
For example, there are three clients C1, C2, C3, wherein C1 holder locks, and because the collapse of other reasons does not discharge lock.
It is rapid that C2 obtains lock-step：
Step 1, C2 send SETNX orders to lock.foo, because the C1 also keyed lock.foo that collapse is fallen,
Redis returns to 0 to C1, that is, obtains failure.
Step 2, C2 send GET command to lock.foo, check whether lock.foo lock is expired.If it not, then dormancy
(sleep) a period of time, and retried afterwards.
If the unix timestamps in step 3, lock.foo are older than current time stamp, C2 is performed to issue orders：GETSET
lock.foo<current Unix timestamp+lock timeout+1>.Because GETSET effect, C2 can be checked and seen
GETSET return value, the old value stored before determining lock.foo is still that expired time stamp, if it is, C2
Locked.
Step 4, at this moment if C3, GETSET is quickly performed than C4 and operates and is locked, then C2 GETSET behaviour
Make to return is exactly a not out of date timestamp (timestamp that C3 is set).C2 have to retry since the first step.Even if C2
GETSET operation key is modified, this does not also influence on subsequent operation.
In the above-mentioned methods, the distribution made using the atomicity of redis setnx, getset, get, del order
Lock, and passage time stamp solves Deadlock, and using Deadlock existing for the general distributed lock of timeout mechanism solution, carrying
Also the stability of system has been ensured in the case of high-performance, efficiency.
Fig. 2 is the structure chart of computer-readable recording medium provided by the invention.Computer-readable storage medium shown in Fig. 2
Matter, computer program being stored thereon with, the program realizes following steps when being executed by processor, including：
Acquisition request step, obtain at least two access requests concurrent in Redis systems；
Sequence step is asked, according to the ordering strategy pre-set, is ranked up at least two access request, into
To access tandem queue；
Setting steps, distributed lock is set respectively to accessing each access request in tandem queue；
Notifying process, notify to respond the access request for setting up distributed lock.
In one embodiment of computer-readable recording medium provided by the invention, when the program is executed by processor
After the notice responds to the access request for setting up distributed lock, following steps are also realized：
Detecting step, detects whether the access request has responded to complete；
Release steps, have responded to complete if detecting the access request, discharge the distribution of the access request
Lock.
In one embodiment of computer-readable recording medium provided by the invention, when the program is executed by processor
Notify after being responded to the access request for setting up distributed lock, also realize following steps：
Time obtaining step, according to the acquisition time parameter method pre-set, obtain on the distributed lock of access request when
Between information；
Time comparison step, the temporal information that currently available very first time information obtains with the last time is contrasted；
Step is determined, if currently available very first time information is identical with the temporal information that the last time obtains, it is determined that
The distributed lock of the access request is in malfunction.
In one embodiment of computer-readable recording medium provided by the invention, when the program is executed by processor
After currently available very first time information is identical with the temporal information that the last time obtains, following steps are also realized：
Processing step, according to the acquisition time parameter method, the temporal information on the distributed lock of access request is obtained again,
And compared with the very first time information, when comparative result is that identical number is more than the threshold value pre-set, institute
The distributed lock for stating access request is in malfunction.
In one embodiment of computer-readable recording medium provided by the invention, when the program is executed by processor
Determine that the distributed lock of the access request is in after malfunction, also realize following steps：
Resource acquisition step, obtain the physical resource shared by access request corresponding to the distributed lock of failure；
Judgment step, judges whether the physical resource hinders the task of other threads to handle；
Release steps, if the physical resource hinders the task of other threads to handle, discharge the failure
Distributed lock.
Computer-readable recording medium provided by the invention, parallel access request is converted into serial process sequence, and
Distributed lock, then the processing for the request that conducts interviews are set to each access request in serial process sequence, realize redis internal memories
Performance, the efficiency of database distributed lock, so as to improve the performance of the application using the program, response speed, it can be applied to mutually
Under the high concurrent scenes such as networking.
One of ordinary skill in the art will appreciate that all or part of step of above-described embodiment can use computer journey
Sequence flow realizes that the computer program can be stored in a computer-readable recording medium, the computer program exists
(such as system, unit, device) performs on corresponding hardware platform, upon execution, including the step of embodiment of the method it
One or its combination.
Alternatively, all or part of step of above-described embodiment can also realize that these steps can using integrated circuit
To be fabricated to integrated circuit modules one by one respectively, or the multiple modules or step in them are fabricated to single integrated electricity
Road module is realized.So, the present invention is not restricted to any specific hardware and software combination.
Each device/functional module/functional unit in above-described embodiment can be realized using general computing device, it
Can concentrate on single computing device, can also be distributed on the network that multiple computing devices are formed.
Each device/functional module/functional unit in above-described embodiment realized in the form of software function module and as
Independent production marketing in use, can be stored in a computer read/write memory medium.Computer mentioned above
Read/write memory medium can be read-only storage, disk or CD etc..
The foregoing is only a specific embodiment of the invention, but protection scope of the present invention is not limited thereto, any
Those familiar with the art the invention discloses technical scope in, change or replacement can be readily occurred in, should all be contained
Cover within protection scope of the present invention.Therefore, protection scope of the present invention should be defined by the protection domain described in claim.
Claims (10)
- A kind of 1. method for managing distributed lock, applied to Redis systems, it is characterised in that including：Obtain at least two access requests concurrent in Redis systems；According to the ordering strategy pre-set, it is ranked up at least two access request, turns into access tandem queue；To accessing each access request in tandem queue, distributed lock is set respectively；Notify to respond the access request for setting up distributed lock.
- 2. according to the method for claim 1, it is characterised in that the notice is entered to the access request for setting up distributed lock After row response, methods described also includes：Detect whether the access request has responded to complete；If detecting the access request to have responded to complete, the distributed lock of the access request is discharged.
- 3. method according to claim 1 or 2, it is characterised in that access of the notice to setting up distributed lock please Ask after being responded, methods described also includes：According to the acquisition time parameter method pre-set, the temporal information on the distributed lock of access request is obtained；The temporal information that currently available very first time information obtains with the last time is contrasted；If currently available very first time information is identical with the temporal information that the last time obtains, it is determined that the access request Distributed lock is in malfunction.
- 4. according to the method for claim 3, it is characterised in that if the currently available very first time information and upper one After the temporal information of secondary acquisition is identical, methods described also includes：According to the acquisition time parameter method, the temporal information on the distributed lock of access request is obtained again, and with described first Temporal information is compared, when comparative result is that identical number is more than the threshold value pre-set, the access request Distributed lock is in malfunction.
- 5. according to the method for claim 3, it is characterised in that the distributed lock for determining the access request is in event After barrier state, methods described also includes：Obtain the physical resource shared by access request corresponding to the distributed lock to break down；Judge whether the physical resource hinders the task of other threads to handle；If the physical resource hinders the task of other threads to handle, the distributed lock of the failure is discharged.
- 6. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that the program is held by processor Following steps are realized during row, including：Acquisition request step, obtain at least two access requests concurrent in Redis systems；Sequence step is asked, according to the ordering strategy pre-set, is ranked up at least two access request, turns into visit Ask tandem queue；Setting steps, distributed lock is set respectively to accessing each access request in tandem queue；Notifying process, notify to respond the access request for setting up distributed lock.
- 7. computer-readable recording medium according to claim 6, it is characterised in that when the program is executed by processor After the notice responds to the access request for setting up distributed lock, following steps are also realized：Detecting step, detects whether the access request has responded to complete；Release steps, have responded to complete if detecting the access request, discharge the distributed lock of the access request.
- 8. the computer-readable recording medium according to claim 6 or 7, it is characterised in that the program is executed by processor When after notifying to respond the access request that sets up distributed lock, also realize following steps：Time obtaining step, according to the acquisition time parameter method pre-set, obtain the time letter on the distributed lock of access request Breath；Time comparison step, the temporal information that currently available very first time information obtains with the last time is contrasted；Step is determined, if currently available very first time information is identical with the temporal information that the last time obtains, it is determined that described The distributed lock of access request is in malfunction.
- 9. computer-readable recording medium according to claim 8, it is characterised in that when the program is executed by processor After currently available very first time information is identical with the temporal information that the last time obtains, following steps are also realized：Processing step, according to the acquisition time parameter method, obtain the temporal information on the distributed lock of access request again, and with The very first time information is compared, when comparative result is that identical number is more than the threshold value pre-set, the visit Ask that the distributed lock of request is in malfunction.
- 10. computer-readable recording medium according to claim 8, it is characterised in that when the program is executed by processor After it is determined that the distributed lock of the access request is in malfunction, following steps are also realized：Resource acquisition step, obtain the physical resource shared by access request corresponding to the distributed lock of failure；Judgment step, judges whether the physical resource hinders the task of other threads to handle；Release steps, if the physical resource hinders the task of other threads to handle, discharge the distribution of the failure Formula is locked.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711102625.9A CN107832159A (en) | 2017-11-10 | 2017-11-10 | Manage the method and computer-readable recording medium of distributed lock |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711102625.9A CN107832159A (en) | 2017-11-10 | 2017-11-10 | Manage the method and computer-readable recording medium of distributed lock |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107832159A true CN107832159A (en) | 2018-03-23 |
Family
ID=61654014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711102625.9A Pending CN107832159A (en) | 2017-11-10 | 2017-11-10 | Manage the method and computer-readable recording medium of distributed lock |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107832159A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109101528A (en) * | 2018-06-21 | 2018-12-28 | 深圳市买买提信息科技有限公司 | Data processing method, data processing equipment and electronic equipment |
| CN109558218A (en) * | 2018-12-04 | 2019-04-02 | 山东浪潮通软信息科技有限公司 | A kind of distributed service data lock implementation method based on Redis |
| CN109857527A (en) * | 2019-01-04 | 2019-06-07 | 四川虹美智能科技有限公司 | A kind of distributed task dispatching method, system, distributed devices and Redis database |
| CN110928888A (en) * | 2019-10-17 | 2020-03-27 | 北京达佳互联信息技术有限公司 | Data feedback method, device, server and storage medium |
| CN111324622A (en) * | 2020-02-20 | 2020-06-23 | 中国建设银行股份有限公司 | Resource first-aid-purchase processing method, device, equipment and storage medium |
| CN112269955A (en) * | 2020-11-02 | 2021-01-26 | 浪潮云信息技术股份公司 | Redis-based webpage response and data cache speed-up processing method and system |
| CN113570435A (en) * | 2021-07-29 | 2021-10-29 | 深圳数鑫科技有限公司 | Method and terminal for deducting remaining use times of data service API (application program interface) commodities |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106712981A (en) * | 2015-07-23 | 2017-05-24 | 阿里巴巴集团控股有限公司 | Method and device for informing node change |
| CN106775974A (en) * | 2016-12-07 | 2017-05-31 | 国云科技股份有限公司 | A kind of implementation method of distributed priority queuing lock |
| US20170163762A1 (en) * | 2012-06-20 | 2017-06-08 | Amazon Technologies, Inc. | Asynchronous and idempotent distributed lock interfaces |
-
2017
- 2017-11-10 CN CN201711102625.9A patent/CN107832159A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170163762A1 (en) * | 2012-06-20 | 2017-06-08 | Amazon Technologies, Inc. | Asynchronous and idempotent distributed lock interfaces |
| CN106712981A (en) * | 2015-07-23 | 2017-05-24 | 阿里巴巴集团控股有限公司 | Method and device for informing node change |
| CN106775974A (en) * | 2016-12-07 | 2017-05-31 | 国云科技股份有限公司 | A kind of implementation method of distributed priority queuing lock |
Non-Patent Citations (1)
| Title |
|---|
| 辽宁省通信协会: "《通信网络与信息技术 2016》", 31 August 2016, 辽宁科学技术出版社 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109101528A (en) * | 2018-06-21 | 2018-12-28 | 深圳市买买提信息科技有限公司 | Data processing method, data processing equipment and electronic equipment |
| CN109558218A (en) * | 2018-12-04 | 2019-04-02 | 山东浪潮通软信息科技有限公司 | A kind of distributed service data lock implementation method based on Redis |
| CN109857527A (en) * | 2019-01-04 | 2019-06-07 | 四川虹美智能科技有限公司 | A kind of distributed task dispatching method, system, distributed devices and Redis database |
| CN110928888A (en) * | 2019-10-17 | 2020-03-27 | 北京达佳互联信息技术有限公司 | Data feedback method, device, server and storage medium |
| CN111324622A (en) * | 2020-02-20 | 2020-06-23 | 中国建设银行股份有限公司 | Resource first-aid-purchase processing method, device, equipment and storage medium |
| CN112269955A (en) * | 2020-11-02 | 2021-01-26 | 浪潮云信息技术股份公司 | Redis-based webpage response and data cache speed-up processing method and system |
| CN113570435A (en) * | 2021-07-29 | 2021-10-29 | 深圳数鑫科技有限公司 | Method and terminal for deducting remaining use times of data service API (application program interface) commodities |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107832159A (en) | Manage the method and computer-readable recording medium of distributed lock | |
| US11888599B2 (en) | Scalable leadership election in a multi-processing computing environment | |
| JP6538780B2 (en) | System-wide checkpoint avoidance for distributed database systems | |
| JP6522812B2 (en) | Fast Crash Recovery for Distributed Database Systems | |
| US9424140B1 (en) | Providing data volume recovery access in a distributed data store to multiple recovery agents | |
| US9734021B1 (en) | Visualizing restoration operation granularity for a database | |
| CN104793988B (en) | The implementation method and device of integration across database distributed transaction | |
| US8954391B2 (en) | System and method for supporting transient partition consistency in a distributed data grid | |
| US8510334B2 (en) | Lock manager on disk | |
| JP2019220195A (en) | System and method for implementing data storage service | |
| US20150161016A1 (en) | Method and system of self-managing nodes of a distributed database cluster with a consensus algorithm | |
| US10599677B2 (en) | Methods and systems of splitting database indexes and digests | |
| US9460144B2 (en) | Lock acceleration | |
| EP3491532B1 (en) | System and method for data redistribution in database | |
| KR101296778B1 (en) | Method of eventual transaction processing on nosql database | |
| US9870386B1 (en) | Reducing I/O operations for on-demand demand data page generation | |
| US11003550B2 (en) | Methods and systems of operating a database management system DBMS in a strong consistency mode | |
| Padhye et al. | Scalable transaction management with snapshot isolation for NoSQL data storage systems | |
| CN112039970A (en) | Distributed business lock service method, server, system and storage medium | |
| CN101800763B (en) | Hybrid locking using network and on-disk based schemes | |
| CN103500126B (en) | A kind of automatization fault-tolerant configuration method of cloud computing platform | |
| US10970177B2 (en) | Methods and systems of managing consistency and availability tradeoffs in a real-time operational DBMS | |
| CN110659303A (en) | Read-write control method and device for database nodes | |
| Pankowski | Consistency and availability of Data in replicated NoSQL databases | |
| CN105389368A (en) | Method for managing metadata of database cluster of MPP architecture |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180323 |
|
| RJ01 | Rejection of invention patent application after publication |