Research areas: Windows & Linux platforms, C/C++ backend development, embedded systems and Linux kernel, etc.
This article explains what network packet loss is, its common causes—from hardware faults to congestion and misconfiguration—and provides a step‑by‑step, production‑ready methodology for diagnosing and resolving loss using tools such as ping, traceroute, Wireshark and tcpdump.
This article systematically breaks down Linux's core memory mechanisms, identifies common performance bottlenecks, and demonstrates how to use tools like numastat, perf, and Valgrind together with kernel parameters such as swappiness and min_free_kbytes to achieve practical memory optimizations.
Linux’s default 4 KB pages cause massive page tables and TLB misses in high‑memory workloads; this article explains the HugePage mechanism, its types, how it reduces page‑table entries, improves TLB hit rates, lowers fragmentation, and provides step‑by‑step configuration for static and transparent huge pages in production.
Linux’s Virtual Memory Area (VMA) is the kernel’s core structure for managing a process’s address space, and this article explains its definition, key fields, linked‑list and red‑black‑tree organization, allocation, protection, page‑fault handling, copy‑on‑write, and practical usage examples.
This article demystifies lock‑free queues by explaining their low‑level implementation, atomic operations, memory barriers, and the four SPSC/MPMC models, while also covering ABA problems, false sharing avoidance, and practical C++ code examples to help developers truly understand high‑concurrency fundamentals.
This article explains the low‑level logic of Linux workqueues, detailing how asynchronous tasks are represented, how work items interact with kernel threads, the key data structures involved, scheduling strategies, and practical code examples for creating, queuing, and managing workqueue tasks.
This article explains Linux kernel threads from basic concepts to deep internals, covering their data structures, creation, execution flow, scheduling strategies, context‑switch overhead, synchronization primitives, interrupt handling, and a practical kswapd memory‑reclaim case study, providing concrete code examples and step‑by‑step analysis.
This guide explains what a Core Dump is, why it is essential for Linux crash analysis, how the kernel creates it, common signals that trigger it, typical causes of crashes, and step‑by‑step configuration and GDB techniques to capture and debug Core Dump files effectively.
This article explains the four necessary conditions for Linux deadlocks, demonstrates each with concrete pthread examples, reviews kernel lock types, introduces detection tools such as Lockdep, gdb, pstack and ftrace, and walks through a real‑world cluster case study with step‑by‑step analysis and remediation.
The article explains the Linux kernel Seqlock mechanism—a lightweight lock‑free synchronization primitive that uses a sequence number and a spinlock to allow concurrent reads and writes, compares it with spinlocks and rwlocks, and shows real kernel and user‑space examples.
