The article explains the three major high‑concurrency I/O models—Blocking I/O, Non‑blocking I/O, and Asynchronous I/O—detailing their principles, advantages, drawbacks, and provides practical guidance on selecting the appropriate model based on workload characteristics and team constraints.
This comprehensive guide explains the fundamentals of IO models—including blocking, non‑blocking, multiplexing, and asynchronous approaches—detailing their kernel interactions, practical Python examples, performance trade‑offs, and real‑world optimization strategies for high‑concurrency server applications.
This article explains the fundamental concepts of I/O models—including blocking, non‑blocking, multiplexing and asynchronous approaches—detailing their mechanisms, advantages, drawbacks, code examples in Python, and practical optimization strategies for high‑concurrency backend systems.
This article explains the distinction between user space and kernel space, describes blocking and non‑blocking I/O, and compares select, poll, and epoll multiplexing techniques, including signal‑driven and asynchronous I/O models with code examples.
This article explains the five Linux I/O models—blocking, non‑blocking, I/O multiplexing, signal‑driven, and asynchronous—detailing their system calls, behavior, and performance characteristics while using vivid analogies to illustrate each model’s workflow.
This article explains how I/O aggregation, full‑stripe writes, RAID write penalties, business I/O models (OLTP, OLAP, VDI, SPC‑1), SSD/SAS performance, FC link bandwidth, read/write ratios, sequential versus random I/O, I/O size impact, and cache acceleration affect storage system performance and capacity planning.
This article presents a collection of interview questions covering backend fundamentals such as linked‑list sorting, encryption differences, TCP reliability, IO models, Hystrix, delayed tasks, HTTPS flow, transaction isolation, index pitfalls, virtual memory, Redis leaderboards, distributed locks, zero‑copy techniques, Java synchronized, and Snowflake ID generation.
This article explains the concepts of synchronous vs. asynchronous execution, blocking vs. non‑blocking operations, user and kernel space, process switching, file descriptors, cache I/O, and compares various Linux I/O models such as select, poll, epoll, signal‑driven and asynchronous I/O.
This article explains the differences between synchronous and asynchronous execution, blocking and non‑blocking operations, user and kernel space, process switching, file descriptors, cache I/O, and compares various I/O models—including blocking, non‑blocking, multiplexing, signal‑driven, and asynchronous—while highlighting the characteristics of select, poll, and epoll.
Explore the four fundamental I/O models—Blocking, Non‑Blocking, I/O Multiplexing (Reactor), and Asynchronous (Proactor)—with clear explanations and illustrative diagrams, helping readers grasp how each model works, their typical use cases, and why technologies like epoll or Redis benefit from multiplexing.
This article explains the four main I/O models—blocking, non‑blocking, multiplexing (reactor), and asynchronous (proactor)—detailing their characteristics, typical implementations in Java and Linux, and when each model is appropriate for building efficient network applications.
This article explains the five Linux I/O models—blocking, non‑blocking, I/O multiplexing, signal‑driven, and asynchronous—detailing their system calls, synchronization characteristics, and how they map to Java BIO, NIO, and AIO implementations, with illustrative analogies and usage scenarios.
This article explains the four main I/O models—blocking, non‑blocking, I/O multiplexing (select/epoll), and asynchronous I/O—in the context of Linux network programming, clarifying their mechanisms, differences, and when each model is appropriate.
This article explains the main components of Cloud Foundry, the role of the NATS messaging system, and compares the Reactor and Proactor patterns for synchronous and asynchronous I/O, providing detailed step‑by‑step workflows for read and write operations.
This article introduces fundamental network programming concepts, including OSI and TCP/IP layering, TCP connection establishment and termination, essential socket functions for client and server, key terms like backlog and RTT, the stream nature of TCP, and various I/O models such as blocking, non‑blocking, multiplexing, signal‑driven, and asynchronous I/O.
The article demystifies high‑concurrency myths by explaining that network cards merely forward packets, while the true challenges lie in OS‑level I/O handling, CPU‑IO imbalance, and selecting the right I/O models and concurrency patterns to fully utilize hardware resources.
This article examines practical high‑concurrency techniques for a single‑machine web server, presenting an ultra‑minimal reverse‑proxy model, comparing Nginx’s multi‑process event‑driven architecture with Apache’s prefork and worker MPMs, and reviewing synchronous, non‑blocking, and asynchronous I/O strategies to minimize performance killers such as data copying, context switches, memory allocation, and lock contention.
