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
Liangxu Linux
Liangxu Linux
Jun 16, 2024 · Fundamentals

Build a Cooperative Multitasking System in C Using setjmp/longjmp

This article explains how to use the C standard library functions setjmp and longjmp to create a lightweight cooperative multitasking scheduler without timers, covering their mechanics, stack handling, task creation, time‑slice yielding, and provides complete example code and a Git repository link.

Ccooperative multitaskinglongjmp
0 likes · 7 min read
Build a Cooperative Multitasking System in C Using setjmp/longjmp