Comparison of Round-Robin Scheduling and Priority Scheduling

Running head: COURSEWORK EXERCISE SHEET 2
Coursework Exercise Sheet 2
Name of the Student
Name of the University
Author’s Note

1
COURSEWORK EXERCISE SHEET 2
Blog post on comparison of Round-Robin Scheduling and Priority
Scheduling
The usage of computers have increased from earlier times and everybody works on
lots of programs that usually slows down a network and thus a process is developed for
dealing with the workflows. The scheduling algorithms are introduced for accessing the
resources and management of multitasking for allocating one process at a time. There are
different types of schedulers that are used for choosing the next process to run such as long-
term scheduling, medium term scheduling and short term scheduling (Fataniya and Patel
2018). The long term scheduling is used for identifying the jobs that can be queued and
waited for its turn to execute. The mid term scheduler is used for removing the process from
the secondary memory and it works by swapping the inactive or low priority processes. Short
term scheduling is responsible for identifying the process that are ready for execution and
running them (Lakshmanan 2017). The scheduling algorithm are used for taking decision for
allocating resource they are requesting to the process that are waiting. The decision depends
on the type of algorithm and the blog post is created after studying round robin scheduling
and priority scheduling algorithm.
Round Robin Scheduling
This algorithm is not dependent on priority of the task and each of the process are
allocated an equal frame of time for its execution. A circular order is followed for the
execution of the algorithm and thus each of the job has an quantum time for its running. In
case the time allocated is not enough to finish the process the execution is stopped after the
time slice is over and the next process is executed (Pinedo 2016). The process gets its turn
after the full cycle is completed and until then it is sent to waiting state. If the process is
finished within the allocated time it is dropped from the list and a new process is added to it

2
COURSEWORK EXERCISE SHEET 2
and positioned at the end. Starvation cannot occur in this algorithm but a process can have to
wait too long for its completion.
Priority Scheduling
Each of the processes running in the system are assigned with a priority and according
to it the process is sent to running, waiting or ready state. The process that runs at first should
have the highest priority and the rest of the process waits for their turn. The priority
scheduling algorithm are of two types such as pre-emptive or non-preemptive (Das, George
and Jaya 2017). In case of pre-emptive scheduling the priority of a process that arrives
recently is compared with the running process and in case the recently arrived process have
higher priority the CPU is occupied by the new process (Dash and Samantra 2016). In case of
non-preemptive scheduling the process that comes to the CPU is listed on the top of the
queue for its execution.
This process have a major drawback because the process that have low priority is
blocked indefinitely to get the CPU but the problem is solved with the application of “aging”
where the priority of the processes are increased which are waiting of a long duration of time.
Experiment
For the identification of efficiency of the scheduling algorithm different types of test
is performed with different condition and creating different phase for analysing the result of
the test. In the test priority algorithm uses the names of the process and their priorities
(Manirabona, Boudjit and Fourati 2016). Using the priority algorithm it has been found that
the process names are taken with their respective priorities and the priority is compared with
each other and the highest priority process catches while the remaining process waits
(Klusman 2016). The waiting time of the rest of the process increases with the execution of