Tagged articles
4 articles
Page 1 of 1
Liangxu Linux
Liangxu Linux
Jun 29, 2025 · Fundamentals

From FCFS to Preemptive Multitasking: Lessons from 1960s IBM Scheduling

The article recounts a 1960s IBM system engineer’s struggle with process scheduling, tracing the evolution from simple First‑Come‑First‑Served queues through cooperative multitasking with a yield() call, to timer‑driven preemptive round‑robin and priority‑based algorithms, highlighting each method’s strengths and pitfalls.

FCFSOperating SystemsPriority Scheduling
0 likes · 7 min read
From FCFS to Preemptive Multitasking: Lessons from 1960s IBM Scheduling
IT Services Circle
IT Services Circle
Apr 30, 2025 · Fundamentals

Evolution of Process Scheduling: From FCFS to Preemptive Multitasking

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.

FCFSMultitaskingOperating Systems
0 likes · 6 min read
Evolution of Process Scheduling: From FCFS to Preemptive Multitasking
ITPUB
ITPUB
Feb 17, 2022 · Fundamentals

Mastering Linux Process Scheduling: From FCFS to CFS Explained

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.

CFSFCFSLinux kernel
0 likes · 31 min read
Mastering Linux Process Scheduling: From FCFS to CFS Explained
Programmer DD
Programmer DD
Dec 30, 2020 · Operations

Master Elevator Scheduling: Classic and Real‑Time Algorithms Explained

This article explores elevator scheduling challenges, starting with a relatable programmer’s missed movie, then delves into traditional algorithms like FCFS, SSTF, SCAN, LOOK, and SATF, followed by real‑time strategies such as EDF, SCAN‑EDF, PI, and FD‑SCAN, and finally discusses modern group‑control research and practical system specifications.

FCFSOperations Researchalgorithm design
0 likes · 13 min read
Master Elevator Scheduling: Classic and Real‑Time Algorithms Explained