There are various algorithms to schedule the CPU.
- First Come, First Served Scheduling
- Shortest Job Scheduling
- Priority Scheduling
- Round-Robin Scheduling
First Come First Served Scheduling – It simply assign the processor to the process which is first in ready queue. It is also called fair scheduling when processor has short jobs but when long jobs is used it become unfair because important jobs has to wait for execution. It is similar to FIFO (First in first out).
Example – Consider the following set of processes that arrive at time 0, length of CPU Burst time given in milliseconds and the burst time indicates that how much time the process needs the CPU.
Shortest Job Scheduling Algorithm – It is one of the best CPU Scheduling algorithm in term of minimum average (more…)
This content is restricted to site members. If you are an existing user, please log in. New users may register below.