ANALYSI OF PARALLEL ALGORITHM

AlgoTithm
An algonutim a tguonu o
teps tpllowed
Ho ove a the
poblem.Ittaka input hom the
Use amd Cooputahon poduts dm butput

Depundng
Depunding on he avchiledue ornputuu , we
have Lw ypenoalganithm
&ea uun hal Ageithm
An
An algorrthm inwhich beme tonsatuive

o insvuuhona a Lxetutid oa chuDnolegul

01du to dolve pblemM

PROBLEM

CFU
Iatudiou
patlel algonsthm
Th puo bum a divdd in to
ub puoblumu amd RXeud D pasalll
&nd'vidual Oueput Aaka, tbe Endivdud
utputs aL Combtunud to fotm the dud

Outhut
 pauallel Atgoithm
pun on
be
pauallel algoithm as algaithmu to
paualel
panalld machnes
psoussing
panalll algaithm hghly e d in
volumes data io u c k time
buge o model
a od
p a u a l Random Aus Model
(PRAM) is
o mast t hthe
e
toniduud
pauallil
which u atlakehad
aasL atlatched
thmAHes mulhple DLoussL
algal
block o MemOTY
a Bungle
A PRAM modu lontains
A Bet o dîmilas bype h petoUuO
All the eshase a Commov memory
paLOsors
wt.puoussou Communcadu mbng
Untt
haed mmory ny
themelve thsough the
(MAU) Connutk the
unit
3 moy auLu
A mmovy MamorY
dhanud memory
posOYS
weth the ingle

ProsabY 1K
Memory Shaud
Aus
Unt

(MAU
LDrotosser
Heae Duobe o puwusOYS Cm pee{0am depend &ndoped-
enE opeation on n Dumba o data a paodiula
time Thi May exult io imult mAou
auuto bame memoryocatuon by dittent pLOLA

There Can be aWss Cooflicts that can OCcur

wben oo or more prossors i y to read Ov

write ame mly locahon at the bame Hme

Conflicts Can be of tollouwing ype

.Tuoo OY move proAOYs tryinq to ead 6o ame
ldcation
Or mOre proassOYS try to wTite to the bame

memory locabon at the ame hime

pbtsOYS truig to write and Read froro Same

oemoYy
merooyy locahon at the same ime
oovdey o Yearict And Yesolve these Conf lick the

gerer alisod PRAM model has bean Calogonized to

Vasuanta
EREW Exduie Read and Exclusve wlsite.

Allous Ony excluive read and write to the shaud

ony
my locahon. So
So no wo ppussr Can Coocumanty
 But the Paoll
wte to the 8ame mly cell
Scead my
to Cread /wsuite) dihkoant
Conturent aues
has
has
Locatuon down the o vemall
PRAM model lows
Thu Vauiant o to the
same

and UwTiting
peoomMu) as yeading n is the
numbe
numbe
where
taku n time wnits Concunty to the
Concuwenty to the
Cell
memory
90adimg O wsutig
opHOoYS

mly cell Exclusive w t e

C e n t e u t Wule
Conurrent Read
CREW memovyocauon
Loealion

Read t o a
bhasud wmovuy
shaud
Conurrent Corurent
Allows disallows
But t
by mulhple pauouusov Locatioi by
Locatiei by mulhiple
Muliple
shaud memovy
DLA
Wsute to aa

iin
pLouAOxS Can be peshomed
pekomed
read OperationM
The
The Lonurvent wuite 0penation
wwte Ope-ation
ConuYYent
but the
One w n t a hime the numbe
numbu 0
wnk wheve n to the y
time
wnuting ConurYenty
takes n Copturventty
ev wuting
paLoLsOYS
readig

Cell
Conuwent leute
ERCN Exdusive Rad
but lonurvent wuite on
Erdusie Read
Albuss only
ony
had Locatuons
 CRCW Concuent Read Conurvent Woute

This PRAM mdel allous Conu rveut Read and

ehared
Conurvent uwute to amemory oeation by
mulhple DoLAOY.
The CoDurvevnt Yead md wuite opuualionu lam be

peeo med n Oe wnit o nme

CRCh model u the hrongest model amng all te
amd Conurvent
PRAM
PRAM models but CoDurrent Yead
wr'te opualions Can Cause data incons uteny in
he 8haved
memovy
So tLAaa,uu dome xtva Conshvaint poliu
alvmq the wutL Conlict

Dependingo thee poliu, CRCW has been turthes

dividd n to pllouig Vaiants

Coromorn CRCW PRAM: This nmodel allouws Conuryent

Common
Uwutu to a memoTy lacahon ih apd Ony h
directed to this cell have the Saoe
al the
Messaqe to tLute

This is the eakest of at the Variank Of CRChw

PRAM Model