COSC240 • Operating Systems

Week 3: CPU Scheduling & Resource Allocation

Analyze CPU burst distributions, dispatch latency, batch scheduling algorithms, interactive multi-level feedback queues, and real-time scheduling.

📚 What You Will Learn
  • Core architectural mechanics and low-level data structures.
  • Kernel operational states, hardware interrupts, and protection boundaries.
  • Theoretical trade-offs, performance implications, and industry standards.
✅ What You Should Do
  • Review lecture notes and assigned textbook chapters.
  • Explore interactive pedagogical steppers and simulation modules.
  • Complete weekly tutorials, practical lab assignments, and review quizzes.
📂 Course Modules & Deep-Dive Texts
Module 01

Introduction to Scheduling

Examine scheduling criteria, CPU-I/O burst cycles, dispatcher latency, and preemptive vs. non-preemptive design.

CPU BurstDispatcherPreemptionThroughput
Module Overview →
Module 02

Batch Scheduling Algorithms

Evaluate FCFS, SJF, Shortest Remaining Time Next (SRTN), and Highest Response Ratio Next (HRRN).

FCFSSJFSRTNConvoy Effect
Module Overview →
Module 03

Interactive Scheduling Algorithms

Master Round Robin, Multi-Level Feedback Queues (MLFQ), and Stride scheduling.

Round RobinMLFQQuantumPriority Boost
Module Overview →
Module 04

Real-Time & Multiprocessor Scheduling

Explore Rate Monotonic Scheduling (RMS), Earliest Deadline First (EDF), and SMP work-stealing.

RMSEDFWork StealingAffinity
Module Overview →