SCHEDULING ALGORITHMS

Part- A Plan

SCHEDULING ALGORITHMS

1. Brief Description:

SCHEDULING ALGORITHMS is a operating system and is the best for understanding about scheduling. It
saves your time because you get predefined algorithms. If you don't know how to use that
predefined algorithms don't worry let us first understand that? These algorithms is very user friendly to use.
We give it briefly in the project.

2. Aims of the micro project:

The interesting project will be build to make project using scheduling algorithms in operating
system.

3. Course outcomes addressed

Install operating system and configure it.

• Use operating system tools to perform various functions.
• Execute process commands for performing process management operations.

Apply Scheduling algorithms to calculate turnaround time and average waiting

 time.
Calculate efficiency of different memory management
techniques.
Apply file management techniques.

o pg. 1
Swami Vivekanand Institute of Polytechnic
SCHEDULING ALGORITHMS
o pg. 1
4. Proposed Methodology:

We discussed about our operating system micro project topic .we searched on internet for micro project

topic. We got some topic related to our syllabus .we decided to make a project on Scheduling algorithm

which is useful for student to understand scheduling algorithm easy with the help of project.

1. After the selecting the topic of our project, we started to searching on internet to get more information
related to scheduling algorithm.

2. We collect the all information which we required to make project.

3. We also visited some website to get some idea how to make project for scheduling
algorithm.

4. Finally we got ideas and we started to make a

project.

5. Firstly we roughly created our project and we saw our project to our subject teacher .our teacher
told
some changes in project.
6. As per the teacher guidance we finally created our
project

7. We created report and proposal for our micro

project.

5. Action plan:

Sr.

No.
Details of Activity

1.
Gathering The Raw Information Related
To Project

2.
Analysis

3.
Designing
4.

Implement of Coding

5.
Testing of Project

6. Deployment of Module

7.

8.
Prepare Out Put
Prepare Report on
Micro Project
Planned

start Date

08.08.2023
2:45 to 4:45

22.08.2023 2:45 to 4:45

05.09.2023 2:45 to
4:45

12.09.2023 2:45 to4:45

26.09.2023

2:45 To 4:45
03.10.2023 2:45 to 4:45
10.10.2023 2:45 to 4:45
17.10.2023 2:45 to 4:45
Planned

Finish Date

22.08.2023 2:45 to
4:45

05.09.2023 2:45 to
4:45 12.09.2023 2:45
to 4:45

26.09.2023

2:45 to 4:45

03.10.2023

2:45 to 4:45
10.10.2023 2:45 to 4:45
17.10.2023 2:45 to
4:45 31.10.2023 2:45
to 4:45
Name of Responsible
Team Members
 Tadme Pradip S.
Madje Rohit O. Mukade
Sai F. Lavate Santosh V.

Swami Vivekanand Institute of Polytechnic

6. Resources used:

Sr.no Name of resources

1. Pc
Specification
Quantity Remark

13processor, 4Gb
500GB
1

2. Software
Microsoft Word
1

3. Internet
Mozilla Firefox
1

➤ Name of Team Members:

 • Tadme Pradip Sanjay

• Madje Rohit Omprakash

Mukade Sai Fulchand

• Lavate Santosh Vyankat

Pg. 3
Swami Vivekanand Institute of Polytechnic

Part B- Outcomes after Execution

1. Rationale:

The goal of the project is to create scheduling algorithms.

2. Brief Description:
 SCHEDULING ALGORITHMS is a operating system and is the best for understanding about scheduling. It
saves your time because you get predefined algorithms. If you don't know how to use that predefined
algorithms don't worry let us first understand that? These algorithms is very user friendly to use. We
give it briefly in the project.

3. Aims of the micro project:

The interesting project will be build to make project using scheduling algorithms in operating system.

4. Course Outcomes Achieved:

Install operating system and configure it.

Use operating system tools to perform various functions.

Pg. 4
Apply Scheduling algorithms to calculate turnaround time and average waiting
time.

Swami Vivekanand Institute of Polytechnic

5. Actual Procedure Followed:

This project helped us to built-up different skills like communication skills, technical skills with business

and marketing skills.

1. Preemptive Scheduling:-
Preemptive scheduling is used when a process switches from running state to ready state or from waiting

state to ready state. The resources (mainly CPU cycles) are allocated to the process for the limited amount
of

time and then is taken away, and the process is again placed back in the ready queue if that process still
has
CPU burst time remaining. That process stays in ready queue till it gets next chance to
execute.

2. Non-Preemptive Scheduling:

Non-preemptive Scheduling is Shortest Job First (SJF basically non preemptive) and Priority
(non
preemptive version), etc.

used when a process terminates, or a process switches from running to waiting state. In
this
scheduling, once the resources (CPU cycles) is allocated to a process, the process holds the CPU till it gets

terminated or it reaches a waiting state. In case of non-preemptive scheduling does not interrupt a
process
running CPU in middle of the execution. Instead, it waits till the process complete its CPU burst time and

then it can allocate the CPU to another process.

❖ Key Differences Between Preemptive and Non-Preemptive Scheduling:

1. In preemptive scheduling the CPU is allocated to the processes for the limited time whereas in
Non-
preemptive scheduling, the CPU is allocated to the process till it terminates or switches to waiting
state.

2. The executing process in preemptive scheduling is interrupted in the middle of execution when
higher
priority one comes whereas, the executing process in non-preemptive scheduling is not interrupted
in the
 middle of execution and wait till its execution.

3. In Preemptive Scheduling, there is the overhead of switching the process from ready state to running
state,

vise-verse, and maintaining the ready queue. Whereas in case of non-preemptive scheduling has no
overhead
of switching the process from running state to ready state.

Pg. 5
Swami Vivekanand Institute of Polytechnic

◇ Program for Shortest Job First (or SJF) CPU Scheduling

Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process
with the

smallest execution time to execute next. SJN is a non-preemptive

algorithm.

Shortest Job first has the advantage of having a minimum average waiting time among all
scheduling
algorithms.

It is a Greedy Algorithm.

It may cause starvation if shorter processes keep coming. This problem can be solved using the
concept of

aging.
It is practically infeasible as Operating System may not know burst time and therefore may not sort
them.
While it is not possible to predict execution time, several methods can be used to estimate the
execution time

for a job, such as a weighted average of previous execution times. SJF can be used in
specialized
environments where accurate estimates of running time are available.

Algorithm:
1. The process make a pool of process which after till the completion of previous process Sort all the
 process
according to the arrival time.
2. Then select that process which has minimum arrival time and minimum Burst time.

3. After completion and select that process among the pool which is having minimum Burst
timethat.

Preemptive SJF: Example

Short Job First (SJF)

Example

Process Burst time

Arrival

P1
6
0

P2
8
0

P3
7
0

PA
3
0

Pg. 6
Gantt chart: Order P1, P2, P3, P4

0
P4 P1 T P3
3
9
P2
16
24

Average waiting time: (0+3+16+9)/4 = 7 With FCFS: (0+6+(6+8)+(6+8+7))/4

= 10.25
 Swami Vivekanand Institute of Polytechnic

> Advantage:

1- Short processes are handled very quickly.

2- The system also requires very little overhead since it only makes a decision when a process completes or
a new process is added.

3- When a new process is added the algorithm only needs to compare the currently executing
process with

the new process, ignoring all other processes currently waiting to

execute.

> Disadvantage:
1- Like shortest job first, it has the potential for process
starvation.
2- Long processes may be held off indefinitely if short processes are continually added.

◇ Program for FCFS CPU Scheduling

Given n processes with their burst times, the task is to find average waiting time and average turn

around time using FCFS scheduling

algorithm.

First in, first out (FIFO), also known as first come, first served (FCFS), is the simplest scheduling
algorithm.

FIFO simply queues processes in the order that they arrive in the ready
queue.
In this, the process that comes first will be executed first and next process starts only after the previous
gets fully executed.

Here we are considering that arrival time for all processes

is 0.

FCFS: Example

First Come, First Served (FCFS)

pg. 7
Example

Process Burst time Arrival

P1
24

P2
3

P3
3

Gantt chart: Order P1, P2, P3

0
P1
0

P2
P3
T
24
27
30

Average waiting time: (0+24+27)/3 = 17

Swami Vivekanand Institute of Polytechnic

Pg. 8
6. Actual Resources used:

Sr.no
Name of resources
Specification
Quantity
Remark

1. Pc
13processor, 4Gb
1

500GB

2. Software
Microsoft Word
1

3. Internet
Mozilla Firefox
1

7.Action plan:

Sr.
Details of Activity
No.

1.
Gathering The Raw
Information Related

To Project

2.
Analysis

3.
Designing

4.
Implement of Coding
5.
Testing of Project

6.
Deployment of Module

7.
Prepare Out Put
Prepare Report on
8.
Micro Project
Planned

start Date

08.08.2023

2:45 to 4:45

22.08.2023

2:45 to 4:45 05.09.2023

2:45 to 4:45

12.09.2023 2:45 to 4:45

26.09.2023

2:45 To 4:45
03.10.2023 2:45 to 4:45
10.10.2023

2:45 to 4:45
17.10.2023

2:45 to 4:45
Planned

Finish Date

22.08.2023 2:45 to
4:45

05.09.2023

2:45 to 4:45 12.09.2023

2:45 to 4:45

26.09.2023 2:45 to 4:45

03.10.2023

2:45 to 4:45 10.10.2023

2:45 to 4:45 17.10.2023

2:45 to 4:45 31.10.2023

2:45 to 4:45
Name of Responsible
Team Members
 Tadme Pradip S.
Madje Rohit O.
Mukade Sai F. Lavate
Santosh V.

Swami Vivekanand Institute of Polytechnic

8. Output of micro project:

1. First Come First Serve

2. Shortest Job First

6. Multi Level Feedback

Queue

CPU Process Scheduling Algorithms

5. Multi-Level Queue
4. Priority Based
3. Round Robin
 Scheduling
Algorithms
by Mayank Rana
In computing scheduling is the method by which work is
assigned to resources that complete the
work.

The work may be vinual computation elements such as threads,

processes or data flows, which are in tum scheduled onto
hardware resources such as processors, network links or expansion
cards.
A scheduler is what carries out the scheduling activity. Schedulers
are
often implemented so they keep all computer resources busy
(as in load balancing, allow multiple users to share system
resources effectively, or to achieve a target quality of service.

www.allbca.com

Round Robin
SJF

Scheduling Algorithms
Priority

FCFS
SRT
Multi level Queue

Pg. 9
Swami Vivekanand Institute of Polytechnic
 9.Skill developed/learning outcomes of this micro project

It is straightforward to understand and use by the user. In this, all the rules are the same as
the other scheduling algorithms. This operating system based SCHEDULING ALGORITHMS are
descriptive and understand by user.

10.
Application of the micro project

To implement and make a project for SCHEDULING ALGORITHMS.