Operating Systems · Chapter 15

Real-Time Scheduling Simulator

Compare fixed-priority Rate Monotonic scheduling with dynamic-priority Earliest Deadline First. Observe periodic releases, CPU utilization, and deadline misses.

Algorithm Simulation length Scenario

Periodic Tasks

Task	Execution C	Period T	Deadline D	Utilization C/T

Scheduling Result

Total utilization–

RM bound–

Jobs released–

Deadline misses–

Run the simulation to evaluate the task set.

Concept Guide

Rate Monotonic (RM): shorter period means higher fixed priority.

Earliest Deadline First (EDF): among ready jobs, the job with the nearest absolute deadline gets highest priority.

Utilization: for periodic task i, utilization is Cᵢ/Tᵢ.

RM utilization bound: for n independent periodic tasks with deadline equal to period, a sufficient schedulability bound is n(2^(1/n)-1).

Deadline miss: a job has remaining execution time when its absolute deadline arrives.

This simulator assumes one CPU, independent periodic tasks, no blocking, and integer execution units.