1 views collected around this technical thread.
The article traces the development of operating‑system process scheduling—from the naïve first‑come‑first‑served approach, through cooperative multitasking with a yield() system call, to timer‑driven preemptive round‑robin and priority schemes—highlighting each method’s strengths and shortcomings.
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.
This article explains the concepts, reasons, and implementation details of Linux process scheduling, covering cooperative and preemptive scheduling, run‑queue structures, wake‑up paths, scheduling ticks, context switching, priority handling, and the various scheduling classes used in the kernel.
This article introduces a new book 'Deep Understanding of Linux Processes and Memory' that systematically explains CPU, memory, and process scheduling principles, covering hardware fundamentals, virtual memory, Golang coroutines, container resource management, and performance optimization techniques.
This article provides a comprehensive overview of process and thread scheduling in operating systems, explaining the role of the scheduler, different scheduling algorithms such as FCFS, SJF, round‑robin, priority, multilevel‑queue and lottery, their classification for batch, interactive and real‑time environments, and the key performance goals like fairness, throughput and response time.
This article explains why a Linux system can show a high load average while CPU utilization remains low, covering the concepts of load, multi‑tasking operating systems, process states, scheduling, and common scenarios that cause I/O‑bound load spikes.
High system load can occur even when CPU usage is low, typically due to many processes waiting for disk I/O; this article explains load concepts, process states, scheduling, and common scenarios such as excessive I/O requests, unindexed MySQL queries, and faulty external storage that cause such bottlenecks.
The article explains why an Android app’s main thread can be blocked by detailing Linux process versus thread concepts, the Completely Fair Scheduler’s priority and vruntime calculations, real‑time and nice priorities, and how Android uses cgroups and SchedPolicy enums to allocate CPU shares among foreground, background, and system threads.
The article explains Android’s process lifecycle and how component states translate into OOM adjustments, LowMemoryKiller levels, scheduling groups, and Linux thread priorities, detailing the mapping of importance levels to oom_score_adj, schedGroup, procState, and cgroup policies, with code examples and a bug case.
This article explains the concepts of nice and priority values in Linux, how they differ, their impact on process scheduling, and compares historic O(1) and modern CFS schedulers, including real‑time scheduling policies, providing practical command examples for administrators.