This article explains the distinction between user space and kernel space, describes blocking and non‑blocking I/O, and compares select, poll, and epoll multiplexing techniques, including signal‑driven and asynchronous I/O models with code examples.
This article explains the separation of user and kernel space, compares blocking, non‑blocking, multiplexed, signal‑driven, and asynchronous I/O models, and details the select, poll, and epoll mechanisms used to efficiently handle multiple file descriptors in Linux.
This comprehensive guide walks through Linux memory management fundamentals, covering virtual address spaces, physical memory zones, user‑space structures, kernel allocation strategies like the buddy system and slab allocator, and practical commands for inspecting memory usage.
This article explains the distinction between kernel space and user space in a 32‑bit Linux system, covering address layout, privilege levels, mode transitions, system calls, and the overall OS structure to illustrate how separating these spaces enhances stability and security.
This article explains how a 32‑bit operating system divides its 4 GB address space into kernel and user regions, why this separation protects system stability, how kernel and user modes differ, and the mechanisms—such as system calls—that let processes move between them.
This article explains Linux's separation of user and kernel address spaces, details the five classic network I/O models—blocking, non‑blocking, I/O multiplexing, signal‑driven, and asynchronous—and introduces zero‑copy techniques such as mmap, sendfile and splice to reduce data copying overhead.
