Scribd
Upload
170 views2 pages

Difference Between Scheduling Algorithms

The document summarizes and compares six different CPU scheduling algorithms: First Come First Served (FCFS), Shortest Job First (SJF), Priority Scheduling, Shortest Remaining Time, Round Robin (RR), and Multiple Level Queue (MLQ). FCFS executes processes in the order they arrive, resulting in long waiting times. SJF executes the shortest processes first based on burst time. Priority Scheduling prioritizes processes based on assigned priority levels. Shortest Remaining Time is the preemptive version of SJF. Round Robin allocates each process a time quantum to use the CPU before switching to the next process. MLQ uses different algorithms at each queue level depending on process priority and queue resid

Uploaded by

Shubham waghule
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
170 views2 pages

Difference Between Scheduling Algorithms

The document summarizes and compares six different CPU scheduling algorithms: First Come First Served (FCFS), Shortest Job First (SJF), Priority Scheduling, Shortest Remaining Time, Round Robin (RR), and Multiple Level Queue (MLQ). FCFS executes processes in the order they arrive, resulting in long waiting times. SJF executes the shortest processes first based on burst time. Priority Scheduling prioritizes processes based on assigned priority levels. Shortest Remaining Time is the preemptive version of SJF. Round Robin allocates each process a time quantum to use the CPU before switching to the next process. MLQ uses different algorithms at each queue level depending on process priority and queue resid

Uploaded by

Shubham waghule
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 2

FCFS SJF Priority Shortest Round Multiple

Scheduling Remaining Time Robin Level


Queue
First Come Shortest Job Priority the preemptive Round- MLQ
First Served First (SJF) Scheduling version of Shortest Robin (RR) executes the
(FCFS) executes the executes the Job Next executes the process
executes the processes processes (SJN) algorithm, processes depending
processes in based upon according to where the based upon upon the
the order in their burst the priority processor is the time priority if
which they time i.e. in i.e. process allocated to the quantum the level of
arrive i.e. ascending with higher job closest to defined i.e. queue in
the process order of priority is completion. each which the
that arrives their burst executed process is process
first is times. first. executed for resides and
executed a fixed further
first. amount of execution is
time. dependent
upon the
algorithm
used in that
level.
FCFS is non SJF is also Priority It is a preemptive Round- MLQ can
preemptive non- Scheduling algorithm. Robin (RR) be both non
in nature. preemptive is both is preemptive
but its preemptive preemptive and
preemptive and non- in nature. preemptive
version is preemptive depending
also there in nature. upon the
called conditions.
Shortest
Remaining
Time First
(SRTF)
algorithm.
FCFS The average The average It may or may not The average The average
results in waiting waiting time minimize the waiting waiting
quite long time for and average average waiting time for time for
waiting given set of response time for each given set of given set of
time for the processes is time is process. processes is processes is
processes minimum. unknown quite small dependent
and thus beforehand. and depends upon the
increases on the time tupe of
average quantum. algorithms
waiting used in
time. various
levels of
multi level
queue.
FCFS The real It is easy to Shorter processes It is quite It is quite
algorithm is difficulty implement run fast and longer easy to complex
the easiest with SJF is and best processes show implement and difficult
to knowing the suited for poor response RR. to
implement length of real time time. implement.
in any the next operating
system. CPU systems.
request or
burst.
A process A long The problem Both SJF and Each It leads to
may have to process may of blocking SRJF may lead to process is the
wait for never get of a process process starvation executed starvation
quite long executed can be as long processes and every of processes
to get and the solved using may be held off user feels at the lower
executed system may aging. indefinitely if that his levels.
depending keep short processes are work is
on the burst executing continually added. being done
time of the the short as the CPU
processes processes. gives equal
that have amount of
arrived first. time to each
process.

You might also like