This article explains Linux system calls as the bridge between user‑space programs and the kernel, covering their purpose, importance, the distinction between user and kernel space, the execution process, classifications, invocation methods, and performance considerations, with clear examples in C.
This article explains what Linux system calls are, why they are essential for resource management, process control and device access, describes the separation of user and kernel space, details the execution flow of a system call, and provides multiple C code examples for direct and library‑based invocation.
Netlink is a Linux‑specific inter‑process communication mechanism that provides asynchronous, full‑duplex, and multicast communication between user space and kernel space, offering advantages over traditional IPC methods and serving a wide range of networking, monitoring, and system‑management scenarios.
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 explores Linux memory architecture, address spaces, allocation strategies like the buddy and slab allocators, user‑ and kernel‑level memory management, DMA, and practical tips to avoid common memory bugs and performance issues.
The article explains the distinction between user mode and kernel mode, why Go chooses to manage goroutines in user space, and how this design improves efficiency, flexibility, resource utilization, and developer experience compared with traditional kernel‑mode thread scheduling.
The article examines the scalability limitations of the Linux kernel TCP/IP stack, comparing its packet‑processing and connection‑setup performance with user‑space stacks such as mTCP and F‑Stack, explains how hash‑table locking and spin‑lock contention cause poor CPS scaling, and argues why user‑space implementations often achieve higher throughput despite their own trade‑offs.
This article provides a comprehensive guide to Linux memory management, covering memory fundamentals, address space layout, paging and segmentation, the buddy and slab allocation algorithms, kernel and user‑space memory pools, common pitfalls, and practical tools for monitoring and debugging memory usage.
This article explains the distinction between user and kernel space, outlines the steps involved in a process switch, and compares several Linux I/O models—including blocking, non‑blocking, multiplexing, and asynchronous approaches—highlighting their advantages and drawbacks.
This article provides an in‑depth overview of Linux memory architecture, including address spaces, segmentation and paging, memory allocation strategies such as the buddy and slab allocators, kernel and user‑space memory pools, DMA considerations, common pitfalls, and practical tools for monitoring and optimizing memory usage.
This article explains how Linux manages virtual memory by describing the organization of virtual and physical address spaces, the mechanisms of segmentation and paging, multi‑level page tables, and the layout of user‑mode and kernel‑mode memory, including relevant kernel code examples.
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 the concepts of kernel space and user space in a 32‑bit OS, why they are separated, the distinction between kernel mode and user mode, how processes transition between them, and the overall Linux system structure.
This article provides a comprehensive guide to Linux memory management, covering the memory organization, address spaces, fragmentation causes and mitigation, the buddy and slab allocation algorithms, kernel and user‑space memory pools, common pitfalls, and practical tools for monitoring and debugging memory usage.
This article provides a comprehensive technical guide to DPDK and SPDK, covering their background, architecture, user‑space I/O bypass mechanisms, core performance optimizations such as HugePages, SIMD and cache management, and practical ecosystem recommendations for building high‑throughput network and storage services.
DPVS is an open‑source, DPDK‑based user‑space load balancer that achieves line‑rate throughput by assigning each worker to a dedicated CPU core and NIC queue, provides lock‑free per‑CPU data structures and multiple forwarding modes including NAT64, and simplifies maintenance while supporting IPv4/IPv6 in large‑scale production deployments.
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.
This article provides a comprehensive overview of NFSv4’s design goals, security and performance improvements, and details the four major advantages of NFS‑Ganesha, its modular architecture, memory and thread management, caching mechanisms, and a practical Ceph RGW integration example.
This article provides a comprehensive overview of the NFSv4 protocol, its design goals, and the advantages of the user‑space NFS‑Ganesha implementation—including memory management, portability, simplified access, FUSE integration, modular architecture, threading, caching strategies, and its integration with Ceph RGW.
This article explains the differences between user space and kernel space in Linux, describes process and interrupt contexts, outlines how the kernel manages memory and execution modes, and clarifies related concepts such as kernel/user mode, context switches, and the system’s virtual address layout.
