Search for a command to run...
A critical section is a piece of code where shared data is accessed. Only one thread should execute this area at a time. Multiple CPUs and multiple kernel threads may access the same memory at the sam
This Program manages object lifecycles across distinct parallel execution layers. It bridges lockless reader threads with a serialized writer thread and an asynchronous memory reclamation subsystem.
Building a Mini Linux Kernel Object Registry Using SLAB, RCU, Hash Tables, Shrinkers, and Procfs Modern Linux kernels manage massive numbers of dynamically created objects. Examples include: Inodes D
Building a Simple Linux Kernel Object Cache Using SLAB Allocator Linux kernel development is very different from user-space programming. In user space, developers typically use: malloc(); free(); Ins
Introduction Most Linux kernel tutorials focus on writing kernel modules directly in C. Most compiler tutorials focus on parsers, ASTs, and code generation. What happens when we combine both? This pro
Building a Linux Kernel Memory Allocation Engine with a Control Plane / Data Plane Architecture Introduction Most Linux kernel module tutorials demonstrate a simple memory allocation example using kma
Scatter/Gather I/O in Linux: A Deep Dive into readv() and writev() Efficient data transfer is a cornerstone of high-performance systems programming. Linux provides powerful mechanisms to optimize inpu
Linux Kernel Sysfs: Driver-Grade Data Management Example Overview Linux kernel sysfs is often introduced using trivial module parameters or static variables.This project goes beyond that baseline and demonstrates a driver-grade sysfs design built aro...
Building a Linux Kernel Module for Memory and Per-Process RSS via /proc User-space utilities such as top, htop, and free present a polished view of system memory usage, but they abstract away substantial kernel-level mechanics. To understand how Linu...
