10 years of backend architecture design | AI engineering infrastructure, storage architecture design, and performance optimization | Former senior developer at NetEase, Douyu, Inke, etc.
This article explains the design of event‑driven architectures for high‑performance web services, compares the Reactor (synchronous) and Proactor (asynchronous) models, and provides Java‑style pseudocode for their core components, handlers, and event loops.
This article explores the fundamentals of high‑performance I/O design in Java, comparing BIO and NIO throughput, analyzing thread‑based and event‑driven architectures, and detailing the Reactor pattern with code examples and performance considerations for scalable web services.
This article walks through the progression of Java server‑side I/O—from classic blocking BIO, through multithreaded and thread‑pool BIO variants, to non‑blocking NIO and Reactor‑based scalable designs—explaining core concepts, code examples, and performance trade‑offs.
This article thoroughly examines Linux's epoll mechanism, detailing its SLAB memory management, middle‑layer design, edge and level triggering, comparison with select/poll, and related advanced polling technologies such as /dev/poll and kqueue, while also discussing C10K/C10M challenges and practical solutions.
This article explains the Linux kernel's wait‑queue mechanism, the sleep and wake‑up logic behind socket events, and how the IO‑multiplexing models select, poll, and epoll are implemented, including their core code paths, performance trade‑offs, and edge versus level triggering.
This article explains the evolution of Unix network I/O models, detailing data transmission paths, blocking and non‑blocking operations, and comparing five models—blocking, non‑blocking, I/O multiplexing, signal‑driven, and asynchronous—while clarifying key terminology such as user space, kernel, and file descriptors.
This article explains how thread context switching and concurrency affect Java program performance, demonstrates the impact with code examples and benchmarks, and provides practical solutions for thread safety, visibility, deadlock avoidance, and resource optimization.
This article explains the purpose, benefits, core APIs, implementation classes, execution flow, state management, and monitoring methods of Java thread pools, providing detailed code examples and diagrams to help developers understand and effectively use thread pooling in high‑concurrency applications.
This article provides a comprehensive overview of Java lock mechanisms—including optimistic, pessimistic, reentrant, fair, unfair, read/write, spin, and JVM-level optimizations—illustrated with clear explanations, code snippets, and performance‑tuning tips for high‑concurrency applications.
This article explains the fundamentals of Java's AbstractQueuedSynchronizer (AQS), covering its basic concepts, core components, lock and unlock mechanisms, condition objects, and provides a pseudo‑code example for building a custom AQS implementation.
