This article explains how real‑time operating systems (RTOS) schedule tasks, covering priority‑based, time‑slice, cooperative, and preemptive algorithms, task states, priority determination, and techniques to meet strict real‑time requirements.
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 explains the distinction between preemptive and non‑preemptive scheduling and provides a concise overview of common process scheduling algorithms—including FCFS, SJF, HRRN, Round‑Robin, priority and multilevel feedback queue—highlighting their principles, advantages, and drawbacks.
This article explains how vLLM’s PagedAttention, inspired by operating‑system virtual‑memory paging, dynamically allocates KV‑cache memory to dramatically reduce GPU memory fragmentation, improve throughput, and handle scheduling, preemption, and distributed inference for large language models.
This article explains how Go’s goroutine scheduler works, covering the fundamentals of OS thread scheduling, the transition from the old G‑M model to the modern G‑P‑M model, pre‑emptive scheduling strategies, lifecycle details, practical debugging tools, and performance‑related design choices.
The article explains how Thread.Sleep works by describing operating‑system scheduling concepts such as time‑slice and preemptive algorithms, answers common questions about Sleep(1000) and Sleep(0), and clarifies why the thread may not resume exactly after the specified delay.
This comprehensive guide walks through the fundamentals of process scheduling in operating systems, covering scheduling concepts, OS classifications, process types, priority mechanisms, preemptive vs cooperative models, design goals, classic algorithms such as FCFS, SJF, RR, MLFQ, and the evolution of Linux schedulers from O(n) and O(1) to the modern CFS, complete with code excerpts and practical examples.
