OS Assignment 2

Rejuanul Huq Sanny - 2010876114

February 2024

1 Based on Silberschatz’s and Tanenbaum’s Op-

erating System Books, point out the similari-
ties of scheduling algorithms with the approaches
discussed at 13.02.2024 classroom.
The ideas that are similar to the algorithms that are discussed in the book are:
• The first idea discussed on class is ”Serve to current process” which is
similar to the First-Come, First Served Scheduling because here all the
processes that are requested to the CPU are putted on a queue and pro-
cessed serially.

• The second idea was ”Serve serially according to priority of process” which
is similar to the algorithm priority scheduling where process are scheduled
according to their priority.
• The third idea was ”Process will access for certain time and then have to
wait” which is similar to the Round-Robin Scheduling, which is designed
especially for time-sharing system. It is similar to the first come first serve
scheduling but the system to switch between processes is added to it.
• The seventh idea was ”Process will get service if its requirement needs
short time to full fill” which is similar to the Shortest-Job-First Scheduling
where the shortest jobs/processes are done first and long processes are
done accordingly.
• The ninth idea was ”Group processes based on requirement similarly and
then start with group with more demand” which is similar to the Multilevel
queue scheduling which is created for situations in which processes are
easily classified into different groups.

1
2 Write down positive and negative points of
each scheduling algorithm.
The positive and negative points of the scheduling algorithms are described
bellow:

• First-Come, First-Served Scheduling:

– Positive:
∗ Simple: It is extremely easy to implement.
– Negative:
∗ Poor Turnaround Time: This can result in poor turnaround
time, especially if long-running processes are scheduled before
shorter ones.
∗ Convoy Effect: This is susceptible to the convoy effect, where
short processes get stuck waiting behind long-running processes.
∗ Inefficiency with Varying execution Times: This does not
consider execution time of processes.
∗ No Prioritization: This does not prioritize processes based on
their importance, urgency, or other criteria.
• Shortest Job-First Scheduling:

– Positive:
∗ Minimizes average waiting time.
∗ Minimizes turnaround time.
∗ Improve response time for short process.
– Negative:
∗ Longer processes may suffer from starvation under this schedul-
ing if a continuous stream of short processes keeps arriving.
∗ This scheduling can be unpredictable, especially in scenarios
where the execution times of processes vary widely.
∗ This algorithm might not be suitable for interactive system.
• Priority Scheduling:
– Positive:
∗ Priority scheduling allows for the allocation of resources based
on the importance or urgency of processes.
∗ Priority scheduling allows system administrators or users to as-
sign priorities to processes based on specific criterion.
∗ Priority scheduling can lead to improved system responsiveness.
– Negative:

2
 ∗ Priority scheduling can lead to starvation, where low-priority
processes may not receive sufficient CPU time to execute.
∗ Improper management or assignment of priorities can lead to
inefficiencies.
• Round-Robin Scheduling:
– Positive:
∗ This algorithm provides each process an equal share of CPU
time.
∗ This algorithm is suitable for time-sharing systems where multi-
ple processes access the system concurrently.
∗ This algorithm minimizes their response time and improves sys-
tem responsiveness.
– Negative:
∗ This algorithm may be inefficient with long-running processes if
a process requires more CPU time than the time slice allocated
to it.
∗ This algorithm may lead to poor CPU utilization.
• Multiple-Queue Scheduling:
– Positive:
∗ This algorithm allows for the prioritization of different types of
processes.
∗ By categorizing processes into multiple queues based on their
characteristics, This algorithm can efficiently manage resources
for each type of workload.
– Negative:
∗ This algorithm is difficult to implement.
∗ Managing multiple queues in this algorithm requires careful con-
sideration of priorities.

3 Is their any scheduling algorithm which was

not discussed at today’s class? If yes, write
down short notes on that algorithm.
Ans: Yes, The Multilevel Feedback Queue Scheduling algorithm isn’t discussed
at today’s class.
Multilevel Feedback Queue Scheduling: This algorithm allows a pro-
cess to move between queues. The idea to separate processes according to the
characteristics of their CPU bursts. If a process uses too much CPU time, it
will be moved to a lower-priority queue. This form of aging prevents starvation.