Research areas: Windows & Linux platforms, C/C++ backend development, embedded systems and Linux kernel, etc.
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.
SLUB, the default Linux kernel memory allocator, reduces fragmentation and improves allocation speed for frequently created objects like task_struct and inode by using per‑CPU caches, object slabs, and NUMA‑aware node caches, with detailed structures, allocation/free paths, tuning parameters, and real‑world case studies.
This article provides a comprehensive deep‑dive into Linux kernel mutex locks, explaining their principles, implementation, and APIs, and demonstrates through detailed C/C++ examples how to use them safely to avoid data races, deadlocks, and performance bottlenecks in multithreaded kernel and user‑space code.
The article explains how Linux uses page cache, inode cache, and dentry cache to accelerate file operations, detailing their structures, lookup mechanisms, LRU eviction, and real‑world performance impact, and shows step‑by‑step path resolution with code examples.
This article explains Linux kernel spinlocks—from basic concepts and atomic operations to memory barriers, busy‑waiting, and proper usage—illustrating common pitfalls like deadlocks, priority inversion, and recursion, and provides practical guidelines, code examples, and debugging tools to help developers implement safe, efficient synchronization.
The article explains how Linux’s page cache bridges memory and disk, detailing its read/write mechanisms, dirty page handling, pre‑read optimization, kernel parameters, and practical tuning tips for static file serving, databases, and logging, showing why mastering it is essential for performance.
This article provides a deep technical walkthrough of Linux's Virtual File System (VFS), explaining its design goals, core data structures, caching mechanisms, and step‑by‑step file operation flows—including mount, open, read, and write—while illustrating each concept with concrete code examples and real‑world scenarios.
This comprehensive guide explores the Linux kernel’s architecture, core subsystems, source‑tree layout, and dynamic module management while offering practical learning paths, essential command‑line tools, code examples, and curated reading material for anyone aiming to master operating‑system internals.
This article explains the fork system call in the Linux kernel, details the copy‑on‑write (COW) mechanism that underpins its efficiency, provides code examples, and explores practical scenarios and performance implications for process creation, memory usage, and concurrent server programming.
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.
