0 views collected around this technical thread.
This article explains Redisson's distributed lock features, comparing it with Jedis and Lettuce, detailing lock acquisition, reentrancy, Lua scripts, watchdog renewal, and the implementation of fair locks using Redis lists and sorted sets, with code examples and architectural insights.
This article explains the concept of spin locks, compares them with non‑spin locks, discusses their advantages and drawbacks, and provides Java code examples—including an AtomicLong implementation and a custom re‑entrant spin lock—to illustrate how spin locks work in concurrent programming.
This article explains the Redisson library’s distributed lock implementation in Java, covering its basic concepts, custom lock creation with Lua scripts, reentrant and fair lock mechanisms, the watchdog renewal process, and practical usage examples with code snippets.
This article provides a comprehensive guide to Redisson's distributed lock implementation in Java, covering its architecture, basic and reentrant lock mechanisms, fair lock using Redis lists and sorted sets, lock renewal via watchdog, and detailed code examples with Lua scripts.
This article explains how Curator uses Zookeeper's temporary sequential nodes to implement distributed locks, covering lock acquisition, reentrancy, fairness, read‑write semantics, batch locking, and a comparison with Redis‑based locks, while illustrating the process with code snippets and diagrams.