Learn how Swoole transforms PHP into a high‑performance, asynchronous server by detailing its multi‑process architecture, reactor‑worker‑task model, coroutine‑enabled I/O, and practical code examples for TCP clients, HTTP servers, and file operations, enabling scalable, non‑blocking applications.
Redis 6.0 adds multithreaded network I/O to improve throughput, latency, and bandwidth utilization while keeping command execution single‑threaded for simplicity and data safety.
This article explains the fundamentals of network I/O, covering hardware basics, process scheduling, blocking and non‑blocking models, multiplexed I/O techniques such as select/poll/epoll, asynchronous I/O, socket types, and the user‑kernel boundary, providing a comprehensive guide for backend developers.
This article presents a practical guide for backend developers to troubleshoot Linux performance problems, covering essential analysis tools, a systematic diagnosis method, and detailed checklists for CPU, memory, disk I/O, and network I/O issues.
The article presents a concise mind‑map of essential Linux performance tools and a flexible troubleshooting workflow, guiding backend developers through CPU, memory, disk, and network issues by using utilities such as top, oprofile, slabtop, iotop, netstat, and strace to quickly pinpoint and resolve bottlenecks.
This article explores essential Linux I/O techniques, covering basic file operations with system calls like open, read, write, and close, advanced methods such as memory‑mapped files and asynchronous I/O, network programming with sockets and multiplexing, plus performance‑tuning strategies for efficient resource utilization.
This article explains how zero‑copy technology eliminates redundant memory copies and context switches during data transmission, compares traditional read‑send workflows with zero‑copy approaches such as Linux sendfile/splice and Java's FileChannel.transferTo, and discusses performance benefits and practical considerations.
To cope with soaring traffic on Bilibili’s effect‑advertising engine, the team systematically measured latency, eliminated redundant Redis calls, switched JSON to Protobuf, applied branch‑prediction hints, loop‑unrolling and AVX256 SIMD, introduced object‑pooling and an inverted‑index request format, cutting CPU usage by 21 % and boosting peak throughput 13 %.
This article explains the concept of Remote Procedure Call (RPC), compares it with other inter‑system communication methods, outlines the three core problems RPC must solve—call ID mapping, serialization, and network transport—and discusses high‑availability considerations and I/O models for building robust RPC frameworks.
The article analyzes the growing demands on network I/O, outlines Linux and x86 bottlenecks, and explains how DPDK’s user‑space bypass, UIO, PMD, and various optimization techniques such as HugePages, SIMD, and cache‑friendly design enable multi‑hundred‑million‑packet‑per‑second processing.
The article examines the evolving demands on network I/O, outlines the limitations of traditional kernel‑based packet processing on Linux/x86, and explains how user‑space frameworks such as DPDK and its UIO/PMD architecture, along with optimization techniques like huge pages, SIMD, and cache prefetching, can achieve multi‑gigabit, million‑packet‑per‑second throughput.
This article explains the role of network communication in RPC, compares blocking I/O, non‑blocking I/O, I/O multiplexing and asynchronous I/O, discusses why blocking I/O and multiplexing dominate, introduces zero‑copy techniques at the OS and Netty levels, and shows how Netty optimizes data handling for high‑performance RPC.
The article analyzes the growing demands on network I/O, explains Linux’s kernel bottlenecks, and shows how user‑space frameworks like DPDK and UIO can achieve multi‑hundred‑million packets per second through techniques such as huge pages, SIMD, zero‑copy, and careful CPU cache management.
This article examines the evolving demands of network I/O, analyzes Linux and x86 bottlenecks, explains DPDK's user‑space bypass architecture, and presents practical optimization techniques—including huge pages, SIMD, cache prefetching, and compile‑time tricks—to achieve multi‑gigabit packet processing rates.
This article thoroughly explains Kafka's network layer by dissecting the complete send and receive workflow, covering message pre‑sending, selector polling, write and read operations, buffer management, and callback handling, all illustrated with core source code snippets.
This article explains in detail how Linux handles local network I/O for 127.0.0.1, comparing it with cross‑machine communication, describing the routing, device subsystem, driver code, and soft‑interrupt processing, and concluding with performance considerations and a discussion on eBPF acceleration.
This article explains the fundamentals of I/O, details how sockets are created, bound, listened to, and accepted, describes the client-side connect process, and clarifies why read, write, accept, and connect operations can block, laying the groundwork for deeper Netty studies.
This article provides a comprehensive analysis of the Linux kernel's handling of localhost network I/O, detailing how packets destined for 127.0.0.1 bypass physical network interfaces, traverse the routing table, and utilize the loopback virtual device and soft interrupts for efficient intra-machine communication.
Through a playful narrative, the article explains how Linux processes interact with the kernel, why blocking I/O is inefficient, and how the epoll system call and its associated mechanisms like soft interrupts and the scheduler dramatically improve network concurrency and performance.
This article summarizes the DBLE network module, describing its key classes such as NIOAcceptor, NIOReactor, and SocketWR, explaining how client connections are accepted and processed, and highlighting the importance of low‑level network I/O knowledge for middleware development.
The author reflects on four pivotal experiences—from handling billion‑scale system outages to deep‑diving into JVM internals—that dramatically boosted his coding skills, emphasizing practical learning, robust code, and continuous self‑challenge for backend engineers.
This article explains the structure of Linux network I/O by detailing the OSI seven‑layer model, the role of each layer, MTU/PMTU concepts, IP fragmentation and reassembly, and key TCP mechanisms such as MSS, flow control, and congestion control, providing a comprehensive foundation for studying zero‑copy networking.
This article explains the Linux network I/O architecture, detailing how TCP sends and receives data, the role of socket buffers, SKB structures, QDisc and ring buffers, and compares various zero‑copy techniques such as read/write, mmap/write, sendfile, splice, tee, DPDK and DMA‑gather approaches.
This article explains how to assess, monitor, and tune system I/O performance by defining I/O models, selecting appropriate evaluation tools, tracking key metrics for disk and network I/O, and applying practical optimization strategies for both storage and network bottlenecks.
The article analyzes the growing demands on network I/O, explains Linux and x86 bottlenecks, introduces DPDK’s user‑space bypass architecture and its core optimizations such as hugepages, poll‑mode drivers, SIMD, and CPU‑specific tuning, and finally discusses the DPDK ecosystem and practical considerations for backend developers.
This article delves into Kafka’s network layer implementation, explaining the Selector class’s role in registering socket channels, handling connection events, and orchestrating reads and writes via KafkaChannel and TransportLayer, while illustrating packet structures and providing code snippets for key functions like register, connect, poll, and send.
