Redis can sustain over 100,000 queries per second thanks to four key factors: pure in‑memory storage, highly optimized data structures such as SDS and ziplist, a single‑threaded event loop with epoll‑based I/O multiplexing, and optional multi‑threaded network handling introduced in Redis 6.0.
Redis can sustain over 100,000 queries per second thanks to four key pillars—memory‑first storage, highly optimized data structures like SDS and skip lists, a single‑threaded event loop with epoll multiplexing, and multi‑core I/O threading—each explained with benchmarks, code samples, and real‑world comparisons.
This article explains how Redis achieves lightning‑fast performance with a single‑threaded architecture by leveraging in‑memory operations, IO multiplexing, and event‑driven design, and it details the four key advantages of this approach as well as the evolution introduced in Redis 6.0.
This article explains Nginx’s core concurrency mechanisms—including its multi‑process architecture, event‑driven model, I/O multiplexing techniques like epoll, and non‑blocking I/O—highlighting how they provide high stability, low resource consumption, and excellent performance for high‑traffic network services.
This article explains Nginx’s master‑worker model, its event‑driven design, I/O multiplexing techniques like epoll/kqueue, and non‑blocking I/O, showing how a few processes can efficiently handle thousands of concurrent connections.
This article explains the concepts, advantages, limitations, and practical usage of Linux I/O multiplexing mechanisms—select, poll, and epoll—through analogies, detailed explanations, code examples, and common interview questions, helping developers choose the right tool for high‑concurrency network programming.
This article explores C++ concurrent programming techniques, covering multi‑process fundamentals, process creation with fork(), inter‑process communication methods, multi‑threading using std::thread, synchronization tools like mutexes and condition variables, and efficient I/O handling through select, poll, and epoll multiplexing, with practical code examples.
This article explains Nginx's core Master‑Worker process model, high‑performance event‑driven design, I/O multiplexing with epoll, and asynchronous non‑blocking I/O, showing how these techniques enable the server to sustain millions of simultaneous connections.
The article analyzes why relying solely on operating‑system threads cannot easily achieve single‑machine million‑level concurrency, examining thread stack memory misconceptions, kernel‑level context‑switch costs, and how user‑space coroutine scheduling overcomes these limits.
This article explains Redis's single‑threaded network model, the role of IO multiplexing, the multithreading features introduced in Redis 6.0, and how to configure IO threads to improve throughput and latency.
Socket provides a file‑descriptor based network communication abstraction in the OS, while epoll uses a red‑black‑tree and ready‑queue mechanism to deliver O(log N) scalable I/O event handling, together forming the core design that enables high‑concurrency servers to efficiently manage thousands of connections.
This article explains Netty's powerful asynchronous architecture, compares classic multithread, Reactor, select, poll, and epoll I/O multiplexing models, demonstrates JNI integration for native performance, and provides complete example code for building a high‑performance epoll‑based server in Java.
This article explains Netty’s asynchronous architecture, compares classic multithread, Reactor, select, poll and epoll models, clarifies level‑triggered versus edge‑triggered event handling, and provides step‑by‑step JNI and hand‑written epoll server examples in C to illustrate high‑performance backend development.
This article explains the WebMan HTTP service framework built on Workerman, describes its single‑process, multi‑thread/coroutine, IO‑multiplexing and EventLoop modes, clarifies why it lacks a database connection pool, and presents detailed performance test results under various concurrency levels.
This article explains the Linux poll() system call, detailing its pollfd structure, event flags, parameters like nfds and timeout, return values, and step‑by‑step operation flow for reading and writing data, highlighting differences from select and its advantages on 32‑bit systems.
This article explains how Redis operates primarily with a single‑threaded model for memory and network operations, why this design is efficient, and how recent versions introduce multi‑threaded components for network I/O, persistence, and asynchronous deletion while preserving thread safety.
This article uses a playful story of a Linux process to explain the real limits on TCP connections, covering the configurable port range, file descriptor caps, thread model constraints, memory usage, and CPU saturation, and shows how to adjust these limits on a Linux server.
The article explains that Java database connection pools rely on blocking I/O and JDBC design rather than IO multiplexing, detailing the technical, architectural, and ecosystem reasons why multiplexed DB access is uncommon despite its potential performance benefits.
Although IO multiplexing can boost performance, most Java applications continue to use connection pools like c3p0 or Tomcat because JDBC is blocking, DB protocols require multiple sessions, and integrating NIO drivers into existing web containers adds significant complexity and ecosystem constraints.
This article explains Netty’s reactor‑based asynchronous architecture, compares classic multithread, select, poll and epoll I/O multiplexing models, demonstrates Java‑C interaction via JNI, and provides a complete hand‑written epoll server implementation with detailed code and performance insights.
This article explains why Redis traditionally operates with a single thread, how its memory‑centric design, simple data structures and I/O multiplexing keep it fast, and why newer Redis versions introduced multithreading for network I/O and lazy deletion of large keys.
This article explains the advantages of epoll over select for I/O multiplexing in Linux, covering its event-driven design, edge-triggered vs level-triggered modes, core APIs, practical code examples, and performance considerations for high‑concurrency network servers.
The article explains that database connection pools remain based on blocking I/O because JDBC was designed for BIO, managing session state per connection, and the ecosystem lacks a unified non‑blocking driver, making IO multiplexing technically possible but practically complex and rarely needed.
Although IO multiplexing can improve performance, Java applications typically use traditional connection pools like c3p0 or Tomcat because JDBC is built on blocking I/O, DB sessions require separate connections, and integrating NIO would complicate program architecture, making connection pools the pragmatic, mature solution.
This article introduces the basic concepts of I/O and explains three Unix network programming models—blocking I/O, non‑blocking I/O, and I/O multiplexing—detailing their workflows, advantages, disadvantages, and practical analogies for better comprehension.
The article explains why Java applications typically use traditional database connection pools instead of IO multiplexing, covering JDBC’s blocking design, session management, ecosystem maturity, and the complexity of integrating non‑blocking I/O with existing frameworks, while noting that a non‑blocking implementation is technically feasible.
This article explains Netty's high‑performance asynchronous architecture, compares classic multithread, Reactor, select, poll and epoll I/O multiplexing models, describes level‑triggered versus edge‑triggered event handling, and provides a step‑by‑step JNI example and a hand‑written epoll server implementation in C.
This article explains how Netty implements a powerful asynchronous, event‑driven architecture using the Reactor pattern, compares classic multithread, select, poll and epoll I/O multiplexing models, demonstrates JNI integration with Java, and provides a complete, annotated epoll server example with level‑triggered and edge‑triggered handling for high‑concurrency backend development.
This article explains Netty’s reactor‑based asynchronous architecture, compares classic multithread, select, poll and epoll models, demonstrates JNI integration with C code, and provides a complete hand‑written epoll server example to illustrate high‑performance backend networking in Java.
This article explains Netty’s high‑performance asynchronous architecture, the evolution of I/O multiplexing models from select to poll and epoll, demonstrates Java‑C integration via JNI with detailed code examples, and provides a complete hand‑written epoll server in C for achieving million‑connection concurrency.
This article provides an in‑depth explanation of Linux I/O multiplexing models—including select, poll, and epoll—detailing their mechanisms, advantages, limitations, and practical C code examples, while also covering edge‑triggered vs level‑triggered behavior and offering a complete epoll server implementation.
The article explains why database connections in Java applications usually rely on connection pools instead of IO multiplexing, discusses the blocking nature of JDBC, outlines how non‑blocking drivers could be built, and examines the practical and architectural reasons that prevent IO multiplexing from becoming the default.
The article dissects Linux’s epoll I/O multiplexing, tracing the flow from socket creation with accept through epoll_create, epoll_ctl registration, and epoll_wait sleeping, detailing the kernel’s eventpoll object, red‑black tree, per‑socket wait‑queue callbacks that enable O(log N) registration and O(1) event delivery for tens of thousands of connections.
The article explains that although IO multiplexing can improve performance, database access in Java typically relies on JDBC and connection pools, which are built on blocking I/O, making it difficult to combine DB connections with IO multiplexing without major architectural changes.
In this interview‑style tutorial, an Alibaba P7 engineer walks through the limitations of BIO, the non‑blocking NIO API, kernel‑level select/poll mechanisms, and the design of epoll, illustrating how each solves the C10K problem and how they are used in Java.
This article explains how Redis initializes, creates a TCP listener, registers file events, runs a single‑threaded reactor loop, accepts client connections, processes commands via a command table, and sends replies, illustrating the core backend architecture of the in‑memory database.
This article explains why Java database connection pools typically use blocking I/O and connection pooling instead of IO multiplexing, covering JDBC's design, session management, ecosystem constraints, and the trade‑offs between performance and code complexity.
This article explains how Netty constructs its core reactor thread pool using NioEventLoopGroup, detailing the creation of boss and worker groups, the underlying selector optimization, task queue setup, and the round‑robin binding strategy that distributes channels across multiple event loops for high‑performance I/O handling.
This article explains fundamental concepts of streams, I/O operations, blocking and non‑blocking behavior, compares blocking wait with busy polling, and then details five practical solutions—including multithreading, select, and epoll—while presenting Linux epoll API usage, code examples, and a comprehensive overview of seven common server concurrency models.
This article explains server‑side network concurrency models, the fundamentals of streams and I/O operations, compares blocking and non‑blocking approaches, and details practical solutions such as multithreading, busy‑polling, select and epoll with code examples and performance analysis.
This article explains the principles behind Linux's epoll mechanism, how IO multiplexing enables a single thread to manage many file descriptors efficiently, the role of non‑blocking sockets, and why epoll outperforms select and poll for high‑concurrency network services.
This article uses ten vivid real‑life analogies to clarify essential interview topics such as HTTP statelessness, serialization, rate limiting, TCP handshakes, thread‑pool mechanics, flow‑control windows, BIO/NIO/AIO differences, deadlocks, and the select versus epoll model, helping readers grasp complex computing concepts through familiar scenarios.
This article explains the drawbacks of traditional blocking network I/O, introduces non‑blocking reads, and walks through the evolution from multithreaded workarounds to kernel‑level multiplexing mechanisms such as select, poll, and epoll, showing code examples and performance considerations.
This article explains the fundamentals of IO multiplexing in Linux, compares naive loop‑based approaches with kernel‑provided mechanisms, dives deep into epoll's three system calls, its internal red‑black‑tree and ready‑list design, and shows which file descriptors can be efficiently managed with epoll.
This article explains the fundamentals of Linux epoll as a high‑performance IO multiplexing tool, compares it with select and poll, shows why non‑blocking file descriptors are required, and details the kernel‑level data structures and callbacks that make epoll efficient for backend services.
This article explains how Python implements coroutines for high‑performance network and web programming by combining OS‑level IO multiplexing, generator‑based control flow, callback elimination, stack‑driven call‑chain traversal, Future objects, and the evolution toward async/await syntax.
This article explains Nginx’s multi‑process model, worker management, request handling flow, event‑driven architecture, module types, comparison with Apache, and I/O multiplexing mechanisms such as select, poll and epoll, providing a comprehensive understanding of its high‑concurrency capabilities and configuration limits.
This article explains Nginx’s high performance by dissecting its multi‑process architecture, master‑worker model, event‑driven handling using epoll, request lifecycle, module types, comparison with Apache, and I/O models such as select, poll, and epoll, plus configuration limits for maximum connections.
This article explains why Redis achieves exceptionally high performance by combining pure in‑memory operations, a global hash table with O(1) lookups, efficient data structures such as SDS, ziplist, quicklist and skiplist, a single‑threaded event loop with non‑blocking I/O multiplexing, and adaptive encoding strategies.
This article explains why Redis was originally designed as a single‑threaded in‑memory database, outlines the four main reasons for that design, describes the limitations of I/O multiplexing, and details how Redis 6.0 introduced multithreading for network request handling to improve performance under high QPS workloads.
This article provides a deep, step‑by‑step analysis of Linux's epoll mechanism, covering socket creation with accept, the internal structures of eventpoll, how epoll_ctl registers sockets, the wait‑queue interactions, and the exact code paths that move a TCP packet from the NIC to a user‑space process.
This article explains how Python’s coroutine model evolved from Tornado’s single‑threaded async/await support to a generator‑based micro‑framework that uses IO multiplexing, callbacks, futures and stack‑based call‑chain handling to achieve non‑blocking network programming.
This article explains Nginx's high performance by detailing its master‑worker process architecture, asynchronous event‑driven I/O model, modular design, and how it handles HTTP connections, requests, and concurrency compared to traditional servers like Apache.
This article explains the fundamentals of IO events and multiplexing, compares thread‑based and event‑driven architectures, details the Reactor pattern variants, and clarifies synchronous versus asynchronous IO, providing a practical guide for building high‑performance network frameworks in Linux environments.
This article explains how servers handle massive concurrent requests by evolving from simple multi‑process models to lightweight threads, then to event‑driven architectures with I/O multiplexing, highlighting the trade‑offs of blocking versus non‑blocking I/O and the role of coroutines.
This article explains the core concepts of high‑performance Linux network programming, covering IO events, IO multiplexing, thread and event‑driven architectures, the Reactor pattern and its variants, as well as synchronous versus asynchronous IO, providing clear examples and practical guidance for building efficient server frameworks.
This guide explains IO events and multiplexing, compares thread‑based and event‑driven models, details the Reactor pattern variants, and clarifies synchronous vs asynchronous IO, providing a practical roadmap for building high‑performance Linux network frameworks.
Redis achieves exceptionally high performance despite its single‑threaded request handling by leveraging pure in‑memory operations, I/O multiplexing, non‑CPU‑intensive tasks, and specific single‑threaded advantages, while also incorporating multithreaded optimizations such as lazy‑free mechanisms and protocol parsing in newer versions.
This article compares the three I/O multiplexing mechanisms—select, poll, and epoll—by analyzing their time complexities, limitations, trigger modes, performance characteristics, and implementation details, helping developers choose the most suitable method for different Linux networking scenarios.
This article compares the three I/O multiplexing mechanisms—select, poll, and epoll—detailing their time‑complexities, limitations, implementation details, trigger modes, and performance trade‑offs to help developers choose the most suitable method for different Linux networking scenarios.
This article explains Nginx's multi‑process, event‑driven design, its master‑worker model, modular architecture, I/O multiplexing mechanisms such as epoll, and how these factors together enable the server to achieve high performance and support massive concurrent connections.
This article explains Nginx’s high performance by dissecting its multi‑process architecture, event‑driven model, HTTP connection handling, modular design, and I/O mechanisms, comparing it with Apache, and clarifying common questions about worker processes, maximum connections, and concurrency.
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 why Nginx delivers high performance and concurrency, covering its multi‑process architecture, master‑worker model, event‑driven I/O (select, poll, epoll), module system, HTTP request handling, and comparison with Apache, while providing practical insights into configuration and scalability.
This article explains Nginx’s multi‑process model, detailing the roles of master and worker processes, the HTTP connection lifecycle, event‑driven architecture, module types, and performance comparisons with Apache, while also covering I/O models like select, poll, and epoll.
This article explains Redis’s core architecture by detailing its event‑driven model, the initialization of the event loop, how file and time events are handled, and walks through a complete client command flow such as a SET operation, illustrated with key source‑code excerpts.
This article explains the fundamentals of high‑concurrency systems, covering how network cards and routers handle massive traffic, the role of the operating system and epoll/select, various I/O models, reactor and multithreading patterns, and strategies to improve CPU and I/O utilization.
This article reviews the historical C10K challenge, explains IO model improvements like epoll, kqueue and IOCP, and details practical Linux performance optimizations such as CPU and memory affinity, RSS/RPS/RFS/XPS, IRQ handling, kernel tuning, and hardware utilization for high‑concurrency servers.
