redis_queued_locks
|> Distributed locks with "prioritized lock acquisition queue" capabilities based on the Redis Database. |> Each lock request is put into the request queue (each lock is hosted by its own queue separately from other queues) and processed in order of their priority (FIFO). |> Each lock request lives some period of time (RTTL) (with requeue capabilities) which guarantees the request queue will never be stacked. |> In addition to the classic `queued` (FIFO) strategy RQL supports `random` (RANDOM) lock obtaining strategy when any acquirer from the lock queue can obtain the lock regardless the position in the queue. |> Provides flexible invocation flow, parametrized limits (lock request ttl, lock ttl, queue ttl, lock attempts limit, fast failing, etc), logging and instrumentation.
View on Github
Activity
- Latest release
- 7mo ago
- Total releases
- 62
- Cadence
- ~daily
- Last 12 months
- 6
Reach
- Stars
- —
Details
- License
- MIT
- First release
- Feb 25, 2024
| Version | Released | |
|---|---|---|
1.16.2
patch
| ||
1.16.1
patch
| ||
1.16.0
minor
| ||
1.15.1
patch
| ||
1.15.0
minor
| ||
1.14.0
minor
| ||
1.13.0
minor
| ||
1.12.1
patch
| ||
1.11.0
minor
| ||
1.10.0
minor
| ||
1.12.0
minor
| ||
1.9.0
minor
| ||
1.8.0
minor
| ||
1.7.0
minor
| ||
1.6.0
minor
| ||
1.5.0
minor
| ||
1.4.0
minor
| ||
1.3.1
patch
| ||
1.3.0
minor
| ||
1.2.0
minor
| ||
1.1.0
minor
| ||
1.0.0
major
| ||
0.0.40
patch
| ||
0.0.39
patch
| ||
0.0.38
patch
| ||
0.0.36
patch
| ||
0.0.37
patch
| ||
0.0.34
patch
| ||
0.0.35
patch
| ||
0.0.33
patch
| ||
0.0.32
patch
| ||
0.0.29
patch
| ||
0.0.30
patch
| ||
0.0.28
patch
| ||
0.0.27
patch
| ||
0.0.25
patch
| ||
0.0.22
patch
| ||
0.0.23
patch
| ||
0.0.26
patch
| ||
0.0.24
patch
| ||
0.0.21
patch
| ||
0.0.20
patch
| ||
0.0.19
patch
| ||
0.0.18
patch
| ||
0.0.16
patch
| ||
0.0.17
patch
| ||
0.0.15
patch
| ||
0.0.14
patch
| ||
0.0.13
patch
| ||
0.0.9
patch
|