MICRO PROJECT PRAPOSAL

On
SRTF(Shortest Job Remaining Time
First )Scheduling Algorithm
SUBJECT :- OSY(Operating System)
BATCH :-IF5I
SUBMITED BY:- GROUP NO. 02
TEAM MEMBERS : -
Sr Name of Students Roll no. sign
no.
1 Sakshi Lalchand Thakur 07

2 Srujal Humendranath Bopche 09

3 Pushpal Rajendraprasad 11
Bansod
4 Novil Krushnakumar Bisen 46

5 Payal Pravin Maske 65

Under The Guidance of-

Prof. P.P. Katgaokar
(Lecturer in IT Department)

DEPARTMENT OF INFORMATION TECHNOLOGY

GOVERNMENT POLYTECHNIC GONDIA
 SRTF(Shortest Job Remaining Time
First )Scheduling Algorithm

1.0 Brief Introduction

Shortest Remaining Time First (SRTF) is the preemptive

version of Shortest Job Next (SJN) algorithm, where the
processor is allocated to the job closest to completion.
This algorithm requires advanced concept and knowledge of
CPU time required to process the job in an interactive system,
and hence can’t be implemented there. But, in a batch system
where it is desirable to give preference to short jobs, SRT
algorithm is used.
However, SRT involves more overheads than SJN, as the OS is
required to frequently monitor the CPU time of the jobs in
the READY queue and perform context switching.

2.0 Aim of the Micro-Project

1. This algorithm is the preemptive version of SJF

scheduling .
2. In SRTF, the execution of the process can be stopped after
certain amount of time.

3.0 Intended Course Outcomes

1. Apply scheduling algorithm to calculate turnaround tome

and average waiting time.
2. Calculate efficiency of different memory management
techniques.

1
4.0 Literature Review

New process is added in to control unit while executing

current process, the judgement of allocating CPU resources is
depending up on the Shortest Remaining Time First of that
process.
Another policy that provably optimal mean round around
time for all requests is SRTF “Shortest Remaining Time First”.
Shortest-Remaining-Time-First(SRTF) scheduling policy is an
optimal algorithm for managing client request by minimizing
process mean response time [9] and [10].
While handling scheduling policies on web servers SRTF
is well aware of the job size, which is well known to the server,
refer to processing time (response time) of that job for
implementing SRTF the first response to least processing time
jobs first then as per time serving other processing request.
There are two problems, this policy not fair. Jobs with a large
size may be waiting for a while and Dispatcher must know the
size of jobs beforehand.

5.0 Proposed Methodology

 Searching for the topic
 Confirmed the topic we searched for the micro
project
 Distribution of work
 Collecting information about project
 Making Proposal
 Testing and analysis of test result
 Preparation of final project report
 Final submission of the project

2
6.0 Resources Required

S. Name of Specifications Qty Remar

No. Resource/material ks
1 Hardware: Computer (i3 1
Computer System preferable i5) , ---
RAM 2GB
minimum and
onward
2 Operating System Window 7 or 1
advance version/ ---
LINUX version 5.0
or later version
/mac OS
3 Application Microsoft World 1 ---

7.0 Action Plan

S. Details of Planned Planned Name of

No. activity Start date Finish Responsible
date Team Members
1 Collection 22- 28-
data on september- september-
given 2022 2022
project
2 Make
analysis and 1-October 9- October
planning for -2022 -2022
the project

3
3 Analyze the 11- 17-
created October - October -
program 2022 2022
4 Finding 25- 7-
error and October - October-
run the final 2022 2022
project
5 Create part- 2- 10-
A november- november-
microproject 2022 2022
proposal
6 Create Part- 17- 27-
B november- november-
microproject 2022 2022
report