Advancel Compuler bchitcloye ohlou

CPI - clocka pea enstaclion

(
X*/o9
C’clock cycle
CPI
|RcuiOn Time Ic x CPI*
le Tnal' Count Ic x CPI KT

Afour hundered MHx prOce$sor was wAed to

executia bunchnaek paogaam whh faloun
instzuction mix g,_cek prue Detlaminul
ciock plde
the mups oate Cmillion intespes Recond
Oud execlion time f the

Poagam Ic

Indeger Aithmctic 45 o0O0

2
Doclä Tran&fer 3200o0
2
floating Peint 2
Contotransfo

45000o
CN)
f=
Cout)
400 MHe
6400O

400x106
CPT

1550oo0
looogoo
55
 Doto

Exe culion time Ix ceI x^

(T) (IxLo)* (1:55)*

3.815 mSec

MIPS ate Ic

2835 X6 CPI i
58. O6

2. kstatior V&es .5 GHe

A cOoxkstati of proceS 0r
caitu a clainee 1000 MIP8 o exeute
GYen paogram hedi
cy cde de lay fox eacl mnemoy teus Ddermine
(a effectivd ceI of the Compter.
(b) SuppORe a pnOce}so is being upgracul with
wincoth a
8GHz clock houbeve
Raste Cache cik cycles ase equirecpr
oemoy access if 30| of the in souction
1 memy accw another 5lo 6
DeQuise memoy aces pes in&tuction
ahat ie the pefonmace al the Jpgacd
eall
p30cs0r LOLt a Copatible Set
instavction Count wi th in the gi ven
Poog namis
Hz MIPS
CPI 106
mips
CPI X Jo6
CPI_= 5 Xo
CPI =l.5
 Wp

Date :

(6)

K- pipeente *-isUe Paoce

P 0ces 0 wilh & pipeire
CP- O.5
P'pe 'ne Aochiasee
PoocesA0 execuing
P'peline 1 h yeelion
JE
inttuction decoal
operan loacing
Ex exection
3tooe back * (-Halsc)
Data j.dependeny
I Load RI A
2 ADD RaR ()Anti cependentg
MOVE R, R3
4 8to7e B R1 * Contaol dependency
L0OP
MOV R2, R3
xztavctal depanden
Bubble&- xoa ADD R), R2
clo ck

Outpot dependeny
S13|3/24
dependeny Analysis Cpainsit e analysi8 ).
Chek ozder of executeon 4 prececlh
va luea. aze upolate
 S]: Loacl RI, A (st:sa)
Ad Ro, RI (S):s) -o) olp depenentuy
Date

MOVe RI,R3 (S): $4)flow Alow dlepushiy

sS4 sto e B, Rl
Analyais: d2d ad RIG R2
(s2:53) anli cdepehdeny "hen 2loc valuc
SQ:S). No Hazade
in R2
(s3 s4) ’ How dependency
(s2:52)
Self depCr dert
Depenn.
(54

* Bean2tains Concition fos Parallelismn

O) Bet of D)p's

Shen inatzuclons which lp I,

ingtzuction which has o<p_ 0, then they
Can ip fox
be taken bp pasallel executon.

PJ Pe
P2% PLPa
P3 A=B+C
c> LtM, PLPs Can be Pasalel
P4
P5: P2 || P2

I NI 2
hot at!azard Pa )| Ps

Pa l Ps
PAl Ps
 Dato :

P1

G + P

Pa
M

P5 Dependency
DE

Ps
GP B- Pa P4 F

sl324 Computation)
-Actual Require Algoothm
C1:

C3:

BoflLONe tadusare
dispatch (L

exeuion in d-isue
 ratio
houl Commuicatio Computoation
to
instzuction
levels Loop
CBobnouttnes)
oaMa) v
Procecse,
Buboogams
aim l eparo cugce
of
level olitten
ent Paralletm
at
Parallelism Bound Hadease
6
5
CoreiL
3
L2)
2
Pooces
cual-Coe Ln
Pole) cauial play 8.Com
p1le Compileo
cpp co
theoueroe
cCa
be plchei dis
iae
&ralar besuper can Coe2 (03el
, PooceSOZ
process0 Coxe Ducl Gcalapif Bupe t_
PIpesMutple
Core single
poOceIso lfeocnt ’ci
 Date

)
cxf
b2 Comm 6
2 C:3 L /xK mullipy 2
4d=4

29= axb þxoxh

(h2)
-2)
I- idle

P2
A
4

14
(p:2 4
4

B4)
D I
23
32
E

kcheclalin 3.0
(B4)

packing
-dcpendcnt gacle
 Dote

(n4) P

(B,I
Program B
D E3
13

progam P
Bdedulling 23
DD

edawiny pgmfos gxaph ath nnlt alsplitasr

Communicahioo time Can be 2ighi ficanlly
2tducet CNoole outlcation &oltion)
- Ih eaueie Cale, it took re time
Comm raththau computett on
PL P
A

5
C

An A2 B) Bi2 Ci2
LA A22 B2B22 C
 Aik Dato:

)
11
CiElAt
Aix x Be
6200D 1oloola
MOVE w Axx Di 5

MOVE w Bxx
Mutlipl
MP1Y D,
MoVE PAR
101

MOVE PARL
NOVE PARZ D2
A DD DI, D2
MOVE D2 PSUM
68
20ing
aslsl24 Routing 8ele ction f pplimal pothin
Lenea
Nefwok destinlon
Multigtag Lower bi

3 OL

|00

J{o4/0
 Date

" 1; the bit iso, then id is golng toConnct

to cppr o)p
the tl_is toConne ct
(he. bil is 1,
lo louJeT Op
geing
the stinalionn bils hced o be ConsidLed
ie iffom 55to 3
3(duslinalioh) tMicldle bt)
C6) the Lowes-loe
Co) Lowes to uperolp
OPpeN to LoweY S/p fo Loubes bit C)

* Omega Net007kS a also called o2 Belf

DOuting Nehwoles.
l4|2
n pr0cesso
’ DoP degac of panallelism.
44ime
t 6
Dor C).dt

1 2
A iti
L=1

Averag DOP CD. t

t-tË Jt
work done
 Dato:

Panallehs L
2

2ime

=
Lime for Unip?oceisor 8ytem
&y
Lime fox Parallel3y2tems
T
To

Amdhal& Law
Wi
Sne(T)
(Tn)
1

ehancemt

an enhancement tothe
we are Con aidaing v e , I the new trVeY
ha a CPU
If &ol of the time tor alng
fox 0 opegation,what igthe
 Date

f= 40 "):=_0. 4

C)-o.4)+ o 4 O.6 t O04 O.64

1-5625|

What is t ove sau peelop of you makeIo)

Gy tihe progo am
S
(I-f)t (U-o.) +0.)

O9%0 8011 00)

HachineL Conmputer
time Bixe Cost

ATchilee ture MemorY

derad Algooithn Denan

Proble Cormm
8ixe OvethaL

ECa) Bcalakility,6(8,)
Bupex Scelar ProesOT. RISc
 Bore ae
ny Memy Vaiablu -’
tial93tquu
cal ral Tempo )
ity
houldasigned value Bome Coherennce
ncuLve
8ackup
Beetorg Disk
RAM
ds:Bloc BlockyC32
wo Cache
/words
BiteSytes Reg
Bonh Multiply P AddL/sFP
ALO
|Trte P
Memy
Matn
log Vezy VLIW
Dolo:
 a
Date

Mi BlockA

Cache
b

M
A
Main Memny Pogus

M3
isk
2gment
&Aonag
BearchHime Mi time
hit + (1-h) hat Level 2
Ty Agce + (1-h) C-h2) hgtg
miot misataschtime in levels
+C(-hs)C1-h2) C1-3) hyt
Access Tine
tllcetive Memay
Ctotal S. CCsi
L1

AcLes ne Capa city Coxt kbyte

Cache ti 25nSec
Main Memex S2= 32 MB yBea C2= 0.02

Conicdee the clug leyel memoNy hiarthy

E8timate theAc cs ne Katnl memon
aud Capacity ot the diik aray. I4 thel
eecive acteutime Bhel dnotec
'sSonSecG total Cast of nony huitarohy
uppex
Assume h1- Qq8 Qs the
known
 Date:

Total cost iGotac) 150o

002) X61
- (o.2)(5|2XI0)+(O.02) C32 X1o3)+ (o-00

Tet - hiti t (-b)b2 t2 t C-h)( b ) h3t3

C1-0.4)
o.qq t2 t C1-098)
(0.98) (25xIo)+ ( - 0.q9)

T l = 850 xIo-9
850 X/09
'+o.O0000o ooß, o to o98t 2
X
4.6xlo
0008
850 - 94. 5000 oo
XI09
t 8Q5. 9499 99992