Search across authors, categories, and technical themes. The layout mirrors the editorial references while staying responsive and fast.
This article explains the fundamentals of distributed systems, introduces Apache Kafka’s architecture and core components, describes how Kafka ensures message ordering within partitions, and provides practical Java consumer configurations and techniques to guarantee ordered consumption of messages.
This article presents a comprehensive log governance and mining solution for distributed systems, covering background challenges, usage scenarios, and detailed strategies such as distributed log integration, front‑back end traceability, standardized log management, large‑payload handling, efficient cleaning, and future plans for componentization and sampling.
This guide presents comprehensive principles, best practices, and techniques for designing, deploying, and maintaining stable distributed systems, covering fault tolerance, monitoring, capacity planning, incident response, and operational reliability to help engineers achieve high availability.
This article revisits the classic “Fallacies of Distributed Systems” introduced by Peter Deutsch, explaining why assumptions such as reliable networks, zero latency, infinite bandwidth, secure and homogeneous communication are false, and offering practical strategies like retries, caching, batching, and security‑first design to build robust distributed applications.
This comprehensive guide covers high‑performance development techniques—including I/O optimization, zero‑copy, multiplexing, concurrency, thread‑pool design, lock‑free programming, inter‑process communication, RPC, serialization, database indexing, caching strategies, Bloom filters, full‑text search, and load balancing—to help developers build fast, scalable, and reliable systems.
This article explores the challenges of maintaining data consistency under high concurrency in distributed systems, reviewing common consistency issues, distributed lock implementations, optimistic and pessimistic strategies, CAS and ABA problems, and practical solutions such as Redis locks, Zookeeper, and transaction protocols.
This article explains the main lock mechanisms used in concurrent and distributed Java applications—including pessimistic, optimistic, distributed, reentrant, spin, shared, read/write, fair, non‑fair, interruptible, segment, and lock‑upgrade techniques—along with their characteristics, usage scenarios, and sample SQL or Java code snippets.
The article compares master‑slave, master‑master, and leaderless distributed architectures, explaining how synchronous, semi‑synchronous, and asynchronous replication affect consistency, latency and scalability, and showing that each pattern trades write throughput, conflict‑resolution complexity, and availability against strong data correctness.
The article surveys common global ID generation strategies for distributed systems—database‑managed approaches like MySQL auto‑increment and MyCat‑Zookeeper, and Java‑based methods such as UUID, Snowflake, Leaf, Redis INCRBY and direct Zookeeper—comparing their trade‑offs and recommending Leaf (segment or Snowflake mode) or MyCat‑Zookeeper for reliable, scalable identifiers.
This article explains the problems of traditional session management in multi‑service environments, introduces session replication and centralized storage (using Redis), and demonstrates a complete CAS‑based single sign‑on solution with Java code examples for user, controller, filter, and configuration components.