Scribd
Upload
7 views

System Software and Operating System 03 - Daily Class Notes

Uploaded by

Priya Kumari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

System Software and Operating System 03 - Daily Class Notes

Uploaded by

Priya Kumari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1

UGC NET

DAILY
CLASS NOTES
Computer

System Software and Operating System


Lecture – 3
Process Scheduling: Part 1
2

Process Scheduling: Part 1


Content:-
1. Performance Parameter
2. Scheduling Algorithm
3. FCFS
4. SJF
5. Shortest Remaining Time Next Algorithm (SRTN)
6. Priority Based Non-Pre-emptive Scheduling

Performance Parameters:-
1. CPU Utilization
2. Throughput of the system
3. Average Turnaround
4. Average waiting Time of a process
5. Response Time

1. CPU Utilization: It is the average fraction of time, during which CPU is busy, executing either user
programs or system modules. Higher the CPU utilization, better it is.
2. System Throughput: It is the average amount of work completed per unit time.
3. Turn around time: It is the total time elapsed from the time job is submitted (or process is created) to the
time the job is completed.
Turnaround Time = Process/job finish time – process/job Arrival Time
4. Waiting Time: It is defined as the total time spends by job while waiting in suspended state or ready
state, in a multiprogramming environment.

Waiting time of job/process = Turnaround time – actual execution time


Lower the average waiting time, better it is.

5. Response Time: This parameter has relevance for interactive-time sharing systems and for the real- time
systems. In interactive system, response time is defined as the time elapsed from the moment last
character of a command line is typed by the interactive user, to the time when the first response to that
command appears on the terminal. For real time- systems, it is defined as the time elapsed from the time
an event is reported in the system, to the time when the first instruction is interrupted servicing routing
(ISR) is executed to the service the interrupt caused by the event.

Pre-emption:- Force fully stoppage of job


Non-Pre-emption:- Job will leave the CPU on its own

Various Scheduling Algorithms:-


1. First Come First Served(FCFS)
2. Shortest Job First (SJF)
3

3. Shortest Remaining Time Next(SRTN)


4. Priority Based Non-pre- emptive Scheduling
5. Priority Based Pre-emptive Scheduling
6. Round Robin Scheduling
7. Multi Level Queues(MLQ) Scheduling

1. First Come First Served (FCFS):- The process are dispatched (Scheduled to run)
strictly in the same order, as those have arrived in the system.

Process Arrival Time ms Next Burst ms


P0 0 10
P1 1 6
P2 3 2
P3 5 4

Ex -1:-
Average Turnover Time = 14.25ms
Average Waiting Time = 8.75

Shortest Job First (SJF):- The next job to be dispatched will be the one, which happens to be the shortest amongst
the pending lot of jobs.

Process Arrival Time ms Next Burst ms


P0 0 10
P1 1 6
P2 3 2
P3 5 4
Ex-2
Average Turnover Time = 12.75 ms
Average Waiting Time = 7.25 ms
Shortest Remaining Time Next Algorithm (SRTN):- This is a pre-emptive algorithm, wherein the next job to be
dispatched will be the one that happens to be shortest amongst the pending jobs, at the time making the decision.
However, if a process arrives later, whose next burst happens to be shorter than the remaining burst time of the
currently running process, the currently running process will be pre-emted by the new process.

Process Arrival Time ms Next Burst ms


P0 0 10
P1 1 6
P2 3 2
P3 5 4
EX-3
4

Average Turnover Time: 10ms


Average Waiting Time: 4.5 ms
Priority – Based Non- Pre-emtive Algorithm:-More critical processes are assigned a priority higher than the less
critical ones. At the time of scheduling, a process dispatched will be the one that has highest priority amongst the
processes waiting in the ready queue.

Process Arrival Time ms Next Burst ms Process Priority


P0 0 10 5
P1 1 6 4
P2 3 2 2
P3 5 4 0
Ex-4
Average Turn over Time: 13.25 ms
Average waiting Time: 7.75ms

NOTE:-
WT & TAT of FCFS >SJF > SRTM

PW Web/App : https://smart.link/7wwosivoicgd4
Library - https://smart.link/sdfez8ejd80if

You might also like