During a mid‑year promotion an e‑commerce platform experienced a sudden spike in load average and response latency; the article walks through a systematic, command‑driven investigation that identifies an I/O bottleneck caused by mis‑configured log rotation and excessive debug logging, and presents immediate and long‑term remediation steps.
This article explains Linux Load Average’s definition, how the three numbers are calculated, their relationship with CPU and I/O, practical interpretation rules, step‑by‑step troubleshooting workflows, monitoring setups, and optimization techniques for both CPU‑bound and I/O‑bound load spikes.
This comprehensive guide explains Linux I/O fundamentals, the multi‑layer buffering architecture, buffering modes, tuning parameters, and practical code examples, helping developers and system administrators dramatically improve read/write performance and resource utilization on Linux servers.
This guide walks you through a systematic three-step methodology for diagnosing and resolving Linux performance issues—covering CPU, memory, and I/O bottlenecks—using practical commands, real-world case studies, and automation scripts, while also exploring future trends like eBPF and cloud‑native challenges.
This article provides a comprehensive walkthrough of the Linux I/O stack architecture, explains key performance metrics, demonstrates how to use tools such as iostat, pidstat, strace and lsof, and presents a step‑by‑step case study for locating I/O bottlenecks on a high‑traffic web server.
This guide explains how to evaluate and improve Linux server performance by conducting comprehensive CPU, memory, network, and I/O stress tests using tools such as stress, stressapptest, Valgrind, ApacheBench, JMeter, wrk, siege, httperf, and fio, with detailed command examples and result analysis.
This article provides a comprehensive overview of Linux internals, covering the kernel’s core components, memory and process management, the virtual file system layer, ext4 inode structures, caching strategies, direct I/O, and kernel parameter tuning for performance optimization.
Linux kernel I/O mechanisms, from basic file operations and descriptors to advanced models like blocking, non‑blocking, multiplexed, signal‑driven, and asynchronous I/O, are explained in depth, covering their structures, system calls, caching strategies, and performance optimizations such as io_uring.
A detailed Oracle 10g case study reveals how excessive log file sync waits, caused by I/O performance problems and frequent log switches on aging mechanical storage, lead to database hangs, and provides step‑by‑step analysis and practical mitigation tips.
The article combines practical advice for fresh graduates seeking internships and interview tips, shares a detailed ByteDance three‑round backend interview experience, explains MySQL master‑slave replication stages, binlog formats, and compares blocking, non‑blocking, multiplexed, and asynchronous I/O models.
This article explains what disks are, compares mechanical HDDs and SSDs, outlines disk classification by interface and architecture, defines key I/O performance metrics such as IOPS, throughput, utilization, and latency, and introduces Linux tools like iostat, iotop, and sar for monitoring and analysis.
This article explains the core principles of I/O read/write operations, detailing the data preparation and copying stages, the roles of kernel and user buffers, synchronization models, and performance optimizations such as double buffering, circular buffers, zero‑copy, read‑ahead, and delayed write.
Redis evolved rapidly, with versions up to 5.x handling all core CRUD commands on a single worker thread, while Redis 6 introduced multi‑threaded network I/O to leverage multi‑core CPUs, yet still processes core business commands single‑threadedly for performance and simplicity, as explained with diagrams.
The article explains the purpose, implementation, and usage of early I/O memory mapping (early_ioremap) in the Linux kernel, detailing its initialization, fixmap foundations, code flow, and differences from regular ioremap, with examples and kernel source snippets.
This article explains what disks are, compares mechanical HDDs and SSDs, describes disk I/O concepts, outlines key performance metrics such as IOPS, throughput, utilization and latency, and introduces Linux tools like iostat, iotop, sar for monitoring and analyzing storage performance.
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.
GaussDB provides a fine‑grained resource control solution that lets administrators define CPU, memory, I/O, connection, concurrency, and storage limits at user, session, and statement levels, using resource pools, control groups, and GUC parameters to ensure multi‑tenant isolation, SLA compliance, and optimal cluster utilization.
This article explains the core concepts of I/O in operating systems, covering blocking I/O, non‑blocking I/O, and I/O multiplexing, their workflows, advantages, disadvantages, and practical analogies to help developers choose the right model for their applications.
This guide introduces three essential Linux I/O commands—iostat for overall I/O statistics, iotop for real‑time per‑process I/O usage, and lsof for listing open files—showing how to install, run, interpret their output, and use common options.
This article provides a comprehensive overview of Linux kernel I/O mechanisms, including file system interfaces, blocking and non‑blocking I/O, asynchronous models, multiplexing with select/epoll, EXT file‑system structures, VFS abstraction, consistency and journaling, as well as the complete block I/O path, scheduling algorithms, and debugging tools.
This article explains the traditional I/O read/write workflow, identifies its performance bottlenecks, introduces the concept of zero‑copy, and demonstrates practical zero‑copy implementations—including DMA, sendfile, shared memory, memory‑mapped files, and Java NIO techniques such as ByteBuffer, Channel, transferTo/transferFrom, and memory‑mapped files.
This article walks through the evolution of Java I/O models—from blocking BIO to non‑blocking NIO and multiplexed epoll—explains core concepts such as blocking, non‑blocking, synchronous and asynchronous operations, and demonstrates practical code for handling thousands of concurrent connections efficiently.
This article explains why SQL queries become slow, how to capture slow queries using MySQL's slow query log, and provides detailed step‑by‑step methods for analyzing execution plans, profiling, optimizer tracing, and I/O parameters to identify and resolve performance bottlenecks.
Linux I/O models range from synchronous native operations to asynchronous kernel‑bypass techniques, with APIs such as open, read, write, mmap, sendfile and splice, while the modern io_uring interface—supporting interrupt, polling, and kernel‑polling modes via liburing—delivers superior performance, especially at high queue depths, compared to traditional libaio.
This article explains how storage media performance, kernel‑user mode transitions, DMA, zero‑copy, and PageCache interact to affect I/O latency, why multiple data copies and context switches hurt throughput, and how techniques like mmap, sendfile, and asynchronous I/O can reduce overhead.
This article explains the two‑stage socket I/O process in Linux, compares blocking, non‑blocking, and I/O multiplexing techniques, details the select, poll, and epoll APIs with their advantages and drawbacks, and provides complete C code examples for a high‑performance TCP server and client.
The article explains how different storage media affect I/O speed, describes kernel and user mode separation, introduces DMA and zero‑copy techniques such as mmap + write and sendfile, and discusses PageCache behavior, advantages, drawbacks, and tuning for high‑performance file transfers.
This article explains the concepts of synchronous vs asynchronous and blocking vs non‑blocking I/O, then details the characteristics, advantages, and drawbacks of Java’s three I/O models—BIO, NIO, and AIO—providing guidance on when to use each approach in backend development.
This article explains the concepts of synchronous vs asynchronous and blocking vs non‑blocking I/O, then compares Java's BIO, NIO, and AIO models, describing their mechanisms, advantages, drawbacks, and suitable usage scenarios for server‑side development.
This article demystifies the true reasons behind Redis's speed by exploring low‑level I/O mechanisms—from basic BIO to NIO and the Reactor model—explaining socket creation, connection handling, blocking behavior, and how Java’s non‑blocking APIs and system calls work together to achieve high‑throughput networking.
The article explains the traditional Linux read/write system‑call I/O path, detailing the multiple CPU and DMA copies, context switches, page‑cache mechanisms, and advanced techniques such as zero‑copy, multiplexing, and direct I/O for performance optimization.
This article explains Linux load average, covering how it is calculated, its relationship with CPU usage, and how the kernel exposes load data to applications.
This article explains how Linux handles I/O operations, covering the virtual file system, inode and dentry structures, superblock layout, ZFS features, disk types, the generic block layer, I/O scheduling strategies, and key performance metrics for storage.
This article breaks down nine essential techniques—ranging from faster CPU execution and effective caching to reducing interrupts, memory copies, and lock contention—to help developers systematically improve software performance across hardware and software layers.
This guide explains how to monitor Linux system performance by using core commands such as top, vmstat, iostat, and sar to evaluate CPU usage, memory allocation, I/O activity, and network traffic, while also covering load interpretation, cache behavior, huge pages, zero‑copy techniques, and practical command examples.
This article examines Redis's transition from a single‑threaded reactor to a multi‑threaded I/O model, details the underlying I/O multiplexing and BIO subsystems, and explains the lazyfree mechanism for asynchronous large‑key deletions, providing extensive code analysis and performance insights.
This article explains how to monitor Linux system performance by covering CPU metrics with top and vmstat, memory usage via top columns and cache details, I/O health using iostat and zero‑copy techniques, as well as network statistics with sar, providing practical commands and interpretation guidance.
This article explores the fundamentals and practical benefits of buffering in Java applications, covering file I/O streams, Logback asynchronous logging, and Kafka producer batching, while providing code examples, configuration tips, optimization strategies, and cautions to avoid data loss.
This article explains how to assess Linux system performance by examining CPU usage with top, interpreting load averages, using vmstat for detailed metrics, monitoring memory consumption via top, understanding cache behavior, evaluating I/O performance with iostat and sar, and provides practical commands and visual examples for each component.
This article explains Linux storage hierarchy, the roles of user‑space and kernel caches, the three‑layer I/O stack, page‑cache synchronization policies, file‑operation atomicity, locking mechanisms, and performance testing techniques for HDD and SSD devices.
This article provides a comprehensive guide to Java I/O, explaining the concepts of input and output streams, distinguishing byte and character streams, detailing node and processing streams, and offering practical code examples for file handling, buffering, conversion, and object serialization.
Traditional Linux I/O using read() and write() involves multiple CPU and DMA copies and context switches, while modern techniques like zero‑copy, multiplexing, and page‑cache optimization reduce overhead; this article explains the classic I/O flow, read/write operations, network and disk I/O, and high‑performance strategies such as zero‑copy and Direct I/O.
This article explains the classic Linux read/write system‑call I/O path, the copy and context‑switch overhead involved, and presents high‑performance techniques such as zero‑copy, multiplexing, and PageCache optimizations to reduce latency and improve throughput.
This article explains how Linux implements traditional system‑call I/O using read() and write(), details the data‑copy and context‑switch overhead of read and write operations, describes network and disk I/O, and introduces high‑performance techniques such as zero‑copy, multiplexing, and page‑cache optimizations.
This article explains how Linux traditional read/write system calls work, detailing the CPU, DMA copies and context switches involved, and then explores high‑performance I/O techniques such as zero‑copy, multiplexing and PageCache, together with the Linux I/O stack and buffering layers.
This article provides an in‑depth overview of Linux I/O mechanisms, covering the memory hierarchy pyramid, kernel‑level caching layers, the Linux I/O stack, page‑cache synchronization strategies, file‑operation atomicity, locking, and practical disk performance testing techniques.
Traditional Linux I/O relies on read() and write() system calls that involve multiple CPU and DMA copies and context switches, while modern optimizations such as zero‑copy, multiplexing, and page cache techniques reduce copying overhead, and understanding buffered, mmap, and direct I/O reveals their impact on performance.
The article explains Linux’s traditional system‑call I/O path, detailing how read() and write() trigger multiple CPU and DMA copies and context switches, describes read and write workflows, explores network and disk I/O, examines the Linux I/O stack, page cache, buffering strategies, zero‑copy, mmap and Direct I/O, and discusses performance trade‑offs.
This article explains the classic Linux read/write system‑call I/O path, its multiple CPU, DMA copies and context switches, and then explores high‑performance optimizations such as zero‑copy, multiplexing, and PageCache, while comparing Buffered I/O, mmap, and Direct I/O.
The guide explains Linux’s unified VFS architecture, detailing how inodes and dentries map files to disk regions, describes superblock and data block layout, outlines ZFS’s pool, copy‑on‑write and ARC caching, covers block device types, I/O scheduling queues, and key performance metrics.
This article explains the four main I/O models—blocking, non‑blocking, multiplexed (event‑driven) and asynchronous—detailing their mechanisms, kernel interactions, performance implications, and how they differ in handling data readiness for network programming.
This article explains how Linux manages disks and filesystems by detailing the roles of inodes and dentries, the structure of filesystem storage, the Virtual File System layer, various I/O classifications, and practical commands for observing filesystem performance and cache usage.
This article explains core Linux I/O concepts—including file systems, I/O types, caching mechanisms, copy‑on‑write, zero‑copy, and performance metrics—then presents practical application, file‑system, and disk‑level optimization techniques to improve throughput and latency.
This article analyzes the actual Linux system calls performed by various Java I/O models—including BIO, NIO, epoll‑based multiplexing, Netty, and AIO—showing code examples, performance trade‑offs, and how each approach interacts with the kernel.
This article explains how Elasticsearch processes queries across shards, identifies two key performance bottlenecks—query computation time and segment file I/O—and offers practical optimization strategies such as simplifying query logic, maximizing OS file cache usage, increasing memory, reducing stored data, and applying hot‑cold data separation.
This article explains the concepts of blocking (BIO), non‑blocking (NIO) and asynchronous (AIO) I/O in Java, introduces the principle of I/O multiplexing, provides a complete Java example with server and client code, and compares system calls like select, poll, and epoll.
This article explains the concepts of blocking and non‑blocking I/O, I/O multiplexing mechanisms such as select, poll and epoll, and the differences between synchronous and asynchronous I/O, then demonstrates Java implementations of BIO, NIO and AIO with sample code.
This article explains how a seemingly simple read‑of‑one‑byte in user code triggers a complex Linux I/O stack involving the I/O engine, system calls, VFS, page cache, file system implementations, generic block layer and I/O scheduler, and clarifies when actual disk I/O occurs and its granularity.
This article explains the Linux I/O stack, the flow of data from user‑space buffers through libc buffers, page cache, and kernel buffers to the physical disk, covering functions like fwrite, fflush, fsync, O_DIRECT, scheduling algorithms, consistency issues, and performance considerations.
This comprehensive guide explores Linux’s core concepts—from its UNIX heritage and system architecture to process creation, inter‑process communication, scheduling, virtual memory, file‑system design, I/O handling, networking, loadable modules, and the security model that governs users, permissions and privileged operations.
This article explains the Linux I/O stack, detailing how data moves from user‑space buffers through libc and page cache to the disk, covering system calls, synchronization primitives, scheduler behavior, consistency, safety, and performance considerations.
The article explains Linux zero‑copy I/O techniques—mmap, sendfile, splice, and tee—detailing their design principles, execution flows, context‑switch and data‑copy reductions, advantages, limitations, and appropriate use cases, helping developers choose the optimal method for high‑performance file and network transfers.
This article provides a thorough, step‑by‑step guide to using the Linux sar command for real‑time and historical monitoring of CPU, memory, I/O, and network statistics, including syntax, sample outputs, installation tips, common pitfalls, and data‑export techniques.
This article introduces the five Linux I/O models—blocking, non‑blocking, I/O multiplexing, signal‑driven, and asynchronous—explaining core concepts such as blocking vs non‑blocking calls, synchronous vs asynchronous processing, and detailing each model’s execution phases, advantages, and typical use‑cases.
This article explains the layered design of Linux file I/O, describes how data moves from application buffers through libc, page cache, and kernel I/O queues to disk, discusses synchronization primitives, consistency issues, and performance factors such as scheduling algorithms and hardware characteristics.
This article explains the differences and purposes of Linux I/O flushing mechanisms—including fsync(), fdatasync(), sync(), the O_DIRECT and O_SYNC open flags, and the REQ_PREFLUSH and REQ_FUA bio request flags—illustrated with dd experiments, kernel flag tables, and practical commands for managing disk write caches.
The article explains common storage I/O characteristics—such as I/O size, read/write ratio, sequential versus random access, locality, stability, and multithreading—across various application workloads and shows how tools like Iometer can be used to model and benchmark these patterns.
The article explains low‑level I/O fundamentals—kernel versus user space, blocking (BIO) versus non‑blocking (NIO) models, and the evolution to multiplexing with select, poll, and epoll—showing how these mechanisms address the C10K problem and are exposed in Java through NIO and Netty APIs.
This article provides an in‑depth technical guide to Linux, covering its Unix heritage, process and thread creation, kernel architecture, virtual memory, scheduling algorithms, file‑system structures, I/O handling, networking, and built‑in security mechanisms such as user IDs, permissions, and set‑UID features.
Hard drives (HDD) and solid‑state drives (SSD) differ dramatically in latency; the article explains the orders‑of‑magnitude gap between CPU cache, memory, and disk access, details the I/O mechanisms (programmed I/O, interrupt‑driven I/O, DMA), and shows why mechanical drives are inherently slow.
This article examines the common causes of Elasticsearch query latency spikes—especially GC pauses, system cache misses, and I/O overhead—provides step‑by‑step methods to identify the root cause, and offers practical tuning recommendations to mitigate the issue.
This article provides an in‑depth tutorial on Linux fundamentals, covering the kernel architecture, process and thread creation, inter‑process communication, scheduling algorithms, virtual memory management, paging, caching, file system structures (VFS, ext2/ext4), network file systems, I/O device handling, loadable modules, and the operating‑system security model with permissions and setuid mechanisms.
This article uses a bank workflow analogy to compare blocking I/O (BIO), non‑blocking I/O (NIO), and asynchronous processing, showing how task decomposition and specialized threads dramatically increase system throughput while illustrating the trade‑offs of each approach.
This article explains how operating systems manage diverse I/O devices through device controllers, registers, drivers, DMA, and Linux’s generic block layer, and walks through the complete sequence that occurs—from a keyboard press to the character appearing on the screen.
This article explains the distinction between Java's RUNNABLE thread state and the operating‑system concepts of ready, running, and waiting, covering JVM‑level definitions, I/O blocking behavior, time‑slice scheduling, and includes concrete code examples to illustrate how blocked I/O still appears as RUNNABLE.
This article explains the evolution of Java I/O—from blocking BIO to non‑blocking NIO and asynchronous AIO—covers the Reactor pattern and its single‑thread, multi‑thread, and master‑slave models, and details Netty’s thread groups, channel pipeline, and async non‑blocking communication.
This article explains the principles of Linux I/O, the need for zero‑copy, the role of page and buffer caches, various data‑transfer mechanisms such as DMA, Direct I/O and mmap, and compares their performance and usage scenarios.
This article breaks down Linux I/O concepts—including memory, network, and disk I/O—explains the two‑phase request flow, details the web request lifecycle, defines blocking, non‑blocking, synchronous and asynchronous operations, and compares five major I/O models with visual diagrams.
This article explains the fundamentals of I/O, detailing the two-phase request process, the flow of a web request, and the differences between blocking, non‑blocking, synchronous, and asynchronous I/O models, including select/poll, signal‑driven, and AIO approaches.
This article details the eight-step NVMe read I/O workflow over PCIe, covering the protocol layers, submission and completion queues, doorbell registers, data transfer mechanisms like PRP, and a trace‑based walkthrough of each host‑SSD interaction.
This article explains the Java RUNNABLE thread state, how it differs from traditional OS ready and running states, the impact of time‑slicing and I/O blocking, and demonstrates with code that even blocked I/O operations keep a Java thread in the RUNNABLE state.
The article explains how memory chips are organized into banks and matrices, why eight consecutive bytes are distributed across eight banks for parallel I/O, and how this hardware design makes 64‑bit (8‑byte) alignment essential for optimal performance.
This article explains why Kafka achieves remarkable speed by relying on Linux page cache, detailing the differences between page and buffer caches, Kafka's zero‑copy I/O path, relevant kernel parameters, and tuning recommendations for optimal backend performance.
RedisConf 2019 highlighted the introduction of multithreaded I/O in Redis 6, detailing its architecture, thread handling of network reads/writes, configuration settings, and benchmark results that show roughly double the throughput for GET/SET commands compared to the single‑threaded Redis 5.0.5.
This article clarifies the concepts of synchronous vs. asynchronous execution and blocking vs. non‑blocking I/O, explains their relationships, provides practical analogies, and details how these models apply to Java I/O operations.
This article explains the five Linux I/O models—blocking, non‑blocking, I/O multiplexing, signal‑driven, and asynchronous—using a fishing metaphor, shows how Java’s BIO/NIO/AIO map to OS mechanisms, and clarifies why most of them are still synchronous despite different implementations.
This article explains the concepts of synchronous vs. asynchronous and blocking vs. non‑blocking operations using everyday analogies, clarifies their differences, and details Java's three I/O models—BIO, NIO, and AIO—while guiding readers on choosing the appropriate approach for web development.
This article explains the lifecycle of data in I/O operations, compares blocking, non‑blocking, and asynchronous models, introduces zero‑copy techniques, and details how select, poll, and epoll enable efficient multiplexed I/O handling in server applications.
This article provides a comprehensive guide to Java I/O, explaining the distinction between byte and character streams, the role of abstract and concrete stream classes, how the Decorator pattern extends functionality, the enhancements introduced in NIO.2, and the use of asynchronous I/O with Futures and Callbacks.
This article translates hardware latency into human‑scale time, revealing how disks, networks, memory and other components appear painfully slow from a CPU’s viewpoint and why performance optimization is a complex, system‑wide challenge.
This article introduces Java NIO fundamentals, explaining the key concepts of Channel, Buffer, and Selector, comparing them with traditional I/O streams, and providing code examples for file reading, writing with FileChannel, and illustrating how selectors enable single‑threaded multiplexed I/O handling.
This article explains the fundamental concepts of I/O models—including synchronous vs. asynchronous, blocking vs. non‑blocking, the five classic I/O models, and the Reactor and Proactor design patterns—using clear definitions, examples, and Java code snippets to illustrate each approach.
This article explains the concept of Java I/O streams, their classifications, and provides detailed code examples for InputStream, FileInputStream, FileOutputStream, BufferedOutputStream, and DataOutputStream, illustrating how to read, write, and manage resources effectively.
This article introduces Java I/O fundamentals, explains the four I/O interface groups, details the File class methods, provides a complete code demo with execution results, and highlights important points such as mkdirs behavior and cross‑platform path separators.
This article explains how Java byte streams operate directly on files without buffering while character streams use an intermediate buffer, demonstrates the effects with code examples, and discusses when to use each stream type in practice.
This guide explains how to assess and improve server performance by understanding key metrics such as CPU utilization, memory management, and disk I/O, introducing fundamental concepts, analysis methodologies like 5W2H and load‑characteristic summarization, and recommending practical Linux tools such as uptime, vmstat, top, perf, and DTrace for comprehensive troubleshooting.
This article provides a comprehensive guide to server performance optimization, covering the fundamentals of CPU, memory, and I/O analysis, practical methodologies, essential tools, and real‑world case studies to help operations engineers identify bottlenecks and improve system stability.
This article explains Oracle's system structure, the physical files used by RAC and ASM, their I/O patterns for OLTP and OLAP workloads, and provides detailed recommendations for ASM diskgroup design, redundancy, AU sizing, RAID choices, and SSD optimization for read and write intensive database operations.
This article examines how different server‑side languages model I/O, compares blocking and non‑blocking approaches, discusses scheduling overhead, presents sample code for PHP, Java, Node.js, and Go, and offers benchmark insights to help developers choose the right technology for high‑load web applications.
This article explains the end‑to‑end storage I/O path, analyzes how each node contributes to overall latency, compares IOPS and throughput, and provides practical guidance on configuring storage for Microsoft SQL Server workloads.
