Scribd
Upload
57 views12 pages

Lec-13 IpadNotes Os

The document discusses various CPU scheduling algorithms, including Shortest Job First (SJF), Priority Scheduling, and Round Robin. It outlines the criteria for each algorithm, such as preemptive and non-preemptive scheduling, and provides examples of process attributes like Arrival Time (AT), Burst Time (BT), Completion Time (CT), Turnaround Time (TAT), and Waiting Time (WT). Additionally, it touches on concepts like aging to prevent indefinite waiting for jobs.

Uploaded by

a22105389
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
57 views12 pages

Lec-13 IpadNotes Os

The document discusses various CPU scheduling algorithms, including Shortest Job First (SJF), Priority Scheduling, and Round Robin. It outlines the criteria for each algorithm, such as preemptive and non-preemptive scheduling, and provides examples of process attributes like Arrival Time (AT), Burst Time (BT), Completion Time (CT), Turnaround Time (TAT), and Waiting Time (WT). Additionally, it touches on concepts like aging to prevent indefinite waiting for jobs.

Uploaded by

a22105389
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/ 12

Lec -13

Job first ) ( Non Prop?


① (
-

SJF shortest

¥_ will getcpu
Pooch with
.

p,P → ?? BT

¥
?⃝
p AT BT ET TAT WT

O 8 8 8 0
P,

Pz I 4 12 11 7

2 9 26 24 15
Pz
17 1h 9
Py 3 5

*i=¥→ss
.

" "

ATTBT
Criteria :
* Preemptive -55ft
CT TAT WT
P AT BT

R 0 8/7 17 17 9

✓ Pz I 4 5 U O

Rs 2 9 26 24 15

Pu

t?→→
3 5 10 7-
.
* Priority scheduling 1-
each Job
Assign Pnmty
to
-
.

*→

E-
± ¥
① Non -

p-regstue.tn
AT BT CI TAI WI
p Prints
I 2 0 4 4 4 0

°gg
" 27 22

3 6 2 23
3 22 19
4 10 3 5 9
6 I
4 1 20 16 15
6 5 4 13 8
12
6
y
6 19
7- 9 13 7-

%HE¥€±
'
Q
:÷i÷÷÷É÷¥÷÷:
÷÷÷÷÷¥: ¥
* w

_É Arg
at

:* :
Biggest throwback → Non -R Premb
=
-

÷.
"
=

Itt
E
✗ ¥ Term
RUMI +

fogy at MIT
, BM

ON → 1967--5 Job submits

1973 →
che¥
Lowest PIED -
@ady
E-
Solution to indefinite waiting

Ageing =

Graduating Ting Pnmtns of lowest job ,

15min → lowest Pnohes Jobs

Prñts
,
CRR)
'

* Round - Robin
- =

-
Most
=
Popular
- FCFS ( preceptive ) version
-
criteria
:AT BTX

-
design Time-sharing
-
Cosy to implant .
BT

TQ_=①
AT
p
10411T
To Is
2 I
5/30*10 =

322€
43X-

IF 4¥10 ¥→FÉFE¥*☒

t.F.FI#E4.-%EEE
To 2s .

You might also like