This article explains the core principles of Linux kernel memory management, detailing how the buddy system handles large contiguous pages while the SLUB allocator optimizes small-object allocation, and compares their performance, fragmentation handling, and real‑world usage in servers and embedded devices.
This article explains Linux process states—including running, sleeping, disk sleep, stopped, dead, zombie, and orphan—detailing their meanings, kernel definitions, how to observe them with code examples, and the implications for system resource management.
This article explains step‑by‑step how a key press is detected by the keyboard controller, generates an interrupt, is handled by the kernel driver, written to a device file, and finally delivered to an X Window client via IPC.
This article provides a comprehensive overview of operating systems, explaining their essence as software, detailing core functions such as process and memory management, device and file system handling, security, user interfaces, and describing key characteristics like concurrency, sharing, asynchrony, virtualization, as well as common OS classifications and architectural designs.
A worldwide Windows blue‑screen outage was caused by a CrowdStrike Falcon update that introduced a bug, leading to system crashes across many industries, and the article explains the incident, its impact, a temporary fix, and the typical technical reasons behind blue‑screen errors.
This guide explains Linux process concepts, how to list and inspect processes using ps and pstree, terminate them with kill or killall, and schedule one‑time or recurring tasks via the at and crontab utilities, complete with command syntax and examples.
This article explains core memory‑management concepts—including logical vs. physical address spaces, allocation strategies, paging, segmentation, virtual memory, and page‑replacement algorithms—while highlighting how operating systems prevent overflow and optimize memory usage.
This article explains Linux's memory management, detailing how physical memory is organized into pages, zones, and nodes, how virtual addresses are structured for user and kernel space, and how page tables, the buddy system, SLUB, and TLB work together to map virtual addresses to physical memory.
This article explains what the Linux kernel is, explores its different architectures—including microkernel, monolithic, and hybrid designs—covers kernel file locations, module handling, and offers a comprehensive learning roadmap with recommended books and hands‑on advice for anyone wanting to understand operating system fundamentals.
This article explains how mmap maps file segments into a process's virtual address space, how virtual memory and physical memory interact, and the mechanisms of address translation, paging, and segmentation that enable efficient memory sharing and file I/O in Linux.
Thread.Sleep pauses a thread for a specified duration, signaling the OS to exclude it from CPU competition, and Thread.Sleep(0) forces an immediate rescheduling, which can improve UI responsiveness by yielding control to other threads; the article explains these behaviors using time‑slice and preemptive scheduling analogies.
This guide explains the purpose and typical contents of each standard Linux directory—from /bin and /sbin for system binaries, through configuration files in /etc, device nodes in /dev, to variable data in /var and virtual information in /proc—providing a comprehensive overview of the Linux filesystem hierarchy.
This article explains the core concepts of Linux virtual memory, including why it exists, how paging and page tables work, the role of the MMU, swap usage, common pitfalls, and practical commands for inspecting and tuning memory behavior on a Linux system.
This article explains the fundamentals of Linux pipes and named pipes (FIFOs), their kernel implementation, read/write APIs with code examples, and an overview of signal mechanisms, types, and handling in the context of inter‑process communication.
This article explains Linux’s process memory organization, detailing how each process is represented by a task_struct, how the mm_struct describes virtual memory regions, the role of vm_area_struct for each segment such as code, data, BSS, heap, stack, and memory‑mapped areas, and how page faults trigger physical memory allocation.
This article introduces a research report that covers the basic concepts, classifications, key technologies, architecture, development history, and analysis of major Chinese operating system vendors, providing a comprehensive overview of the domestic OS landscape.
This article explains what an IDT is, how it is initialized, the structure of interrupt descriptor entries and gates, the implementation of traditional system calls via int 0x80, and the setup and handling of hardware interrupts in the Linux kernel.
This article explains how Linux manages processes and threads, describes the creation and lifecycle of processes, the role of the process control block, the causes and handling of zombie processes, and compares multi‑process and multi‑threaded designs, providing practical tips for avoiding common pitfalls.
This article explains Linux process fundamentals—including creation, the PCB, scheduling, and the emergence of zombie processes—details their causes and removal methods, and then compares processes with threads, covering multithreading implementation, issues, classifications, priorities, and synchronization techniques.
This article, translated from IBM’s RedBook, explains Linux process management fundamentals—including process lifecycle, threads, priorities, context switching, interrupt handling, process states, memory layout, and the O(1) scheduler—providing clear insights into how the kernel handles processes and impacts system performance.
