0 ratings0% found this document useful (0 votes) 19 views110 pagesOperating System Notes
Operating System detail notes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
oe Operating Syston ; reowd
(e-em) |
Trbroduction & Background:
ushok isan O8f
7 snkerace bho es E hacdsoure, wt
7 Reroiite Homager |
See ubiliien Yo aid opplicabion Development 9 10
2 Gonbol prgram Coatinels various hho £ vo units)
Aels Uke a qovernmente ‘
shee
Conena iempane” ost
Keno 1
Devt .
fe, wD ‘
FL - programmer Iwlerface
Programmers we given Seperate snlertaue hee Rh
ret His 18 provided uaiog APE fpplicatan Programmers
Anlerhuce)
% SEE (Span Gout totewlace’)
in GATE OS Ts Gudied of Von Meumana Archilechne only -
Gs ax Resouce Hanger:
sMonages atsourees Z provides a platform to vse. Here. vaoures
Resources
~™
Kho Slo |
(eop, Hem, Coitex, |
To Denies, Semaghorss, alee +
Regia, | fewer) vines wth Hoga 4
"a | alpersereyy * , “
Scanned with CamScanneri £ Gend LOS: SET RU
“Lie S Hajor goals,
L460 ver Genventerce.
»y Ethcieney
2) Reliability
4) Seaboility Cobilihy te evolve. \evenpandable)
8) Robsstrers (sory and should beable fs Kar
vos) Sess)
‘rteunpabBrmne)
8) Rootbiy’ Cxalle acevo an
Ranchos orn od
60 Scheduling
Memory Manage ment
Device 4
AY Seewity # Frolachion S95 ras
BS Deadlock handbag t
sy Syachronitahion ete. i
+ Fanchoas te Ainge performed fo achieve. gpl
hak mak be the pies, gal of os
“ay Convenience
8) efficiency
8 ReLiakitiny,
a) Scatabitiey,
2:
Ben oagh efficiency is a Midlor gosh,
people are More Concerned abbott Convenience
set ©
sie
4
wove Se a
7 GEE XH acchilechne danyen then 98 design ang
Based on He domains fr hth 06 is telay deaignedt, Goal
ob os change
‘Scanned with CamScanner0S)
Br he Pe yik is convenience ast |
foe reabtime. syetemne, it ig eFheiency ana highly relfable. and
robust news
1 tal ie ‘Smartehones, ib ig convenience £ poser ethesenen
SEM CATS) are he syshemns udhich are conthvained
by Mick Hime deadlines.
EX: Hiswite coatvol, wacler systeins! ete.
Br edidituted Systeme! O8 | te Ts scalabity ut *
sae
oe
Type bos: ‘
Te awa vt nein memory in hich
Os Is Sined is called, Sysiget aren
Tre reat A the memory is Caled
vier oka. we
Br oaly one program
__ Death: 'S present in main memory at any given Kee:
F . pow
¥ When the pmgram goes he lo, the cpy becames idle.
taigepameigs
A Were 05 hos ability fo mannge mul Hele ready Programs in memory.
Seven & onevithe-teadyHprome executing process goes for So,
one A the vendy procenes will be allectaled’ Cpu-
Tus ukilizahon ot cpu 8 mawimized-
ence Prroughpuk TS {nereaged »
throwhpuk: the ot procenes execuled per unit Hoe _
foon-Fretmphie. Pre -emphive weed
CoRR leaves epy Ut forcast deatlnesticn’) :
et only when it
é Conpleles or 20 er Sjseait)
‘Scanned with CamScannerFa rrctath of “non-prrenphive Afr ts
. lack & vesponsivenes, or jnlerachivenens
Uherean pre-emptive is more jalerathive..
+ Pre-emphive — Hudti cing i Res i
\ {prqramenteg is oo we xed 4 mulbitaakcing .
Archiver! Requires Gr inglerentation of 9 PEP tel Afra,
1+ LO Ceecondany storage) +
+
Be is desicovle to have DMA Capability
2° Maia Meorony :
Should be Cafpalle tp perben Gddrey, hanslation -
~ Coe logical oddato phy adiews)
) This fuschonathy TS povided by Kemoy Hamngement dt (HHu),
| 3. cpu:
| The prccesor rar be able b Support lua! mole dperabion,
i Tie two mode, Gre “ “ §
od) wer made. Cnon- pervilaged rede.)
ui Kernel. mode. Chre-wiloge male of monitor mode)
KAM 08 pegrams run in kernel mode
* 0 pomams w execule atomically (jue, 00 enphod)
prog ps
- oo
+ Vier programs one preemptive nature vo
|
|
|
| 4 AML user programs sun 1a user mode
\
4 To keep tre in which made cp is present Wt used made whit» i
Tris mode bit present in Condition register (Pens
fe Use mode, (0° vies)”
Vs kegel thode
7 aedoy word
‘Scanned with CamScannerr or
dade: FH” Hong o tine ile execution of progr, it
necenary fo cht Hom usermale {o kernal mele and KH h vie
rs Ppreces, & shitting foam & Called mode shitting.
Be Tho User procen needs Os sexvite, then we the o& service
i aane io Kamel mode. Once the geavice Is Roished mode is
changed FO Lye mode: :
a Meinl)
- i “ak abies
C> Hous);
exott(v ras, chy it : :
4 - :
£ te) won
by
\
The ahove. Program doesn't ute any, 0S, sen
a of ik execution in Wer mode.
vtce, and Bnishes
GB: wainc)
1
int acbil; UK
ez $ (Aub); un)
Fock Cd + System Cath
foskC 0; kK
pxate(e dy cy, 0 be Cpovited in APE)
t '
$c)
i ‘
t . ;
The above poem ves fret:
te ts sewice provided by OSs
by CComplen
Byery .ajstemn call i panslatdle? & an 86 Csuperuisory Cait ) + This
bike privileged taghucWon .
Te pl nen -privitaged funchion galls ase translated ty BSA Cerarch +
fave Acedvens by 2 comeiler- |
‘Scanned with CamScanner
fork) ts a system ca and || Thuy at the Hme & execuhond Sve erated o Soha itkGrv is
The Corresponding TSA (Inleript Service Roubne) handles He
| takervapt «
| > TSR does 2 too things ¢
4 Hode shidting (Bom OH to eM) Crate bitin ange)
“Fron te dispatch table, agpe te required
oddver, of vega the Funckon call: is fund’
Cris patch table Contains one ey per cach Systeme cat!)
a5 a8 SHE hi
The lost iachuaton dt Srl c ne changes KH fo UM.
4
Sock) System call :
3 maine)
i
X
S16! wee | :
=a mand)
5 t+ Fock §
a print (“Hello”),
x
print C Hetlo")y
(}— 4 LTETS 08 deack dopy of parent
Exeuskion in child gurls from the {nshuckon uhich @ neet fe
the Bee) hich created WW: the child
LChid doesn’ exeuste fre)
| Te executes only pratt)
| ‘4 t]he ec A dil sek
Yo GHA cohen
fe pen
‘Scanned with CamScanner| a
ot
Aa maind) rowed
i forks, |
forks
Priat® Yello");
Hee o Ital dt 4 procenes ax Crealed-Hence “elle? fs Prated |
h Himes.
Hello
Hello
Helle
Helle
A Wroinl)
Bee
fore
Forel)
peat (Yeo) 7
2.@ prrcerees 29 Vello is pritled & Hoes
‘Scanned with CamScannertole:
Tn the sume way Fose have 9 focks im Sequences, 2” process +
will ecist.
maine)
t
ie tans
be Cie, teeny tet)
bas -
s
We He above progam ,.no dt Chill pmeewer crealed 18
DAV BHM chad ayot-r
oy
for Ciziy isony tet)
forty;
can be replaced by Sequence ‘! Porksc,
Sto prcenes = 9f
Wah no A child procemes 2 2M1.
Fed Ha ofp & below program
maint) :
PROEE (Before fovke")
forktrs
paattABtey fork):
3 .
wo |
Prything before Sequence ft fckL) Cal il be Crested only on.
(Cie by gaent)
9p:
Before. fork
after bork
Af ler fork
‘Scanned with CamScannerro
Process, Management :
process, nee
oy Proce Concepts :
frogram vs Peten,
Cetne) :
sg Progra 18 @ pobire enki.
Tstwarkien Data 7
Coat tae fy Feast
rand
Suc) Mean erg NTN
7 Vowable sie, peocers .
Adilecaled at vunkine . 1 3h
Cheap ascoren) =
Proce,
# Prcem 18 a Prgrem in execution .
+ Proce & on lothune da’ Pegeam Chor o program we Con eveate
Active entihy a SMA Memberd: prgemmed) 7 |
& unit d cpy utilization -
+
Lous o& contal Cite iF trae 8 nc proce | thea! thoes re
F Anienaled spe spirit. — O€Ky for cpu).
) 3
A Procew S viesed 4 O7 Abstract Baty Type Cant).
Nee?
use
an ADT ha
+ aitccatiey ceo te process
W) Bleek CD + Bore he Tho £
wo Rasa Ranging C+ sunning on Cr
vw Suspend() + Proce is ent to disk
Wid resumee > + Pocers is brought tg main memory from dik. -
(ly terminate —
Fee resource deailocation takes place ond %8 ty deleted
Procens Abhibuten (Rorsties Jdavecenstien) : ’ ‘|
H Proce idg a voiqe id. be every process a
Sametime, eit may ever hase parental. = 4 (Teeth,
PSometines & the proce is in any Jroup # Ie may
) Gren have qriup. id
* Proce, sake ws
Pacem sige
t Proum type (ee backgrsiea Precens fregund proceed etc.)
Peosihy ‘
* Program Counter: 7 ms
¥ General Rxpase Registers’ =
+ Acwoantig, Lallormatea (ye arvivaltime, busst times 10.hme ek’)
& Lise Af open Bley *
+ list & open devices
& Prolection infovmatian -
These cre general atribules. Hooewer Lilferert oss we de reat
Obrrbabeas ‘
mh Bt
‘Scanned with CamScanner© Feocors Corral Bek (PCBS/ Tosk Conrsol_ Block CTE)? ay
7 Proce Attritule, Ove Store Liq o Dela Stucture kntwen of
PCB or Trocews Deacriptoy.@o Process Chieek »
Go
Te cotent Kept ia O8'is called pocers Conlext or posevs
pecan conket
envivor ament.
Foch pocesn hoy ite own PCR.
Proce, staten ond stale +raasitean Liagrom '
shown belms.
7 Wows Ve oltove hanson diagram is) hr pre-enphie : hosed Mabkipng
Process Sep Suspengign : . > i f
Te is soompping Swapping OVE the pragme: proven,’ hom’ maid memany
dick, % And loer we may raume He proce and bring it book
ho main memory.
Tk posable fo Soepend one shen Heo Peers is)“ main ‘memory. i
So we can Suspend only Caben He Pre A in reasy or Tuaniog
or block stale. °
Cos
meee eee bran gihion,
For special avrangewente, ,
pombe ven in suspend en senies a tas Ni man ar math
iable-
‘Scanned with CamScanner7 ‘Ss
iqfesace preemphoe is faking resoivey Prom He -Proces in ready stale ‘
shedding Gueus ood Qheuig diogure: |
< ! o
Bune, Toa ‘ |
[(~— mo
Beads Bue — ok Bee, Mb Buewe Suspend Queue
@ wy
Device Gutue TIP Bucve
Ready quene list oe PCBs Pa
hoy ques + Ut veal processes
These, (28 are maintained on Linked list’,
Mock quel Geng "Jo device is omocisted ith ty ean device
queue GRBs 4 Preceyes)
Brey deisico. waiting £0 trough certhiin devia is allel
be He respecte device's queya.
Teb Buena or Topok Queues
Progrims tak are ready to be loaded in Memorye Memory
May got be eNOUGh bp hoe ON He procenes - 95 vest axe placed
*, ‘preg .
(job Sueue. The pacieeaen ia Joe queue ae. present in New gale.
Soagend Oacue so
Proceasea tha axe pended fom mena; cither' Pew! ready or
From eck statea- . ‘
EPy bound POCeES 4 A process with high amount 4 CPO basse ;
comgoxed Io To burst
To kosnd process + Mpecen usith highs afmunt # 0 biest
é : sCompaied’ E3. CPU bushi» “
"Scanned with CamScannerBN Me quenes ow
implemented ty Litas
Ast # pen.
Schedules 4 Dispatcher
Schedules is 0 component A Process manager, that rtakes decivion, -
0 xa
Short Yer scheduler (Proce scheduler} Ceeo scheduler) +
Te decides, which@ ready Pecos ghoul wn Nextes CPU
ony ime dium, Chock ox
giver on He bas A the,
equency, wah duhich age
Schedulecs . wu.
Medium der scheduler: 7 |
SE carrion oat He respoesibility “of Saapension A reaurmphin-
Loag Yer sched € Iobe schedules.
Tk works en job Quenee-
Te loads programs inko. reain memory
——"
Deqee # Halipegrammicg,
Te is toot processes present in Memory.
Las Contras deg HR
Dicpatcher :
Dispatcher ¢ayriex out the achuity of Canker switching,
4 Contec sitchieg iS activity of cag ond leading RBs ob proenes
acing pOces Switching: 00. CRY CAPE satehing also invluc Leg
‘Pee able» _
‘Scanned with CamScannerrr On
'
an tere taken he context Switching Conve RE@ # lena PCED is called |
|
|
corket Soitth Kme ©) Digeatch laleney..
coh ev Senn Five fo 4
® DORIS kk Proce mes
Vppes bound
ready k !
raneieg, ° a
Bock tle] © k |
CPU Scheduling | Proce Scheduling
7 Se design ct short term scheduler
Furchow£ goals ot Sts: i
ruched pe oe :
BuocHons +
{els : ;
¢ Hoxinsing throughput {
¥ Hinimiae thin Oroutd He, a
# Hinimite vaaihing fime.
Hinimire veponse bie.
Process Himes: -
Arrival Hine Gi hime at which procees Comes. jnbo“eady Queve
fhe the bor Acst hime.
atkg ine (we):
L He time spett by a process in ready queue.
‘Scanned with CamScannerScheduling Hime (st) ¢
the Hime at wahich the prcers gels ate Pu» chai!
Burst Hme (81) : }
‘
ays
CPU BT: Hime spent by Prcews fanning en CPU
lo BU: Hime. Speak by procens cong Zo achuity,
wt Oh ost wre Bt, 6G BTs .
tres [ee |
At
Congletion tine Cer’) :
he timefudich pecs fatale eeuahin
| PP \ 5
| Tan Around Bre (rat): \ 3 ues
the. Hine spent by proceas hoon its omval eal complete.
| TAT = CT-AT ‘ '
|
a 7
TAT
ocmalied Tat = pee BT inchades oak
| a oN 8T
eT
wt = TAT- (@T+ 3087) "
| it To@teo then
} wt > TAT -BT ,
|
|
Scanned with GamSeannerrr
Seredstiog Frame work :
Sehecul
Let 0 pocersers (Pr. en)
ATER) AY
BTCA) Ke
TORT LY > i
CRY SG
Poo ue have
a TaT(RD = Ce Ae
a
Auge TAT = x
Horaties TAT LP)
B) wrley = (er-acy- (Here)
agur. Sfteoay-drawy} 0 1
ay
Gh
ny
2) Schedule -lenth CL) :
Iota time taten fr ‘al a poceses bo Pith erecuhity
is called Shedule length y
tea| Le max(ce— miaCac)
Pole Hak Lis dk gyal to sum of all burst times
became of Cevtuin Hie o4 Procesten, Tray bes i block Shade
2) Te trohput i):
Process executed Per unit hime~
= ft
ik aE
‘Scanned with CamScanner$
| cou Scheduling lechniques
Scheduling lechavgues :
Non Tre emphie, Preemphie
) First Come Fiest Sewe (FERS):
Selection criteria t AT
Node ot gperation : Non- preemphive
Conflict resolution : Lower Pid proces, © Scheduled Rest
| Assumphions «
> bime is in clock hicks.
> TORT ts exo
| A Gonlect: switch overhead ( g) « heglgible
Schedule lengths Is0218
vg TaT= KAAEGE WHI
248
; s
«Ag 2 OFMEFE
wT a 4tty 2 beg
= ‘Scanned with CamScannerBeal
o 2 3 6 wy q
Schedule legik = is po
Compute Aug. TAT, Ayguet,. Schedule lengi+h
Pwo | AT / Rt | er |. TAT] wt |
4 Ls3 5s} oy °
ale fa 3} 2 Jo
3 | wow |S SS [0
4 |} mda oe fa
5 we {3 a) 3 °
Ladetetay P|
o2 6 # 116 ,
AA
on 5 618 © IS & wR Ds F
Aug TAT = Bea 45h 3 1}
ae
= be
s s “
; Schedule length = 21-9219 > 6 F
. Scanned with CamScannerDrass gant cro
@® gro AT ORT ’ 7
‘ s 3% #
zo 8
3 3 4
4 8 4
S$ 8s |
6 a 2d
ee eae
ints
‘Uanteln aA aaD
o 8 bk 6 GB PM
Lroy-3s01
Ag Tt> (24h rS+546 ag
a
fog WO > OrOHIEYHOHD 4
6 6
FCS wsith on-2ero Torts Aveo Negligible scheduling overhead;
— ~~ - ates
Schedating everhead (€) ts. cenlext Soitch Here
PrD at | <8t + zoaT; Bry] eT | TH fe eo
4 -)
1 sg on | [8], |
3 4 3 fn 1 1 Jt | |to-44 “
Sreduing overhead, $21
Assume concsivent 20 & prssible
ite; Hultiple devites can perform TO at He same. kine
9-8
AREER ye
‘Scanned with CamScannerwm
Tn unnitiog Hime we don't engder Kime Ar Sechedaling overhead:
& Bose. taT- Cet+ rogt+ a-8)J ¥
whee nis nod gheduling overheada
ey 00 # Hime, the process is gcheduled
Schedule length > 9-0 = 14
A proces conhot qe
fo to divectiy fe
fom ready Qreve.
So initvally ait 3
+ PCE, vill TUN
on cpu itor a
hefigite _amasant dt hime)
es
oe eas ee
: fe
& Avg 1 Uh agakt ge sg
a0 % .
Ha Aw 0 proces is in Hack: chile
LZ while perfomicy 206 50 bee Herminotion it enusle come. to
© wuoning Seles go fray tt gam wen on Py hr or negligible
amount Hine | ‘
> hb crutalenagg, Fyre = to.
Schedutew length = 7 -
effeck » Ley nllover pocenen uate br ene
SFCFS shows omer
boy proces 4 pr Ab the cpus poe oes
‘Scanned with CamScanner|
Hoe emuming BEL cone repeat He Same Problem
[slF[sfeblefeln[s[els[ey s] TM
or rt 2384 Wn abit ag HT YQ DD Fj $2 Sr
Le52 (KERN ERA Re aa
eb Cpu talenes > | 100 xr
a ‘
-6
P-4
foi
Ee
fb fering ovethand: 4
/- epv gecherivg ovthand $ xiao
Feeney = [P-L -
or effing = (IE -£ uve = 4 xtvo
5) Shoplet Tub Test (3F) | Shortest Phocens Newt CsPs)
Slehon Critéva t BT paves
Mode. of operations Noa Pre Empl:
Conflict Regolubin = Loves Pid
ayy WT = rotator me gif 3 ad
Le tt o>
‘Scanned with CamScanneryr wD
eno | at | ar | ct [tat 3S i"
vfs fel we fu fe.
a {2 iz wf 4 s_|' '
ele fe2[uf[2zfe
eo talyts to |
sla \efei[e[i
6]3a-Ji stale
- 4
Teel eT
oy} e SF ure BI
Cs :
yg, WT é ck we i
Ls le. 215
aleners, Woke be caleoled
¢ over cchede. length
of CPU {lene = % woo
=
°
Shortest Remaining “E a Heat Cente) fie Bupha: SF:
Crilero. + BT : ey
2 Hode. Pre Eogtive” .
Corblicl: Regoluhin: Lewes Pid
PPretmphon of tanning Proce ie s boxed on duailabitity Jascival
fo Shelly Storer potss”
‘Scanned with CamScanner06 + @
SRTE
~ [a le[e Ps | Pa.
z OF8e 10
ray yy ots Ses YSt tg
+
Ta Ss
Ag tat= 3)
s
) ‘or,
6
aon
SsF Ra a tes x
PS Ag tats us
[ele lala tay Bug tats at. 6
0 2 50% 45 lt.”
‘Scanned with CamScanneravg Tat (sate) < Avy TATCSSFY ,
cundes tre ontumphon that 820
a vs0 schedubiog overheads cre, more ia SRTF.
Gompure the fq TAT foe the Fallaaing, preeases Using LATE schedubing
crwuraiog tuk in core of 0 conflick bls Processes then | fvour
the provers having loser pid aliys. ,
‘
Conddion holds White,
Preeaetion algo
1 . T
fg 2 Ine 4h 28
3
Performance & SIF:
Advantages !
+ optimal algorithm
> Hacimam through pu
2 Minimum Aug HT FAG OT
‘Scanned with CamScanner4 Causes Stawalon fe looger Preise® potas
sok
4 one Uinttalion is thak STR As wB poctcally TH possible ty
implement. Tis hecanye we can’t Know the burst time tbo
procem, before it execulea.
ASSES used ok a beadrmark fo mesure [compare Fechemna
| of algocithms Corb STF
|
|
> However, we can implement STF with Predicted burst Himes .
Prediction Technigue, gb Qusst Himes. | ft
trea Mes dr Burst _times
Sohic Techoquss
Ss gee ab process:
ZH any other procen ot Some sine Coppmt) Yan befine.
> then bared on its 87 use. preditté BT of few process
| Gy W Type gb proces soe \ -
|
| /™ -
| os sex i j
ineethe . Rrepaiod — Badymnd Rap
(es) a 8) Cie-is) (Cao-s0),
Bosed on type cf pwcess we predict a er fbr each type
wed
Dynamic Prediction Technigues
A We predict only paral Burst me
Lee, nent CPU burst
‘Scanned with CamScanner¢ one 24
Gegonentah Averagiy echnigne aging AMyoetvin) !
Dlex Py be Preesr
Dilek by be complete BT A procers
S)iek Tbe prediced BT
| The parameler
a)ler Try be Next predicted bes BT - oftrols the relate
- weaght: vecent
Taye eet Ue) Tr, 0g 51 cand past history ia Os
grectiction
Koo
Tryst HUE fad nay UE) Tn |
Fatta + olen) tart “ay Baar
Tale Eg’ eLt-ahbgart &Ci- xy
Tas
te Given dhe Volme ob od, yh previo RT's ye can Yad ony
> AU Re above apmeach 1 be a site process ond partiol buxls
ah the Process - Tora
@® Given ofto-S ¢ cto
font neck cPY BF oF te procers , € IK Peston
ta, thoy Bis BD st /10.
soy” '
‘Scanned with CamScannerwy Highest Responce Rabiow bent CaRRw) : '
2 This algecthen nok oft Aavouss shorter prrceres but also Ling
the walking Hie A longer process.
Crilesto: Reagonse Ration
“| Regonge vali
Hi 3
w= wainng Hime a He process & fat
Sz gewutce me (Burst Kme)
Mode + Non Freemphive
| > = ’s high baer Seite ers and Hux Avours shorler proceses
s
j
| RAS ps high stshen “us! is, high and thos Avon dower at
|
I Prowetses uhich have been wsai keg HU now.
Peo AT | BT
4 o 3
2 2 6
3 4 4
k 6 Ey
s & 2
geacaken |
J -
ev fasta] cRaaas
kg to 15 2 ey Fuse
ae: Te
os Ns Brg ofttee
Te
fa fauowed Y
ne Lear provers i Sore 2
and thay Stawatien is overcome.
‘Scanned with CamScanner5. Priority, Bored Scheduling
EProdty is aq athe & pocer,
+ Boied on Type sire & pores and Yerourcer the Procesuac, 1
Ve prey so , STF ts 0 Special
+) procity cour & prodity xed
schedultege In sge
Stoic. arnt prionhy is ieverse. |
agrees inereoyea) AF nenk-eay bust
Cetera. Prority
Mode + Bone, fete we Pr /
ply ree axe. _ doles
Pa “Biber
+ lower priority procemes Suffers staryotion |
5: Pily PAT. sr"
4 ' o 4 o
6 2 2 5 |.
5 3s 3 6 :
Bordult 8S pe Baer ;
aL 5 oF 8 ;
15 is rad
Aaguring high number is higher pridihy
toon Refnge,
fe
‘Scanned with CamScanner4
One solution fym
precating bate Pray
prceintom Starving
} is aging-
Agity involves 9
incveng tog the Prony
ot prcemes Yak have
been wary
me Wing. dr long
fee Ege, can
[pRedetayes ST
o 235%
[e[efelebel eelel
“oe 2 5S ¥ & Hy 25 T
cD) OR -REE, 13 16 M2225, 22, 81--)
OP HG Sirs, 20128 8604
Be lbvaaSs
2458 ON
ot .
) t amare fre] aS
(Round Robin chedubiag (Fretmplie” ESS! 4
*TG is mostly wed in CHuikiproyammed STi thatd 08°);
Gxilera: AT # Tine Guan . a :
_ Mode s Tre Emptire .
Ready duces FIFD
Gonblick reilahee : loser gid
> Ruvning Paces ic pretpiea Lbayed on time gjanturn-+
ee Ns “
Ke, Ti doesn’t Include time spent in Contect-sinitching « Oly
+ Time quantum doesn’t j sen mi por 7
Bo emo Ha Cree ss Ganley got
me Qual =
4 4 q 5 Tine Syeit en
‘Scanned with CamScannerot asta 0 |
uy tat= 28 -_ + |
* |
Pr Geceraiiyy quot is high is RA shedlieg-
fho AT &T “ae |
tO, 8
2g 4 \
3 3 3
4th Be .
+5 4 5
frmeme, TR2% and prepare ie pan at ond. 9, Agetar |
reopeues 014 fo: both
mar ak the. sane. Kine, the
Reedy & Mf, i KRG Bs WVre grcea tegicn more prety ,
REE Petal [el Pal : «
oa hep eRe EE OY a x
ee
NG BHA Ort
wry ster oe tt =
Pug tt =
no Tax
vi 8 BR 7 5 2
vo oom BE
ws 2 G3
“4 10 a
ve 8 OE!
RBs LEH, 04 Br CH
foes Lea Pe | Fs lap rel
ot 5 oN H 1 20 23% AM
Scanned with CamScannerRedon of un Rin:
+ depends on dime quanturn
Smal lange
Hore Context Goitchey & Low Content “Goikching
Crow. overhead)
& poor intemebve and tens
yesponse.
| # Topioves jnlerachveners
when ime. quamlan is very large, the rand yobin becomes close
FCFS which p iS poor in yesponsivenens-
‘ #50 fine quantum mab. not be very Lorge or must vot be.
very genotl* Moteate teat
Ri) TEEPE
5 fOr 22K Ss 6 FEA)
Gi" | Context Switch hime >S
Taq
fe[r [ste GTAL-- eT als[e
= R401) + sen)
> qe E-sn
=a
| te
} tom 2 Gey Pees ge Us Meek Avan only ole
tity hy atlente %' gee.
bons i
[ 4 CO 1 ery proven ts execitel aHeoage ue ati
n-!
i every WWenal ot § gee.
‘Scanned with CamScannerz
'® 4. BO dso
Consider o
VRP Mee is Re wey tha prionhy of
Peceines in RO goes higher than prosity of
running proces and hen ne preémetion-
B Brey neo pocers will have 0 prion hy which 5
Ves Shan that ab Previowly yaaking Precemes
© Fe moe the proce wails, He higher the proety
is.
2. FOES
I- RP axB8 be
4) Boo
EH (K) =
a
$2 Boven mii =t
ae yah
Pe
1, S EFS E58, abtas.
Procers is scheduled
Tes prosity Tat He vole ot P
Priowhy F pocesin ROT at fe rale & ot
3 eh sork
topl Kime SHE
‘Scanned with CamScannerfo
) ot
sets Ter
Of He BR teat |
p> BB pt ;
rE
lea, Saal
| @s's) s ss
| je 2-20
| aMule Queue Schedalig
Using single quewe , to search a parWcular type A process Ir
faves time. Also we can use only one Schedlating technigues
Te overcome. this Problem we vse mulhiple quen-
7 Each queve coflain ga ¥ me cakgoy of procemes,
sie we have Mare Han one Quevey We MOY tbe ditlerent scheduling
alogoritheys ana, be. tated fr each gueue-
‘Scanned with CamScannerFF
. . aay
es woe
foser prise “prcenes
villing fly OF higher
wt (ieee)
[
: bes an iggy, .provenes!, gu |
ce) ee |
Low: RkGNO i
Dxolunages
Procenes in Lower level queues (, [oo prity’) m suffer staruaiga,
feHullilevel Redback ues :
ayes RE
(pots 9)
eo ——
Ror
Ros
Rok
eee
genera , (b< tacts’) :
> Bll types procerses enkty ROI- They will be: gevvitked foe + bie
and if ik Weed BT >t, then (tas fedback fo ROL- In thak
wea of proces fy Rx are fedbach fy R63 and so on-
Proceas ot RO2 are scheduled - ool ib Rou isemely
>The leat quest hos to Th. siace it needs “by ‘ensure complehin
So FES i wed ak the last guéues
Fount yards
‘Scanned with CamScanner| > we thoae by such that avy 87 OS prcesea hy prov) ie ME
& that all high priority processes foishes their execubion a Hy
WE quere itself. sustde
a Then & Hen ty 15 choosen such that , the aap next ih
prodly prcente! iractie proces’) “er & bthn «
or This algorthon may alo hove gtarvahod -” However this iS” moe
interachive. than mnultilevel queue. scheduling.
yok d
1
| Process Synchronization? “
| TPC: Inter Process Communication : wlan
TPE mechanicons ce memory
Hewaye Silene
> Commmbunicabion must be synchromized.
Weed for Syteainn:
4 y
' ~ ysreonictency (tocoeredtnen, lon: with)
2 Loss of data (fost gender 2 slo recieves)
3: Deadlocks
iypes’ of Syrebwon ization mt
dy Loripeion'Syrchventéabion 48 et igs a
~ “Theo oe wore. prbcenes’ ae: fold te beth dmpebion
Sypchyoreatin 5 HARE Hey competeleattend for Ofcesing
© shaved vaviotble
ein
t wre
Se Wy 0 shoved variable. :
Lack of competion gyachionitabion “esd fo iaaciteney ‘Ldsalon:
my
‘Scanned with CamScanner