operating-system-scheduling.html


* created: 2025-05-18T14:52
* modified: 2025-07-08T12:52

title

Operating system scheduling

description

Scheduling describes the task of deciding in which order parallel processes get executed. There are multiple methods like FCFS, SJF, SRTN, RR, PS and more.

related notes

Scheduling: deciding who's next

Scheduling is the task of deciding which process is going to be executed next. How this decision is made strongly depends on your use case. There are a couple of methods used, which all have benefits and trade-offs.

This website can be used to compare a couple of these methods AnimOS CPU-Scheduling.

The decision is inn-acted upon by the Dispatcher.

First Come First Server (FCFS)

The process that gets registered first is also the process that finishes first; this behaves like a queue. This also applies when the process gets stopped by an interrupt.

Shortest Job First (SJF)

The process with the shortest runtime gets executed first.

Shortest Remaining Time Next (SRTN)

The verbose cousin of SJF. The process with the shortest remaining runtime gets executed next.

Round Robin (RR)

The process switches each time interval.