P.E.

S POLYTECHNIC
Nagsenvan,Aurangabad

Department of Computer Engineering

[2023-24]

A Micro-project on
"create a report to calculate total waiting time and
turnaround time of process with different cpu scheduling
algorithm"

Ganesh Sable
1 Abstract 1

2 Introduction 2

3 CPU Scheduling Algorithms in Operating 3-4

Systems

4 Important CPU scheduling Terminologies 5-7

5 7-17

Types of CPU scheduling Algorithm

6 Conclusion 14
Developing CPU scheduling algorithms and understanding their impact in
practice can be difficult and time consuming due to the need to modify and
test operating system kernel code and measure the resulting performance on
a consistent workload of real applications.

As processor is the important resource, CPU scheduling becomes very

important in accomplishing the operating system (OS) design goals. The
intention should be allowed as many as possible running processes at all time
in order to make best use of CPU.

This paper presents a state diagram that depicts the comparative study of
various scheduling algorithms for a single CPU and shows which algorithm is
best for the particular situation. Using this representation, it becomes much
easier to understand what is going on inside the system and why a different
set of processes is a candidate for the allocation of the CPU at different time.
The objective of the study is to analyze the high efficient CPU scheduler on
design of the high quality scheduling algorithms which suits the scheduling
goals.Key Words:-Scheduler, State Diagrams, CPUScheduling, Performance
Scheduling of processes/work is done to finish the work on time. CPU
Scheduling is a process that allows one process to use the CPU while another
process is delayed (in standby) due to unavailability of any resources such as
I / O etc, thus making full use of the CPU. The purpose of CPU Scheduling is to
make the system more efficient, faster, and fairere

Whenever the CPU becomes idle, the operating system must select one of
the processes in the line ready for launch. The selection process is done by a
temporary (CPU) scheduler. The Scheduler selects between memory
processes ready to launch and assigns the CPU to one of them.
CPU Scheduling is a process of determining which process will own CPU for
execution while another process is on hold. The main task of CPU scheduling
is to make sure that whenever the CPU remains idle, the OS at least select
one of the processes available in the ready queue for execution. The selection
process will be carried out by the CPU scheduler. It selects one of the
processes in memory that are ready for execution.

Here are two kinds of Scheduling methods:

In Preemptive Scheduling, the tasks are mostly assigned with their priorities.
Sometimes it is important to run a task with a higher priority before another
lower priority task, even if the lower priority task is still running. The lower
priority task holds for some time and resumes when the higher priority task
finishes its execution.

In this type of scheduling method, the CPU has been allocated to a specific
process. The process that keeps the CPU busy will release the CPU either by
switching context or terminating. It is the only method that can be used for
various hardware platforms.
That’s because it doesn’t need special hardware (for example, a timer) like
preemptive scheduling.

To determine if scheduling is preemptive or non-preemptive, consider these

four parameters:

 A process switches from the running to the waiting state.

 Specific process switches from the running state to the ready state.

 Specific process switches from the waiting state to the ready state.

 Process finished its execution and terminated.

Only conditions 1 and 4 apply, the scheduling is called non-

preemptive. All other scheduling are preemptive.

  It is a time required by the process to
complete execution. It is also called running time.

 when a process enters in a ready state

 when process complete and exit from a system

 A number of programs which can be present in

memory at the same time.

 It is a type of program without any kind of user interaction.

 It is a kind of program having user interaction.

 It is the reference that is used for both job and user.

 Characterizes process execution, which alternates

between CPU and I/O activity. CPU times are usually shorter than the
time of I/O.

A CPU scheduling algorithm tries to maximize and minimize the following:

 CPU utilization:CPU utilization is the main task in which the operating
system needs to make sure that CPU remains as busy as possible. It
can range from 0 to 100 percent. However, for the RTOS, it can be
range from 40 percent for low-level and 90 percent for the high-level
system.

 Throughput: The number of processes that finish their execution per

unit time is known Throughput. So, when the CPU is busy executing the
process, at that time, work is being done, and the work completed per
unit time is called Throughput.

 Waiting time: Waiting time is an amount that specific process needs

to wait in the ready queue.

 Response time: It is an amount to time in which the request was

submitted until the first response is produced.

 Turnaround Time: Turnaround time is an amount of time to execute a

specific process. It is the calculation of the total time spent waiting to
get into the memory, waiting in the queue and, executing on the CPU.
The period between the time of process submission to the completion
time is the turnaround time.

 Interval Timer :Timer interruption is a method that is closely related to

preemption. When a certain process gets the CPU allocation, a timer
may be set to a specified interval. Both timer interruption and
preemption force a process to return the CPU before its CPU burst is
complete. Most of the multi-programmed operating system uses some
form of a timer to prevent a process from tying up the system forever.
It is a module that provides control of the CPU to the process. The Dispatcher
should be fast so that it can run on every context switch. Dispatch latency is the
amount of time needed by the CPU scheduler to stop one process and start
another.

 Context Switching

 Switching to user mode

 Moving to the correct location in the newly loaded program.

There are mainly six types of process scheduling algorithms

 First Come First Serve (FCFS)

 Shortest-Job-First (SJF) Scheduling

 Shortest Remaining Time

 Priority Scheduling

 Round Robin Scheduling

 Multilevel Queue Scheduling

First Come First Serve is the full form of FCFS. It is the easiest and most
simple CPU scheduling algorithm. In this type of algorithm, the process which
requests the CPU gets the CPU allocation first. This scheduling method can be
managed with a FIFO queue.

As the process enters the ready queue, its PCB (Process Control Block) is
linked with the tail of the queue. So, when CPU becomes free, it should be
assigned to the process at the beginning of the queue.

 It offers non-preemptive and pre-emptive scheduling algorithm.

 Jobs are always executed on a first-come, first-serve basis

 It is easy to implement and use.

 However, this method is poor in performance, and the general wait

time is quite high.

The full form of SRT is Shortest remaining time. It is also known as SJF
preemptive scheduling. In this method, the process will be allocated to the
task, which is closest to its completion. This method prevents a newer ready
state process from holding the completion of an older process.

 This method is mostly applied in batch environments where short

jobs are required to be given preference.

 This is not an ideal method to implement it in a shared system

where the required CPU time is unknown.

 Associate with each process as the length of its next CPU burst. So
that operating system uses these lengths, which helps to schedule the
process with the shortest possible time.
Priority scheduling is a method of scheduling processes based on priority. In
this method, the scheduler selects the tasks to work as per the priority.

Priority scheduling also helps OS to involve priority assignments. The

processes with higher priority should be carried out first, whereas jobs with
equal priorities are carried out on a round-robin or FCFS basis. Priority can be
decided based on memory requirements, time requirements, etc.

Round robin is the oldest, simplest scheduling algorithm. The name of this
algorithm comes from the round-robin principle, where each person gets an
equal share of something in turn. It is mostly used for scheduling algorithms in
multitasking. This algorithm method helps for starvation free execution of
processes.

 Round robin is a hybrid model which is clock-driven

 Time slice should be minimum, which is assigned for a specific

task to be processed. However, it may vary for different
processes.

 It is a real time system which responds to the event within a specific time
limit.

P1 4

P2 3

P3 5
 * Turnaround Time = Completion Time – Arrival Time

* TAT = Burst Time + Waiting Time

Let us assume that arrival and completion data (in hours) for a process is as
follows:

P1 (arrival time = 2, completion time

= 3) P2 (arrival time = 4, completion

time = 6) P3 (arrival time = 6,

completion time = 9) P4 (arrival time

= 9, completion time = 11) Here, P

represents the process.

P1 = 1

P2 = 2

P3 = 3

P4 = 2

Collaborative TAT = P1 + P2 + P3 + P4 (1 + 2 + 3 + 2)

Collaborative TAT = 8

Now the average TAT is computed as follows:

Average TAT = (P1 + P2 + P3 + P4) /4

Average TAT = 8/4 = 2

SJF is a full form of (Shortest job first) is a scheduling algorithm in which the
process with the shortest execution time should be selected for execution
next. This scheduling method can be preemptive or non-preemptive. It
significantly reduces the average waiting time for other processes awaiting
execution.

 It is associated with each job as a unit of time to complete.

 In this method, when the CPU is available, the next process or job
with the shortest completion time will be executed first.

 It is Implemented with non-preemptive policy.

 This algorithm method is useful for batch-type processing, where

waiting for jobs to complete is not critical.

 It improves job output by offering shorter jobs, which should be

executed first, which mostly have a shorter turnaround time.
This algorithm separates the ready queue into various separate queues. In
this method, processes are assigned to a queue based on a specific property
of the process, like the process priority, size of the memory, etc.

However, this is not an independent scheduling OS algorithm as it needs to

use other types of algorithms in order to schedule the jobs.

 Multiple queues should be maintained for processes with some

characteristics.

 Every queue may have its separate scheduling algorithms.

 Priorities are given for each queue.

 Here are the reasons for using a scheduling algorithm:

 The CPU uses scheduling to improve its efficiency.

 It helps you to allocate resources among competing processes.

 The maximum utilization of CPU can be obtained with multi-programming.

 The processes which are to be executed are in ready queue.

 CPU scheduling is a process of determining which process will own

CPU for execution while another process is on hold.

 In Preemptive Scheduling, the tasks are mostly assigned with their

priorities.

 In the Non-preemptive scheduling method, the CPU has been

allocated to a specific process.

 The burst time is the time required for the process to complete
execution. It is also called running time.

 CPU utilization is the main task in which the operating system needs to
ensure
 that the CPU remains as busy as possible.

 The number of processes that finish their execution per unit time
is known Throughput.

 Waiting time is an amount that a specific process needs to wait in

the ready queue.

 It is the amount of time in which the request was submitted until

the first response is produced.

 Turnaround time is the amount of time to execute a specific process.

 Timer interruption is a method that is closely related to preemption.

 A dispatcher is a module that provides control of the CPU to the process.

 Six types of process scheduling algorithms are: First Come First Serve
(FCFS), 2) Shortest-Job-First (SJF) Scheduling, 3) Shortest Remaining
Time, 4) Priority Scheduling, 5) Round Robin Scheduling, 6) Multilevel
Queue Scheduling.

 In the First Come First Serve method, the process which requests the
CPU gets the CPU allocation first.

 In the Shortest Remaining time, the process will be allocated to the

task closest to its completion.

 In Priority Scheduling, the scheduler selects the tasks to work as per the
priority.

 Round robin scheduling works on the principle where each person gets
an equal share of something in turn.

 In the Shortest job first, the shortest execution time should be

selected for execution next.

 The multilevel scheduling method separates the ready queue into

various separate queues. In this method, processes are assigned to a
queue based on a specific property.

 The CPU uses scheduling to improve its efficiency.

The treatment of shortest process in SJF scheduling tends to result in
increased waiting time for long processes. And the long process will never get
served, though it produces minimum average waiting time and average
turnaround time. It is recommended that any kind of simulation for any CPU
scheduling algorithm has limited accuracy.

The only way to evaluate a scheduling algorithm to code it and has to put it in
the operating system, only then a proper working capabilityof the algorithm
can be measured in real time systems.