Research areas: Windows & Linux platforms, C/C++ backend development, embedded systems and Linux kernel, etc.
This article breaks down the fundamentals of process context switching, explaining CPU registers, program counters, the three-step switch routine, trigger conditions, performance impact, monitoring tools, and practical optimization techniques to help interview candidates answer confidently.
This comprehensive guide explains Linux system calls—the sole interface between user‑space programs and the kernel—covering their purpose, core logic for process, file, and memory management, the underlying interrupt mechanisms, parameter handling, and real‑world C code examples.
This article explains the fundamental differences between user mode and kernel mode in Linux, why the separation matters for security and stability, how mode switches occur via system calls, interrupts, and traps, and provides practical code examples and performance‑optimizing techniques such as zero‑copy and asynchronous I/O.
This article explains the role of the Translation Lookaside Buffer (TLB) in Linux virtual‑memory translation, covering basic address concepts, page‑table mechanics, TLB operation, flush and synchronization strategies, hardware vs software management, Linux kernel APIs, and a practical C benchmark comparing sequential and random memory accesses.
This article explains what memory barriers are, why they are essential for correct multi‑core operation in the Linux kernel, how different barrier types work, their implementation details, and practical guidelines for using them safely in synchronization primitives and driver code.
sk_buff is the backbone of Linux’s network stack, handling packet storage, metadata, memory management and protocol‑layer interactions; this article dissects its structure, pointer model, core operations, packet lifecycle, practical code examples, and common pitfalls such as memory shortage, data loss and performance bottlenecks.
This article provides a comprehensive, step‑by‑step analysis of Linux's io_uring, covering its architecture, design principles, workflow, performance advantages over traditional models like epoll, practical C code examples, optimization techniques, real‑world use cases, and the challenges developers may face when adopting it.
This article explains the core principles of Linux kernel memory management, detailing how the buddy system handles large contiguous pages while the SLUB allocator optimizes small-object allocation, and compares their performance, fragmentation handling, and real‑world usage in servers and embedded devices.
This article demystifies Linux's fork, exec, and copy‑on‑write mechanisms, explaining their inner workings, performance trade‑offs, and how they cooperate during typical command execution, while providing clear code examples and practical insights for developers and interview preparation.
The article explains the design, core concepts, algorithms, and implementation details of Linux 6.6's default EEVDF scheduler, compares it with the legacy CFS, provides practical commands for inspection and switching, and discusses real‑world scenarios and common pitfalls for developers and interview candidates.
