0 views collected around this technical thread.
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.
This article explains how Zookeeper’s distributed lock mechanisms—including non‑fair, fair, and read‑write locks—can prevent overselling in high‑traffic seckill scenarios, details their advantages and drawbacks, and provides practical Curator‑based Java implementations with code examples.
Facing limited storage of Zabbix historical data in Elasticsearch, the article outlines a comprehensive strategy—expanding nodes, adding SSDs, redesigning index mapping, using hot‑cold node tiers, employing Curator for automated shrink, segment merging, and lifecycle management—to retain up to a year of monitoring data efficiently.
This article provides a comprehensive guide on designing Elasticsearch indices for massive data volumes, covering shard and replica sizing, mapping strategies, rollover templates, curator cleanup, tokenization choices, query type selection, and multi‑table association techniques to achieve efficient, reliable search at PB‑scale.
This article explains how to replace Redis‑based lock with Curator's InterProcessMutex, detailing its re‑entrant design, node creation, lock acquisition logic, waiting mechanisms, and release process, while highlighting advantages over traditional Thread.sleep approaches in multithreaded resource access.
This guide offers a complete collection of practical examples that demonstrate Curator's usage for Apache ZooKeeper, covering leader election, distributed locks, barriers, counters, caches, queues, and transaction handling, with each chapter independent and source code available on GitHub.