0% found this document useful (0 votes)
6 views18 pages

OS Assignment 2

The document discusses deadlock detection and resolution in computing systems, explaining the conditions that lead to deadlocks and the techniques used to identify them. It covers various memory allocation strategies, including dynamic partitioning and page replacement algorithms, highlighting their advantages and disadvantages. Additionally, it emphasizes the importance of efficient memory management to prevent deadlocks and optimize resource utilization.

Uploaded by

amandhiman012021
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
0% found this document useful (0 votes)
6 views18 pages

OS Assignment 2

The document discusses deadlock detection and resolution in computing systems, explaining the conditions that lead to deadlocks and the techniques used to identify them. It covers various memory allocation strategies, including dynamic partitioning and page replacement algorithms, highlighting their advantages and disadvantages. Additionally, it emphasizes the importance of efficient memory management to prevent deadlocks and optimize resource utilization.

Uploaded by

amandhiman012021
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/ 18

lcees

exclusiYeOMtso0 LOhocesSes
tiaoa
ldig
the Hsld unble tuo
Computeclo
stuck
Deadlack
deadeoc Ta
a Deodlack
aod
Can Eccusien and
at ta Aajgomeot-2
he8
Jait neceas deadlock
Cann Ahaceed Scieace
g-noceses. that
holdig esihaian,the
haYe.
ths, time:
ien held chanactonied OCC1S
At
Conditias
heqest
hile
nesQhces ioleat DrtePoge

the 2uheo
stlL must
a be anzen sSue
mt ane
Poge
Dote

aNo Pheeoption & Resausces canool


che lecisy takea
ncess.
hg the
be
maacess
heleased

haldigg
OCincula Duait Thehe must be a

Onace sSes hene each QhOcessie


DuQtios held
he Dhcess. io the
chain

Q2Demetiate ceadlcck and etauetioo


Deadock Gtanration
a situation
Lshee tuo hene 9ocess
mone to
unableto
t o ooceodQnoceec
Qnoce ec cecause
becaw6e each is is Continu
held hu
delaed
athen 0ocesses
the othens
-Deadlock occUns Stanyatíon occUNS
Can pnoce ed ad
Poge

cbetate blaclblac ked


Rad thile hiah
piomit coena tions
Rhoceed
yDeadlack is also Staaa ion
enaunas cincolma ved oce
lack

Sendock onocetoes.
bidthe eSouces
Stamvel PNcesSes
hold
neSace S the ae
a dont elecse pshed back
dhem

1hat Ia deadlak detection 9 Ecplais


detal
Deadlock detection is a techaique
Lsed in cpenatigg Suatems
cpanatigg ytema and
Concunhet do idest
he hesence dead lacks io
Ste atenD th hQve 9CCUhhed

Tt's esseotial mechanism an


detectig andnesdvigg deodlocR
atuatios cto pne reot G steo
espnsivene55

Detailed ecplanatisn o dedlade


detetion ane
OesonceAllocotioo aph CRAG)

adoa
Deadlockdetetin
atuc hye
oten emplays
Resonce Allocotin Gaph
Ta the RA nodes Shepre aest
instanceS
andedacsnepnesent
allocation
nelatimships
io the RA
Each Daocess is heonesented
Q cicle Cnade Qndeoch
esauce instancé ia alaonepnesentad
iecLapale Chode.
Pocosses that hase alnead
cbtaoed Ne Souhce have
the
SeSauce 0ode.

OEdae Lpes
io cthe RAi
Allocatsn Edge C): Repnesents the
to a pce 55 allocotien oa
Dste

)Request Edse C) Rephesesta Q

aDetectigs Deadlacka i
DesdeockSeanchigs
uavalves datetian
the tpica
io dhe aycle
dodicat!s the
possbili a deadlack

Pesicodicit Detecticoo 3
Deadlock detectioo Can be
Qenlasmed Lpeaiedieale 92hen
hecuated

Peniodie
the RA detection iovayes checki
anGucles
intesals t& idonti agula nesolve
deodloks.
Page
Date

Eplaio ced patitianigg ad


dynanic panitianiga
AFiaced Pantitanigg i
isithe the chyaical
memoy diided sta ioced -
Siced
stenastup
pantitians
Each chacks damigg
pomttioo hos
Gizea these pantitims
an iadthmehaut
ytem 'a spenotien:
the

*Chaactenistics
icdto stitaniggis is
iapleneot
siple a
eiceat
Each pastitisn can held on
Sßesco nnot
erceed the Sice the pantibon

*Adyootsqest
Phceasesne allocoted memo
easaitad csiochs mahiga
ensy to nngqe

no
Pontitions Qhe ic edthene is
nameptatin Othio pattioas
eccdigg eicent memny allocaion.
Poge
Dete

the ntine Gse


pantitianiotenoal
gamentotion occuhs esting

Fioced pntitioniga cannot hadle


ant
paoce as
lead to ecieat

Dnamic Patitianiag allos the


gzed -antitions inta
chase
atne Size hocesSes

o
lemo
hocesaes
allocated dnaica
ve

TotitiosCan
Can en n size mtchige
the airea the pnacesSeg.
Totes naasyamertabin Can OCCU

tliee the pantitiont


allocated
Adantaen
is allacated accadioa
cto paacessheqisemente medueioa

Uthvoniabe- Sized patitions,


iateaal amentotin eis mioimired
LComoned
panttioiga

Tt nequne sphisticated neoa


LmanggcerstechniqucsSuch as
meemen
desla
oad alcatina
Datitiens:
lehile iotennal tiggmentatin is
neducedetennal ággentatin can
time pantitins.
cheated and degt haed otentiny
dead igs to nemaa mentahin
isue.
GSes Qhoce
-5izYeniable
lktu inited
Iotennal
*Disadantgaes&-
renheod
pegest *Adsantagesk
teSimple
memy
(1Se
desianated
blockceSsCan
then thot
ed
od is iata
Dnocess
memay ceotis
hcess
each
klack to Siggle
Allacation- (0Coatiguous
lema
Net
t
st De
Budtyatem
Memangy Finst
llocation lemay Contiquous
e
lgeathms allcation Memay
hen
ets tallacatisg al0 lain alaathm
allocati mame at it
Date
Page
Poge
bote

abddy yetem
Ttalacates meno powens
ig 'made
spechie aize the 94stem
6lacatca the sollest availle
Alackthat the Mequest
Splits lancen hlace
Gnoen
blocka
*Adyoataqe Miaimiees onameatation
eieiant meonny allocationMe.

Diaadyantages Linted to powso o


tuoack Sizes
Smme intesnal ggmeatstin
Fist Fit8

To the a t allacolinn alaontha


the gustem "aldoctea
availaalechock memon that
Ltbe
agge enach
Ohocess
Qccommodate

*Disadantsaes 8- Cao lead


ineicent
OYeN time:
memy
to na gmestabin
OBest
The chest italathm alloate
the Smallest &vaille
that ablock
accanmdate lae
ctha
tomioimte hnste.
*Advanlases &r Rsduce onaame ntatian
chettes nénony utilizatien
Companed to t
* Disadvantgea &- Caa
ao he sloen and
decddo lacomentatin
Wanet Et
F:tg-

the.
Tôe hueat it aanihmallacate
block
memay tothe pnacesS.

*Advantases Siaple do inplenent


* Disadsantases & Can lead tea enctessivt
hagmentahion and
inaient
Poge
Defe

Next Et
Sinilan bit it
stantsthe
black Sench Suitable
whee
made the
last
allocotioá lnG neducingagmentation
Can edute
nagmentatiag Companed
to

kDisadvastages bagmentation issue

onene vauniant
enchatit'an.
ch iced qastitiaig
aspeciic SIte placed
the apprapiate
*dyantages&Can. dmphare
Lcllocati
DoceSSes
icien
Simla Sies.
D'sodcotgses Oveshead ia maistaining
multiple queues
Poge
Date

neplacemect
detail
algethm
Explaia
OFTFOCFinst- In- First-Ot)
FIFO aplaces the oldest
mema t maiata ins
the ande
they wene ed codthe
ot the ant the
needed.
9,hen Da ne

Avantones Simple to aimplemeat


Disadxaatgaes Tocheasigg the
nameG Cao
incnease ga ,aults.
BOptimd Poge Replacanent (oPD:
SPT aepaces the pae that
nuinstche
Coggest tine
ised Aa the
T equis.es kNauledae a the
hich memay
is Qccessnot pattesns
Qvailabe
io paactice.
Poge
Dete

xvaot aaes & Theantical optigal


aolotia shows tbe
minimum Dossible
aults
*Dis advantgqesTopactical aue to
the need
cenauledee not Stele
on oneal-tine Systens

Least Recest Uscd CLRUJA


LRUheplaces the
has not hecen he

etack tmaiatainaqeLue
thein Usgge and
the deost Used Pge is
eplacad
io Captuaigg
tepanallocai
*Disadantqs & Laplenentatioo Can be
Compl and
add itional dote
stuctues nataluags aptioal
Page
Date

Qhat is Pogigg
manggl
Pogied
acheme

opatigocate
mana e
RAMand
compytes
to
i
meman Cdiak space a.
a paceses
Land ogams
It's a techoigue that enade
ahe cpatig Sys temtodiide
vitua0
cbath
Mepny
chsicaland
iota
Priese Giceand
Ged to reme date God
Cade
Secel adyentaes agi
OSimplied Memag Manggenesit
Flecile Memay Allocatig
S Ease Hndlng Poae aolts
Poge
bofe

-9Eplaia Demaod
steps
Denand
manggemeott
haiae usedio
optimize the
modeno
yalema
opeti aical CRAM
podiggant the neined potons
Dmam dnto men
needod.

Steps invalyad io demand

Pose Table Setup &


demand pgoetoble
pgigg Systeo thot
each
Das a
maps ts vibtual addnesses ta
ohisicol memas addneGeS
BPage Table Entay Tnitializtini
Each enty
eat sio cthe table
leincludes in nnnatlon the
lsLate
age Fast
hea a
Handigg
pnocess attemps to aCcess
that not
Poge
Dats

the
ohyaical memany
System takes cpeatigg
Caotaol:

ORege Reolacemet Deciaicn 2


decide he Cohich.
speotigg ytamto ne place
ta na Re
he deoandod
Lanlacemett alasithms Such
othens ahe Used
alem this
hia punpcae

I] the chosen
poae to be
oittegiedit
kineplaled
be
muast
cte cthe
disk to maintain_dato
data icon sistrsg
ol Th theo0 demaded i5 noL
alneady the the
lepenati Oab
the aoto
tergmut etehaailae
it
Memoy
Page
Date

Update Pgae Tadei


Coce the paae is io memo
the pgge enty
Cansepandiog vintul
helect the newtate.
he tadeto enty
ioïcate
may aleo
that
the age heen mdied
it ns utteo

Restat Tastnuctian Executian i


20b the demcoded
memo the
ipdated the iostaian that
ecaused the ie hestantod
Aecess -
The Qnocess Cootinues to ereGute
and Subseguent ncon
cce5Ses
che
Sioce the
t
Gemyiced mu aoten

You might also like