Osy Micro

P K TECHNICAL CAMPUS CHAKAN
Department of Diploma Computer Engineering

2022-2023
A MICRO-PROJECT REPORT
ON:
CPU Scheduling
SUBMITTED BY :
Sudesh Sarode
Under Guidance
Prof. Shraddha Pardeshi Mam
P K TECHNICAL CAMPUS CHAKAN
Department of Diploma Computer
Engineering2022-2023
CERTIFICATE
A MINI-PROJECT WORK ENTITLED
SUBMITTED BY :
Sudesh Sarode
The report has been approved as it satisfies the academic requirements
in respect of micro-projectwork prescribed for the course.
SUBJECT TEACHER HOD

What is CPU Scheduling?
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.
Types of CPU Scheduling

Here are two kinds of Scheduling methods:
Preemptive Scheduling
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.
Non-Preemptive Scheduling
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.
When scheduling is Preemptive or Non-

Preemptive?
To determine if scheduling is preemptive or non-preemptive, consider
these four parameters:
1. A process switches from the running to the waiting state.

2. Specific process switches from the running state to the ready
state.
3. Specific process switches from the waiting state to the ready
state.
4. Process finished its execution and terminated
Important CPU scheduling Terminologies
 Burst Time/Execution Time: It is a time required by the process
to complete execution. It is also called running time.
 Arrival Time: when a process enters in a ready state
 Finish Time: when process complete and exit from a system
 Multiprogramming: A number of programs which can be
present in memory at the same time.
 Jobs: It is a type of program without any kind of user interaction.
 User: It is a kind of program having user interaction.
 Process: It is the reference that is used for both job and user.
 CPU/IO burst cycle: Characterizes process execution, which
alternates between CPU and I/O activity. CPU times are usually
shorter than the time of I/O.
CPU Scheduling Criteria

A CPU scheduling algorithm tries to maximize and minimize the
following:
Maximize
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.
Minimize
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.
What is Dispatcher?
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.
Functions performed by Dispatcher:
 Context Switching
 Switching to user mode
 Moving to the correct location in the newly loaded program.
Types of CPU scheduling Algorithm

There are mainly six types of process scheduling algorithms
1. 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
Scheduling Algorithms
First Come First Serve
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.
Characteristics of FCFS method

 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.
Shortest Remaining Time

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.
Characteristics of SRT scheduling method

 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 Based Scheduling
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 Scheduling
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.
Characteristics of Round-Robin Scheduling

 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.
Shortest Job First

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.
Characteristics of SJF Scheduling
 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.
Multiple-Level Queues Scheduling

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.
Characteristic of Multiple-Level Queues Scheduling

 Multiple queues should be maintained for processes with some
characteristics.
 Every queue may have its separate scheduling algorithms.
 Priorities are given for each queue.
The Purpose of a Scheduling algorithm

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

Osy Micro

Uploaded by

Copyright:

Available Formats

Osy Micro

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Osy Micro

Uploaded by

Copyright:

Available Formats

P K TECHNICAL CAMPUS CHAKAN

Department of Diploma Computer Engineering

SUBJECT TEACHER HOD

Types of CPU Scheduling

When scheduling is Preemptive or Non-

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

CPU Scheduling Criteria

Throughput: The number of processes that finish their execution per

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

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

Functions performed by Dispatcher:

Types of CPU scheduling Algorithm

1. First Come First Serve (FCFS)

Characteristics of FCFS method

Shortest Remaining Time

Characteristics of SRT scheduling method

Priority scheduling also helps OS to involve priority assignments. The

Characteristics of Round-Robin Scheduling

Shortest Job First

Multiple-Level Queues Scheduling

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

Characteristic of Multiple-Level Queues Scheduling

The Purpose of a Scheduling algorithm

 The CPU uses scheduling to improve its efficiency.

You might also like