0 views collected around this technical thread.
This article explains the Linux Completely Fair Scheduler (CFS), covering its design goals, core concepts such as virtual runtime, weight, red‑black tree management, load‑balancing mechanisms, scheduling policies, and answers common questions about its operation and kernel code.
This article provides a comprehensive overview of Linux memory management, detailing the roles and mechanisms of the early boot memory allocator, the memblock subsystem, the buddy allocator for physical pages, and the slab allocator for small objects, including their data structures, algorithms, and practical usage scenarios.
This article explains the Linux Page Cache mechanism, covering its core concepts, read/write workflows, data consistency, optimization strategies, real-world use cases, advanced topics, common misconceptions, and practical tips for improving system performance and resource management.
This article explains the fundamental concepts of processes and threads, their relationship, resource allocation, scheduling, communication methods, practical use cases, and interview preparation tips, helping readers choose between multiprocessing and multithreading for various scenarios.
In the 1950s programmers wrote directly to hardware, but the fragility of hard‑coded memory and I/O led to the invention of a privileged “expert” kernel mode and a restricted “novice” user mode, with a special instruction to switch, forming the basis of modern system calls and operating system protection.
This article provides an extensive overview of core technical interview subjects—including operating‑system signals, process synchronization and data transfer methods, TLS encryption steps, common caching pitfalls and remedies, Java collection implementations, heap‑building algorithms, and various CPU scheduling strategies—offering concise explanations and practical code examples for each concept.
The article explains how hardware changes, especially the shift from BIOS to UEFI, rendered Windows 7 incompatible, detailing the boot process, security shortcomings of BIOS, and why newer systems like Windows 10 adopt faster, secure boot mechanisms, making Win7 increasingly obsolete.
This article explains the role, operation, and different modes of x86‑64 memory paging, describes how page directories and tables are set up in assembly, shows the relevant control‑register bits, and provides practical code examples for enabling and managing paging in a protected‑mode kernel.
This article explains how Linux-like operating systems use virtual memory and the MMU to map virtual addresses to physical memory, describes the data structures (vma_struct and mm_struct) used by uCore, details the page‑fault handling flow, classifies fault types, and shows how these mechanisms affect system performance.
This article explains the Linux kernel buddy memory allocation algorithm, covering its basic principles, allocation and reclamation processes, key data structures, initialization steps, code examples, advantages and drawbacks, as well as its applications and evolution across kernel versions.
This article explains what Linux kernel Oops messages are, distinguishes between BUG, Oops, and panic, outlines common causes, preparation steps, debugging tools, kernel configuration options, and provides a detailed case study with analysis and solutions for kernel Oops troubleshooting.
This article explains the core principles of I/O read/write operations, detailing the data preparation and copying stages, the roles of kernel and user buffers, synchronization models, and performance optimizations such as double buffering, circular buffers, zero‑copy, read‑ahead, and delayed write.
Adding more RAM only speeds up a computer when the existing memory is insufficient, because RAM supplies data to the CPU and serves as cache; with ample RAM the CPU remains the bottleneck, so extra memory mainly enables more simultaneous programs rather than increasing raw processing speed.
This article compiles a wide range of Linux C/C++ interview questions covering language fundamentals, data structures, algorithms, operating systems, networking, databases, and general problem‑solving approaches to help candidates assess and improve their technical knowledge.
This article provides a comprehensive, step‑by‑step explanation of how Linux receives network packets—from hardware DMA and interrupt handling through soft‑interrupt processing, kernel initialization, driver registration, and protocol‑stack traversal—culminating in delivery to the application layer via sockets.
This article explains the role of the Linux kernel buffer cache in file I/O, describes its data structures such as buffer_head, details how buffers are organized with hash tables and free lists, and walks through initialization, allocation, release, synchronization, and optimization techniques with code examples.
This article provides a comprehensive overview of the Linux process scheduler, explaining why scheduling is needed, how it works, the various scheduling policies such as real‑time and CFS, the mechanisms for priority and load balancing, and the historical evolution of Linux schedulers with code examples.
Xiaohongshu’s cloud‑native team transformed its over‑90% containerized services by introducing resource‑pooled mixed deployment, fine‑grained unified scheduling, and an elastic container pool with global HPA and cluster autoscaling—driving 35% of resources to mixed use, tens of millions of daily core‑hours, and roughly 30% cost savings while preparing for hybrid‑cloud expansion and FinOps.
The article explains how the Linux kernel’s initcall mechanism automatically orders and executes driver initialization functions through specially defined macros and linker sections, improving maintainability, memory usage, and system stability during the boot process.
The article announces a free programmer book giveaway via a backend command and then introduces Wubuntu, a Windows‑styled Ubuntu distribution that fully replicates Windows UI, runs without TPM or Secure Boot, supports Windows .exe/.msi and Android apps, and provides download links for its free and professional editions.