Linux Kernel Journey
The article explains a kernel‑space memory profiler that uses a compile‑time code‑tagging library and special linker sections to record allocation callers and byte counts with minimal CPU overhead, allowing the tool to be deployed in production.
The article explains how Type‑1 and Type‑2 hypervisors differ in their use of ARM64 exception levels, outlines their shared responsibilities such as resource, scheduling, and device management, and compares their architectures and performance through a serial‑port example, highlighting the trade‑offs of each approach.
This article provides a detailed, step‑by‑step overview of every Linux interprocess communication mechanism—including pipes, signals, files, semaphores, shared memory, message queues, sockets, and Unix domain sockets—complete with concepts, usage scenarios, diagrams, and full code examples.
The article explains how eBPF‑based sched_ext enables painless design, implementation and deployment of new Linux schedulers, offering faster iteration, better observability, lower entry barriers, and showcases simple FIFO examples, advanced LAVD and rustland schedulers, their adoption in major distros, and performance gains for gaming workloads.
This article walks you through why CMake is a more elegant, cross‑platform alternative to hand‑written Makefiles, explains its core benefits, and provides a complete, hands‑on tutorial that covers the basic workflow, a minimal project example, multi‑source handling, and multi‑directory organization with clear code snippets.
This article explains what ELF files are, details their header, program header table, sections and section header table, and walks through how Linux uses fork and execve to clone a child process and load an ELF binary into a new address space.
This article explains the Linux kernel’s memory management for a process, covering virtual address spaces, page‑fault handling, VMA allocation, stack and heap initialization, sbrk/brk usage, thread‑stack creation, and the glibc ptmalloc heap allocator with concrete code examples and diagrams.
This article explains how to use eBPF and perf events to trace NFS read/write system calls, capture kernel and user stack traces, resolve them to source locations via DWARF, and generate flame‑graph data that is pushed to Pyroscope for performance analysis.
The article outlines six distinct kernel‑level bugs affecting the eBPF tailcall feature across multiple Linux versions, explains the underlying causes and the commits that fixed them, and introduces a detection tool to verify whether a running kernel is affected.
The article explains how the Earliest Eligible Virtual Deadline First (EEVDF) scheduler, introduced in Linux 6.6, replaces CFS by using virtual deadlines and a lag concept to achieve both fairness and interactivity, and walks through concrete formulas, parameter settings, and step‑by‑step scheduling examples.
