Computer Ovgani zation Contents ' CA vw Co 2. Meso Computer 3 Com putes Arithmetic N+ Miewo opesations , RTL ( Register Transfer, Language ) Trstructon Format kk Addressing Modes, a S- CPU pesfosmance measures + F ALU Dake path - 1 | 8 Gakysol Unik. | T- Tasteuction pipelining - ESE: y 10: Memosy OxganiZation = Cache memoay. 1. lo systems Books - Computer System Architectuse - Mossis Mano - Computer Organi Zation - Wiliam Stallings + — Computes Ovgani2abion — - Hemachar7 Te Sema FR with ‘ Functional laa C npuket Axchikeckuse Ll deals of the System , prevoer and ‘Logical Aspects | ampst axganization = TE S the Hard wave Components \ intexConnectionS — Amon, them , bo meet Archibec bie ane I gyeei fie tion $ Tk impsoves the System per formance | conpute® + Levels af Abstraction - | | Sof worse Applicokion 1 Cinpubes avchikecture + He er 9 terdwane 4 gL DEBtEal design Pd aii Computer a ft organization % Compulet Organi Zekion is also called as“ miceo Axchilecture® BMicvo Computer, Th bas 3 Components {| @ cpu } @ Memory @ To sytems {pesiphevals)Micxo Computer cru eles bus (widedineel) *® Addsess Bus - O- Based on Program ase processed ® Bosed on how | PYoysam and data ose stosed how and data Memes To system 3) Dake Bu s L ss Q@ — Contee) Gus * Bus - A group of wises * DakeBus - Bidixeckional - Unidisectionol - MicsoComputes Aachiteclures Com Architee : @ sisp Architecture —— ® Simp Aschitectuse ——@- Msp Avchibectse @-Mimp Architecture. ——@ Venneumann Archibeckure - P¥ogram (Instructions) and data ave in Same. memory. BoRG UP Stosed Fy! 8085 up y -@ Program [Iastyuctions) and Oats one i Fle vent Haswasd Avchitecture ! Skese din memorie S + E95 p 80S) micka Contvoller,ai gro | Single insivuction and Single Oala Stream) pachitectuve _O: Trstsvelion contre! Unt few) Paocessing Unik © (Avv) g stMo (Single instsuction and Multiple Data stveam ) » Avchiteclure fe O- Trstsuction & TE is sed in image Psocess:ng add Video psoceSSing \ , | | @pplicatsons - | @- mrso Avchitecture : | % Multiple Inst suction and Single Data steam Archibechre is impractical: Aca )tOo” and Multiple Data stseam) | O mmo { Multiple jnsktuchon 1 Architecture « | ond. mulki ple | =D TE contains — mulkiple Gentee | unis ProceSSing units ro ikeety % Von Neumann Avchibecture t= [princeton Avchikectore, Stosed — pregsam — Aschikecturc)- Memosy Tast T Cru Inst Ts Inst Ts dota 1 Disadvantage = Less Though put (Ne-of instsuctions executed > pes Second )- #* Harvard Aschitecture i= | Daka , e cpu | . ~ Psogsam memos % CPU Can ¥ead jnsteuction and data Simultaneously Advantage = High Thsoughpul By @O Super Hasvasd Avchitec ture - @. virw ( very Long Tastwckion Werd ) Agchiteclure - iy es . Mulbd @O $051 we + SP. proce Sos -*{ MAC Unit) eenre = crv (cenleal Processing Unit) t+ qt hes S Components go. aw @ Regisker Array @: Consol unit « cru Contso} Unit Tyres of Crus = © Single — Accumulates Based Cru + Acc <— Acc +R, Fy:- 808S tp ADD B A<— ASB Des bination pb Swurces ®: Genecal Register Based cry + so! Ey ADO Ry RiP a): a a Ry <— RAREy: @oec up ADD Bx, C% px <—~ Bx4ck | © Register stack based CPY * | Register Stack RR ADD 1S 430 24S e SuB BAR 4S EY > : 4 1 atu gets the inputs fem the top cf Reg Stack. x, Instruction leaglh ¥8 small! and. Nesy Fask, accessing . | Regrskey Avsay, General Purpose Registers la~~ * ee a |. progsam —Counte¥ (pc @ Stokk peintes (sr) @ INS Q: Tostwuction Register (ra) © Memory Adlsess Register (MAR) @- Accumulatex (Acc) 6 Memosy dota Registes (Moa). Taternal pus of ie cry mets Let foe Flag Ts__Ihor areal Dry xyste Zein Ts__|tey Te es, Nec Me memos stack o Progsam Counter (Pe) i + Th holds the addsess of the next instsuckron - LTk is algo Called 08 “Tnstsuction pointes + Tk increments iksel4, te” ake next “iqsboucksen . cru may % may rok ge bo memory. fpr Te EC a) R,S— RAR =P Cpu went ge te umemoty . by Ry e— NEM AR, => cpu gees ke memoty . Memoty i> Memory Seuckuse — ¢> Size of | memory = xy eq Addsess Vines 2° memoty locations +Ey ts Consides kB i kB = 2x8 * tke memory has. 3 of memory , to Addsess lines fet internal access mony 8 data lines and Be ery memegy _ lecations « LKB memos: * r ° ’ 2 N=10 eer 4 ; px 7 * 2” memosy locations. | EAC ° ; ‘ Po a 1 [ee ele toay Bdatelines E52 Considev temB memory. 4 F2 xX IGM memesy « a 2 memary locations ; datatines.Addvessable and Word Addacssable memany age pyte + # Bits Fword = tfie] ar] ox ]iar+--- bits J poukcen wosd = 3a bits = Y Byles Fy oO wosd Addvessable memoyy - ®. Byte Addesessable memory . Byte 2 |Byle3 | Rye! der | dre | dea Bytes | AYyte & J dts Wosdt (sabils) der P 3 data lines @ dakalines. Size = a" x32 Voy i ‘ Voi. Size 22x 8 i tet 2 Wowk eer (340 Byres | Jat Note Bytes | a*3 7 ! af Bates foas Let 1 word = 32 bits =U bytes word 4 [srtec |i-8 . |_syter | x6 Te access the Next word + c aff ae pe ¥In Word Addsessable memosy } = Addsess has be be. incremented by 4 : % Th Byte Addvessable memory 7 ~ Addsess has be be Fr cremented by. he } ¥ datalines| a . gize In 8 Computer ig G). The Bye AAdvessable = memere) YOR. The word Size 5 bits word - | Find the peek Adda access each Vines weguired be 2 ot Pew ALE Sol Size of — fyte addsessable meme] 2K oY Sire of Word addsessable memoyy 7 we 2 2 KON a aes ag Weis Ae 2 x ca 2 =o \ wx 224 addvess lines. : r “a No-of bits Neo-of biks ary xeguised toy weguised to¥ woxd access Byte Access: Hoye x iC - wm $13) Srax Cy q IQ Size of Werk Size of Bye add adanessable ee addressable «i Q): Hoa AIG as Me tat cy 2 AN mn let x By . Ts vad dyess Koes. 12 -p address Vines Oe 2x64 = OX KE i 8 ax cy 2 oe 9 address lines za* ge eyrae 2s g'® LAA 2 Q > 12 address Mes JFodianeSs s- « Te is the “dedev" of Shoring He bytes” in the memory, i) Bi Endion 3+ ee Stored ob L "3 OS ——» Lower Adduess Steted at lower Byte SSRN Hisher Addsess - i): tHe | Endion . osed at ‘ : Higher Byte SEES Higher Adlsess - . Skeosed at Lewes Byke Ey Ver Oe Eg Wank ko Stove ur 3F 88 7" rar N Higher tower Byte. Byte a): Big Endian 5 ey “yeahs voy ighes Byt, ree tcl 42 is lowery Byte stored at year (+) -3F Gee ae | (g+3) 214 ¥ dakalines lower bgakiiess’ 3” “ark 17 is Showed at Hagher address jaa ee MPL, “seat ieeillby ttle Exdsan « ieey Highes byte 42 iS ak Wen hughes oddvess JS and ee heuer byte FB aE | pre) -aF ‘ a lowes addvess J ” | (ja3)= ( Sdabalines | ° 8 yee @: The numesica) Value of an unsigned inkeget oO ig 4 Bi Endian Computes 75 25S, greater than Hat of 89 ind Vol Fadian Computes which of the following indicates the Value on little Endsen Computes» | , Ox 0100 | ay- Oxcees ) OX 000! e) O% W438 a) 8 , tooo) (u2¥3 ), (100), e665, 4 Mm Little Endian: Big Brdeg ss | % b) 00 Oly < o1 go, Key 42 43 < 43 Ly = i 4 | Adj Of 98H > 00 Oy skepi2 has 1Sq KIC AS KIC E Te: Beata eS Bite Hu -¢ 6 6 ¢ ee Ca — FoFy = ss), Leue * 10, —> W- oe us o” " K +0 = My, 7 “Ay Pre _ 0 0 ° 1 pe to 4 ae : Fy <—— _ T54 @: Computer Asithmebic i> unsigned numbess Base “det magittole- Value of unsigned no => ° te (2-1) & Range of Ey EA biks 0000, —b % nay — IS, (2-1) On An unsigned mre has m bits in inkegess and x bite Fad the _mox value epeesented Hat con be in Foackion - in decimal. Skep vi- max Value oto given unsigned, ne Vee Wee tl ae m biks n bits 1 i | Step 2 Max value of integes ¢ met yy Step 3 + Max Value of frdction 4 Ov thttess! Wort y | vi \, =| yt on, “+ a gn ols Max value of Foockion = ft +.eps ay Lhe -g oh apg he i \ n > aft-s%) $fre@Y yuan yr ie i t Shep 4 Mex value of giver Yeal value - = (ene (1-2) 2 2" -2 Signed Numbess > a). Sign magnilude Fort wry ,* yb + (aes By 1S Complement foom ook aie! thegh Teal Complement) ce): 2's 4 Complement form 3X ou. bla) tats metic Complement ) signe A 2'S Complement By: Represent a) + Sh, b) -8hy In foto a): +Sly = O1N00 wt 4™ 1. ae b). 514, = 2's Complement of 45ty, Complement of O81 oot) = x%s }oottoter igned Addikson + : - i Lwa"S Br Asde es 1 10t 0 4 3 Horo —b -2 4 2HR = tor) ReSulk =! --troro (a 2s : locate) = Ci oat Signed Multiplication 3 Methods + @- Mattiplicetion by Repeatibive @ Multiptication by she and Booth's B- Mulkipheation — by 7 m Xx .Q —> multipliey mulkiphcand, Pofoducl Complement. feem + 6 48 tae 6, Addition + Add method . Algosithm no- of bits in mulkiplier + The no. of bits in product = Takol a Total no of biES in mulbipheand:Addi Q- mulkykeation — by nepeotitive a SS Poxtiol produck ——> 6.0 + Si. 5 eet 5 te jo a 45 is > & Egat -15x3- = -tS = 1000! i Qz 3.5 Ot * pastial = produck = —> 00000 + tooot 11000! —p gia-t ee +1 000 e 2 us 100010 —p gered + 1rtooom ' ay yr o1980801?t Result = troloot! \ Decimal velve of 2's Comp vert —D P1010 01) -(eotorto: ) = (s24¢4 ne! = ~4Si9_ 6: Molkip lication by shift aid Add method. wa 3 5! sx mMe-1S = 1000! @z3 2 0 1ooo} > S bts x Ol —> abies See royo'rtfooor yor tooo01% 0 o60000%** tot oe M1 1 OF GOT 1 -p Reset = 523-8 bits. = -(45)r0 _p Tn he abeve two methods _ mulkipley ©’ must bea positive — Aum bex- | * *, | @+ Multiplication —usiag Booth’s Algetithm fo | x Hese M and @ Can be +Ve 08 = ~NE™ By i+ 18 x3 Step bin M = -1s = 1000! and Q= orl -M= FS = Ott) Skep 2 > Find the Booth's Code OL Q@= Qa) & A @ QF \ tet? Booth’s code LAAN ar o11o Feet lh oeithe - Da this gg Booth’ S algosithm se guites L subbsaction and 1 addition Step 2!> mx Boolh's Code tooo! x 10-7! . : Oo oti ‘ | 0 00 000% : 10 001xx tt tf oto! | =p Result ee 5 lorool} lege -(arottas) 748m | Decimal equivalent of 2S Complement * es : Lia's paskiol product a) 90,7 9! => let ae pastial produc ee i). Ak AM Veord fi). Ardhmobie Shift Fight Ar @, 01! Pas bye onGreem tao i} i). A AtEm) ei ke, AS AM A\Q, 04 B). Asthmatic Shifle ¥ighE i > Qo @a,7 oor => 5). Asthmetic shift Fight Ar, a+ proceduwe to find Signed multiplication by booth's in computer | ; algetithenyo Hew. M ard @ Con be tye or ME -Isx 3 sept Me cS = 1o008 and @=+ otf -M = ats > ont) foakol, a Qs Operation + ra Q | 00000 a) ” As 7 —— 0 ) 4A + (em) fos oir ° . freery sign hb). Ashr AQ. Old ro) . L> copy S39 )) Ae Mt ) Askr AQ, 12 0011 a) “ oootl o1 )} A <—AtMsrogetlioiog tio 1 7 10100] Copy sign h). ?) Askr A, 4, Q-) 2to1g of) o ' SY | L Preduck Product “= |A@ register = 1toroots Fe 4She mulkiphess , Boeth’s ghift and Add methed Tr whic of the Fallow ing Algpsithin js cffsctent —Cempaved te a) @= aloltolo? b) qzorrrtiroev J v v a). @= olororo! i)- shit and ALA method of mulkiphicakion reguives y addbions , i). Qe arora! ; Qa. . POOR Bolk’s Cole D orga oF 0 yusL il] f . 1G Gre Bolk's algosithin Yepuses y addskions and 45 Subtrachions on : + Booth’, algosithm ig | Seowhdees ineHicient - Q@= Oltrriy oO. )- shftonk add method of mulbiplica ion” ¥eguises | © addstrons | W. Qe cOnrnrrrare Damn Booth's code Orr Hbowo pads dd y Toa 9900? Box 4 .. . . oth*s algovithn veguires addition SR 1 substyackien Tr ths case, SKE ahd add jmedhod is inefficient:- fre To Guth’ a Alporthen Sublsactions lek KE No-of N= Noof addibions then and Ned FLOATING POINT NUMBERS pred point = Numbes = . Decimal a) “rte Frechin pes: Fixed (6,2) numbess G-2 =4 bd integes pask, Range Precision. 999992 40 Range and precision ase | SeStst cked- Floating point Numbess . > Decimal - it 4 precision = 10 i), 9999+ 99 yo poecision= 10 99.9999 x 10> | Thanis case, tn hrs Casey Range ig increased , but | Precision is decreased Range 35 00004 235, —b not —p nat possible be Bepresent becouse inkeges post is fixed possible te sepsesent « prectsion is = 10" 1 P8gcisien Fs increased bye decreased.fone tol Voniorx a? hoittos #2 Tue , . ee reS + MantisSa % Base Tk is sepsesented as fellows Sign of the Biased Normalized, Mankessa Exponent Syn magnitude Fraction ; Why Nosmal:zetion ? = Te efficiently use the bibs in mankissa Ej Let the menkissa has S$ bees. ‘ +3 i). 0: OO1OOTI x 2 ——— 7 we ase Stes % Infosemat tom « Mantesso fi). Normoliz ation - 2 3 Oo: 100th > 2 x2 . a O-tooil x2 sle|m —+[s fejroonwe i types of Netmah?ation gaphest Nosmalszation « ~ Move the binety point la the left of the " te ficst 2 ftom left side +3 hey O-O0too1l x2 Explicit Nosmelizalion ates O-Loon x2 *2 = ooo x2" “NY v Mantesso - Limplicst Noxmolization + — Move the — Binagy — point be the sight of the Fisse 2 Fem left side. 3 0: odtooll X 2 | Timplicit “Netmali zation: ye 3a Tooro xX 2 * ° 1. 001o ¥2 ww. Hidden Mantissa, M. bie. Why Basing 7 =n Bg q.OTllloO x2 —— 2 Mantiss a* > x ponent 27S Complem enerent Numbess Hence we. cat fosm 35 NOE as 7k makes Cont usikg used biesed ket whese Bias = 2 Whese Floating point Conventional TEEETS4 k = No- of Bit Numbevs are Flaaking point Biased exponent - prefers Comparison Expenen€ s in & of two bypes- Numbers « = Fallow implicit 0m defaulk fs Fleating point Exphat. Numbers’: ~ Tinplictt — Nosmali zation . E cd be vepsesenk 4, of Flaating point x ponent Field « Explicit Nos mali zeit" \ Nosmalizotion « ( (oy ET ne SE .. Cas he es -5.95 0 4 b Represent 7S x2 as 4 floaling point number, Whose . e garot ys OS given below . Tk follows explicit normalization ‘ ger Convert given decimal no. te hiowyy ger 2 OEXPGE. Neimelize the number before we i the — mankesso sep 2 Find Bins and Biased Exponent’ F step MIT Represent the FR No as Ee) 2\s_- O7SK2 25 ! 6- | 12>. Osan 2 WO 4 1 »o (en 2 7ST XQ = sport x2” @. Exphest novmal; Zaki n- 3.10 -O-1orlth x 2 % 2 137 Five exponent» -Q:10N X22 eo Markessa tate @. Blas = 2 ea = = 13404 =F Biased Exponent = EF = er 64 = ¢ @ Fe Pe hog S a <4 4 4.0 -0' 4 4 9 IOx CoB = tc (cosBs), Ey:- Find the Decimal value’ of enpkeilly Newmobzed Fr poink format js 08 follows no = COBS, whose Floating Neke > Decimal value of Ex p}rcitormalized FR Numbes is Key act step t= Bras = 2 -Q. = 64 Given FPR No 's J \ ¥ s E ™ E = toottol Be Phe Dec Value oF explicit Nosmalized FP. NO IS s E- Bias = (1x om x2 F404 = Pty’ x oom *2 3 =e o-onix 2 2°portly, x2 = 28.95 x2! note pecimal Eguivaleent of implicit Nosmakzed FR No Ee Bios 2 GIS x PM x2 7 Hidden bit a _ pisedventage of Netmalization ces. Fin. @- Ta 0 Flanking point ne Mh Sa: bo ths Find the ange of Values of fhe mantissa fox the following . Min Mex Range - a, withevt 0: 00000000 O-tpryetd 0-0, te te) permalizaiol) 2 0-01 eas ° ert Ountbiyy crea) oy ke C2) os Veet INoneolizakon OF with }.00000 00 barpeti td impli ok 7 . a Wa ett 2") ee (22) ion. - ails oe | YU) t 220 ern ONPEECso ERIC sepsesented in Explicit and ionp rest Nosmalization + ey Oy can't be epresented in Gaventional FP rumber + T overcame this, we Use TEE PSY FP Mo's where 0 is Special ‘numbers = » me pyesentel aS Speciad — RumbesContains P+ B+ 23 Max Value > s ao = GN x petra 2 Fee * (2-2%) x2 FLOATING — POINT NUMBERS “ Single precision FP. No +7 "9 2 3g bits \ g 23 B bE ok 265 | es ass wre used bo vepresent Special rug Values of o£ fot FP NOS S 1 bo assy) 1 1 eo eee eee Oa jenplicit — Nosmalization « , ; a ra Values in DEEEVSY Single precision. FP No's S i Decimal value of on Tmpheitly nesmakzed + : E- Bias - no 1s (iyo tem x2 @oooI M = 00000000- . 23 Py . s I= 1a { (1) x 1 00000000 * 2° ) ey il 2S eine eich) same )e x02 ellen mee oe Values. oft SS ; 23 bits: —_— moe NH bees. ¥ - 254-137 127 \special no" w + Oe Ss Mir fae Denormilized Ne te Decimal value = (-1)S KOM x2 [TL is smaller than min value) Ge) em © —> +o Or (a0) => Nok a Aumber (wan) Bs fag fe), Fi 00 Pr oo 2 =e \ Q TEEE 754 Double precistn FP NO = Q: TE Contains pane sr = 6 bits. 52 i io : used ko ¥e present Special No's @ E20 yard E> 20NF 9¥E (ie, possible Values of & for FR ND is 1 bo a0ue } 9: Bias = ga = 1023 9. Follows implicit Notmalization «FP Nos J | Range of values in tere 754 - ~ ~ Max Vale J+ i - eth eee Ea 4G Moe el q 5a bits: E- Bras Dec value = [-1)9 xX em 2 (204g - 1023) Eby x bier Hh 2 a Sa bits = ey (1. bir®))s yr x erie (2-2 ) 2 Emin =! Manin 3)» 000 +> 7,7 0° un 1 se Dec value = CNS x nm xy SHED! i s 1= 1023 s ~lord = €1) x Hox 2 = eh ALKA Special o's !- M=o ==) +0 0r~ 0 1 @ Eso — tae i 1 — Denermalized No Te is Smaller A mio = thon min val) Dec valuc FES am aOR | | ee ee ans Sa e Mao = Saalprecisian FP pepsesenk 10 in TELE IBY Single format 7 lo, = loro, Newmalizetion ger? \ toto. + yo ee expenent * —— 1-010 x 2 paden ae fe . Mantessa dep 3 Find Bias H Biased exponent - keh eo Bias = 2d = BW t s NRF pased exponent = E = €+ Bias = 34127 = 130% E = 10000010, slep ¥ 0 TeEEE SY SP OPP i 23 0900000000000 =. 0000 ojroogooto] eo go0e 20 — SE se 8 ° = (41200009) HTEEE 75, | | Fs the decimal value of the following Single precision FP number « a). Ox HOA 00000 b). Gx FoCo0000 a). Sign Exp Mantass & olioo 0000 Ifo10.0000 C09 0000 E = 10000001 = !&%o0 Mm = 01000 00 23 bes - *# Dee value of TEEE 154 Sp FP Ne? s €- Bras * try x bem x 2 199-127 t ty? x Jeol, x % 2 IF Dvol*2o = (oi), = (S),¢ 1 i ib : . b). poo 0600 ia 6009 C000 0000 0000 0006 mM E = 09000000 M+#0 2o1c 154 if { “16 Dee value = CNX one, ¥2 m 1 “ae = Fw - 0-78 x2 Io 0000 noe | |va point rumbes Addibion % Subbraction ' 7 | ploatind lee % and y ae FP no's, given aS fy: : 2 xe RISK? and ys howe 10? fad 0) XY BM KY capa 3 + a): xry = 3-18 ¥ 10 4 164 AIO 347-1 = 3:78% Pt i +) cya to” 4 ? 2 G75 #16 Sxror + oH x10 = 9-000335 xlo” + FEM x10? Xty = 1 CHOIRS ¥ a 0: x*Y = (arsxre?) (64 x00” ) = (378x164) x10? = IS x10” Key oe BTS te 1-64 x to? 33 To BIS x wb4 4 = gate x10 Note :- Floating point numbes — 'S not asseciakive he; A,B C then (rBy+e a A+ (Bec) ove FR Number Sthe following FP Dum, By Find the ¥esult of adding Tre no. of digits in Frono is 3 47S! W3. + =I Ins => (IB. rem) +78! D+ERSI = OSI Reawes 9 3. 4 (-m. +9651) m3 4 (-103) = 100 M3 + [-t03. 49) = Vey LHS + RHS Hence FP Addibon is nok associative Also, is nak associative + \ FP Mulkiplicetionand RTL i 1 kr] cycle Eme pertecmed opesakion Tt is the elementery Mics® apesakion He dete of ane os more Registers - te takes one cycle time T. of the micsoopesartion pk oF TE is the symbolic ste pse Sentai on RTL Folk Mov Ria Re — e 3 AR ee Ry vepending micso opesation oS lastyuction’ | Conte! voit genesakes Signals - fox mov RRL 7 inzo ovk=O incr OO neo out! Ray 2 Reo, and —: Rn = RrTypes of miceo opera lions + ii: ‘ : ls cory © © Registes- Transfer micxo operation > Ey» Mov Ry By PRL yy Q: Avithmelie —_ micwoperation - | @: Legical Micso-opesation + Q- shifling Miso oesa' fon + Gg Register Transfer micso apesation += i ce ais. Mov Ris Ps i Re 8 @ —Asithmetre micro operation” a). ADP RyRy 5 RAT R TR By. MUL Ryy Ry Ga TAS RY c). TNR Ry Re RVSTRE WR by. XR RR R@ Re oO cmp & 3 ROK ; i Applications of logical micro-opesation § : | Consider KR, = ON1O HOD and Rx = VN 0000 i a): Seleckwe set perform these aperations or Hts by. Selective Compliment of ‘rR, Coevespon ding to 1's in” Ror g)- Selective cleat, i. | 4) Selective mask —> pesfosm masking on bits BER. Cosves pond ing Biogen “Rey aa) selective sek => Can he achieved by NI OR aperntion = Gen RE ONO Noa; R, = Mn ooaa Rv em Rs o1lo too wR e lb t oo¢o Wit tied Ye Selective Campliment = => Can be ockieved by using xaR Opesation « 1@az A o@a =A pork R,= Otro tao =~? © R= Httr gooo . Oe toor 1100 ¢: Selective cles + > Can “be achieved by Usis ‘od, operctan- Ohio frao trri 0600" RR 7 0000 nga RAR = 0000 1169 oo @ sete Mask [RA Re and opetetin) itt 1 R= ONO” 1100 wh we 0000 i orld 6000= @- Shit bing opesations yp logical shift right (Lahr) | a): Lagient shift 5 tagcat abst left (ushs) Avithmebic. shift Ryght (Ashe) | b) Arithmetic Shift VY : Sp Arithmetic ghift tefl (Asha) _® Cisculos shitt right (esky) ¢): Cisevlas Shi Ny crculos shift Jefe sha). O- Logical shift ight and Ascthmetic shift wight opesation;. ' Lo Th prelects’ sgn bi | Lshr 2D loo 1110 Copy the Sign bit ' rl ashr ~ te - Note > { Asht = 2°S- Complement no divided by 2 Rea. - (loot eo) a the ~fono 0100) = - 100,, Mies performing Ashe Tioo ine I fg! bat = for oo10) \o ®: Logical Shifk leFE and — Axith metic loro 100 Rite i= Ashk = It mulkiplies the Voro tro fae boy ay ~forortotod) =-8% 4, shitk left. 2's Comp M0 Abtes pesfesming asthnitre shift TefE Clot 1000 = +1%)y bP Oves oe ee ae 4 sa Ge 84x L = -16S is nok in Fange Ovesflaw ocewss- Ciscules shift sight Roe 0110 0011. ceaker a ™ [r= oe gus \ 1000 toy Bee ee flew acess - = -1ag bo tiRt by 2+Trakenction Type ft Tsuen > [role [em | f film SS What function ? vist dis he date available for function « % opcode is only th opetands! Can be Ost ty3e--: one cae ' d 9° Mov Ry & ee UN Opcode 2 Operands Tastructions Based on Optede ¢- QO- Data Transfer Tnstructions - .@- Data — Manipulation Tashuction’ + ®- Program Transfes Inshuctions. °; 7 a IF stece. Content of memory, location at addvess 4O4 (hon) = X ie, 3S i rks #® Note i> = Data Fransfes Tnstructions = copy a hed a): Mo mek i Mov & F404) 5 { & <— mon), ; hey 8 <— Ss \ |e). Mov 40S), Ra; + m( 0S) <— R £109 otto ; a). LOAD —p Date Transtes from Memosy to Regis ter- R, <— lon) ies Rye 35 34 Fy> LOAD R,, (Hon) 5 { toutA} STORE —b Pala Transfer from Register to Memosy. miwos ) <—'Rs f° STORE [40S), Ry 5 pata menipulation — Tasthuctions f+ gy AOR Rie Ra 5 R, —— Rae y ADP Ry (Hon) 3 Ry H— A+ (How) 9 INR RG Ri <— R41 yy TNR (yor) 3 (4or) <— (4a) + program Tansey Tastsuctions —> TMP, CALL, RET Tastructiens - TMP 9 PC => oo Dy “> Mor no ‘ Mon Ty IMP uso X Hoa, r Fe 4so { Boas a Le: ; The inshowctions executed owe Ty Ty, 73, Dyer Degg * Conditional FMP > @ i SBijump iF Conty - " @. Ne jump ik, nocovey True False ‘ > Cy = © 3 , y ° » i Twop Cyt? =!Ey- pe-r Hoos q, ‘ ree Mor Te aye | Pee = a Thyed | Ts, hey The instouckions executed axe? TyyTyy Tsp Tove Tar CALL fe RET I ‘ i RET is USE -p cai, is used to Call Subsoukine - and bo yekurn fom Subsoukine « Main progsam Main progtam | i multiply buoy | foRE nts “ERR ; > | : CALL MULT Main ragyeen vag, Subssouting « Bo - re — : 3 c Hoo qT, on seep > t “7 gas ve . : “eal a -=-> Yor + Tz Cart ube < : PE 7 Hox Ty ' sae ao : : RET oddr pushed into: ; ‘ (Stack memesy :_ cate instsuction f= | ghep glack mem 2—— PC= hat : . ; hep 2 pe <— 450 pet ' \ : po <— latest Flack memosy he; PC <——~ hod. Insteuctions based on Operands Q Three Addvess — inshvuctions «Fy 00 Ry cPysBa du ™ Sop Ryw By @O: Two Addsess instouctionS - Eg ADP Rs Ri 5 RRR @- One Addwess InstrickienS - £5 ADb R, 5 Act wee Ry Add volyes in the hop of zero Addsess _irstruckions,- Eg ADP j The -segistes Stack. @. RISC Type + (Reduced, Trsteackion Sek Computes) = Ey: (i). Fae memory, Access —p use Lead and Steve Tastuetions - one or Zeso Add-sess Ih). For other operation -p use Tee, kwo f 5 insheuctions - exp session ‘evaluate the following by: Tuo ddvess’ instructions - Waite a — psogsary be using a) “Tree ‘Aldsess instsuctions ¢). one Adavess ingtsuctions 4)» Zeso Addses's instiubions + y= 2a ‘ f CHD KE ee } whese Ay By Cr 9181 * Niaiab les In memety-4S0 Addaess Bus} "st Hse 453 MSY 4K) @)- Thee Addvess — instructions 2 bb): SUB OR, A,B 3) Ry ——avB MuL Ry BSE 5 Ry <—— DE ADD Renna { Re RHC Re <— DHE HC DIN Xa Ry Re GFK AT RR, Rey Xe A C+DRE Tuo Addsess instsuctions + Mov 8), A 3 Ri <——A Ae: eR R-B _ SUB R,,B 3 { Re AnB Mov Ry, E 5 R,<—E MUL RD 5 R,<— AR, &D R, — ExOD ADD RC 9 { Ri. <— Rae Ry 4— EXD + DIN RAR Aer cay Xy hry eR, r MO e) Load E y ACC ¢ E mvt D5 con ee lo ace <— ERD Avo ci {as ee ACC &— Edd te STORE T 3 {re oe LoAD A; ACC e—A Sue By {use Ace 4— A-B DN Tx { Ace e— Ace +7 using One | Addvess instauctiens « Ace <— (&B) + [crDkE) STORE %-} 3 4% ace aya SUsing | | Zero we need ii), Convert ¥ Talk” Niababien, {post fix) notation - Tntix © i). A+B KC —_ —> ko use Push, PoP be Addvess — instsuctions» inshouctions - © pevesse Polish nekation 1 od ‘ Revesse polish nekation - t+ push A ABC —P push ® Sw push ¢ MuL AbD AB™ c* —p push A Push 6 MuL Push © ADO +I polish Nekelion. Shep = Convert Infix bo Revesse ‘s #+/ A-B ————>_ AB CDE — ww Cr eE ; Step rs push A ; pusn B , sus Push C Push D Push E 2 : MuL ADD DN _! Pop x beg Steck Reg stack r / z Re “ B DRE [Rey Bw Rex, c Rew AURA) | te A-B pegoes Fosmat {> gare a ey! y—— ¢ bite —__-y Gan ba bits ubiks with 2 bits, We Can have 4 One Addsess Insteuctions . Lp one Addvess Taste + hey OO AXRX 01 XXAX —P one Addsess Taste + 10 KXXX —h one Addyess Instr 3 No RRR LP ane Address Thstr 4 ee kK shits TI, Troteuction 3 hits. hooqo x 3 Lh one Addgess Instsuctions- with 2 bits, we Can have Lek 00 —3/ADD~ Lek 000 —p Re Oor eR —p, sub : O19 pi RE lo —P> Mu : tr xOR th Rp 00000 —P ADD Po 16000 —p yMuL Re 00001 —p AOD R, tooo + —b. MUL R,. oot —P ADD Re tore, —p Mut Ra Froge —B XOR R, ' 01000 -—b SUB Re ot 3 'y00 1 —> j 0100} —b sug Rk, . MOR Ry —b KOR Re ; Ovth Ay <> SUB Ry tinkerTalal Numbes of Tisteuckons ee \ Given Tstruekon length = § bibs «! Thos . Nos ef instuctons = Tashtuctens: Methed 25 Using 2 bik Opcade =>) we have pha y one Address insheuction Then » No-of Fnstsuctons 4x " YAR = 32 Trstractions opcode Expanding ca) Given , TE has 3-0ne Addvess instouctions enly ! ‘\—— 1 5 bits hj Thsteucten ? [epcoke_| P55 yhiks 3 biks: Lee | 00 —p ADD 5 yee Cok Re oor —P. Ry | or —p sua, . i yo —b: MUL. 9 00000 —P ADD Re 0000+

, ge (343) =2 Bbits SbiES Gwen’ ine of 'Fegiskess |= 8 Thus nosot biES im Add = 2°28 4 ns3 bes pe add+ess * we steh a, Za rv x2 ede Nn We tla N F = 4S (Ne-ef Zeve Addyves$ instr) + a5¢ = ae ase Q08has lg bes instsuelion Hak Suppext Zeno ad dsess 5 bits instucho ns « (@): A Sys ter addsess . ane addness and we field site 8 of bor ik as designed Assume each address pddvess, Hoo ane addres fox Suppesting o number ot zero addsess - | The man numbers | j—_——_¢ bibs. —— i [oie [ atin [aus | I-12 Chis 7, SbIES Sbiks « a = fox anos + too xa +N atc ken 2S atone AE 2 oe . 7 rts ous [tex 32 x4eo } ene) Qou8 is, 16% 3a, v ia : we ab [acre] = NFL Zere addy instr with 25 bits (B+ A Aigikel computes hos a memegy ant FE 7 1 pes word The “inshguckien Set Congasts of 285 Aiffesent | opesations + AML inshyuctians ‘have an(-apewation Cede pave ach instwuctfon 78 (op coke) and an addsess pesky > Sore in one Wed» memes y., me Je, ‘id CG) How many bits | aver Keserved foro persation code. th). Bab de acthe— me Hel mary Bis ase left fer the * x addsess part of the — inshyuchon, , 1i) Wht ie The | maximus SI 7C tog the memody. gel Tastruclion length = <1 wesd = 28 bits \——— > bits. ———___> * Pe [mos | ! Bhsts 2b-8 = 20 biks- % dee n= no-of bits in. opcode - ) Then cheese m, Sich that 2” 2235 : 1 ¢ neh bits. i). No-ef BES in opeode = 8 ii) wos ot BiES fon odduess poxt = de bits- (i)- max Size cf — memosy. 28 dabelines 1 | consider a BE machine hove on nshuetion Faro Rake) iS Stosed oF memory “Tacotie nm 200 4K {in Rexa) Wheat wilt be value of TR al pe | while dhe instr is fached Ond —execoted. Considers indrurdual instsuction i$ | 3Q-BiE . a)- Tr = ADD R Ry , PC = LOOkKH by); DR = LOO4HH 4 PC = ADDR VRE €). TR = ADD RB Rey PC = woo A)- TR = d008 Hy PC = ADD Ri eh| re pes ret © Loon b aoe) ie ce). TR? ADD Risky PC = 2008), @- Mee exeeatig He euvehian ABO RE Ris HR) find Ry Value Gen Rr = ETRL = 108 i Solis ADD Ry Ry RL) Ry a— Rt (wR) | hey Rye —— Ft (aatee) Re 6+ (tex) be ct aber R, red -tt is the method of Specifying the operand in an instsuction + ' ofl operand eet (Adduess, 4) EHlective Addvess fea) 7 Dinem 7? Tastruction => p Trnmediale dele ? qe is the addeess of the operord Dees of — Addsessing i Medes pddsess, A (ererand) = Register cE peer Ra rs Made + Register Addsessing movT.R, 88 pp Alreas, Az Tronediate f ne Se value MVI Ry 2S % Tmmediate Addsessing Mode Disect Addvessing Mede adizect Addvessing Mede « Reg Tadvvect Addeesiing Made « 0 0 6 @ ® @- Auko Trerement Addeesstig Mode @- Auko Decrement Addvessing Mede- @- — Relakive Addsessing mode « @. Tadexed Addessing rode. ® Base Registes Addsessing mode - @> Tieprest (unplied) Addvessing mete f Q@ dweck Addvessing mode :- Trstuckion => forse | Addsess, A hese BA = Addvess 4nemety \ he ENENSO L. |_| | bese | i optede 4So i : and 4S6 opevand = (2A) he | @. Todiceck Addsessing mode. | va ofa ee ettectne Ad dees | Here Addy A gives ce adasess | of | ; | Fy | ofcede | «so | | Pore yes bee) Ceo and 7 | operand = (Coo) = 5 1 | LA oped iindivect Addse SSiNg G- Pagistex Addsess A Ceperan dD opted Register Assay Mede : Ry Memes Addsess A Specified a ¥egisker bes BAS (Q) = Fee Nalue of Re operand = (Foe) = 25- Bye Leb Riz 2004 Ry 2300 Ry > He * Mov R,@Re ~ > Reg: indisect Addr > R= mode (or) ® Mov R,, (Re) => R= tS B.A which Contains the ° toa |@ Aube Increment Addse ssing Mode = sep = Register Tadivect Addy inode» ket ge Re ecm Os tl () (sr) <——aA Gi). gr Coste) @. Ake decrement Addsessing Mode . W- pee decrement of Rey ie Rye RI W). Rey Tadiveck Addr Mode Be; Baa [R&e1) = Feo -F 6n OpesendelEA) = (649) = at Eg> pop * @- Relative Addsessing “Mode :- Computable cer) ¥ J C) Tndexed Addvessigg” Meee Dis placement byec base Reg Aaddvessing Mode Addr mode « @. Pc Relative Addis essing Mode !- Addgess A (operand) Trstruckion =} opcode EA = PC + Addsess.A6 * USed in Branching instsuctions « d Po —» Yoo > Ty ees Hot fo me } — replace absalute ite TP Marys Fat, Timp addvess, with TTP MOS fe Dy offset. lt EAs pe + Adduss,A of dump F = 434+: EA = Kio ; Fw called offset. X oftsee can be 4ve, or -Ve- ® Hewe pe = 403; Traget Addsess'= yid) then offsek = Thaget Aldsess = pe 2 nie 403) = Tadexed Addvessing Mode v! Thrshuckion =? Index”, Regiskes (| EA = XR + Addyess, A USed in Asvay processing « 4~ Avsoy of erage “p> Base Addness of Awtay ~ Ly Adilscs5 A 16) wo = 100 a Baas #1 wor = ha ef D offsel xR. We \4or = Yoo +2 | Wo = yoo +3 aoe ‘oo + 4 — 24 _|wes = yoo + § i fuss hoot $9 R Address A= 4EO> Tpitial value xR = 0 % xR <— MRA a 6) gr and OF Reg in Yo RE MP & Disadvantage of indexed Adds essing mode: - Tk is net Suitable fer ao pregeoeny Relocation” (-/ whenever 98 Changes dhe Address of the Av¥ay —P WE have be change Aldsess, A of Tastsuc tion according ly [hrs 18 undesiseble)} : (9 - Base Registers Adder essing Mode im Wantks be access morks for a pasticuley Trstsuckson “=> } opcode Addwess, A Student f (opesand EA = hoot 4 = 404 Bee ee t Address, A Register % Base Addr is in Base Regiskess fi 3and | & Alvorbage | 7 afluk is in Addr, A af the jastsuction- af Bese — Registes Addsessieg ee Addeess of the arrug, it tuhenever 05 Cheng’ the is enough te chonge He le ae Register he; Ths Adaessing mede jg suitable fer psoysory Relocetion - &y- 20%6 UP px Rey js baken 08 Bose Registers» /@- Limp tcit Addsessing Mode - oiler. (Implied Adds Sing Mede) - & opesands ase Implied i). EMA =p Compliment Accontnteres ji), (RAL, —p Retole Accumulator Ls otk. | (ii) ome Be Compliment — Covsay + \] Ey" Mov R, (Yoo) —p Diseck Addyessing mode. R,y@R_ —> Mov Ril Re) > Regiskes in doseck i Addy > Modee Mov Mov &,@4oo —p Tndiveck Addr Mode, Mov fi, 4k Yoo > Tnmediate Addr - Mode.| onal oO Censider a RISC Machine Where pradly 4 cach inSttuction FS and uncondibional b¥anch with offset the brsonch bytes lang Conds Fo nal instouction USE PC telative addressing mode be the beeggel location of gpecrficd in bytes wire k the oddress jpstnuction - Furthes the of fsek FS always of the newt Melauclan) pine thepe hoo ay Segmence - Add PLRy Ry Sub Psy Be Rr Corp Rasy 1 Re TH he bevggee of the bsanch nchyvelcen i iy hen the i ee (aye by ede ay BS. if ADD -RyaRasRy itd Sua Rs1Re, Ry jer > OMe Ry Ray Rae 143 beg Ris otfsek ope it : . | otter = Toagel Addwess 7" "PE 5 i - (4s) 2-4 Tastouction ss But given insteuction length = 1 Bykes- of fsck in Byte =AMS be 4 pt Given PO = ace Low Load AC R= yoo dot Sa wa # 180: * ded, Neat instivetien RO Se hoo 700 - Seo ees ” [Gee Goo Pol aus oO 300 or OT . Soly eC 4 ae : 1 ashen a PC = 200 S00 aio td psd >>>! L ext Tashvetien | 202 xR =— loo RS Xoo uUSo 34 es toe 5 Lead Ace, Soo Lead Act, Soo A \ als a ba}, Ace @ Register Addy made]; ty Leek ARTES ® Immediate "Ace = Hoo (8) Direct O mie | [Load Acc @ Sos f Seo) = S00 thr) = hoo ja ee :.% Mevt Ace, Soo Ace = Foo ACC = Gee) = 30 Accaf oo) = Foo ACC{Yeo) = Feenan ecren a puto Decrement | ERy-1) = 3ay ace = (399) = 480 io relative rey Addsess, A padsessing 2a ace = (702) 2 388 . 5 rae aa: og + oo = Qed ®: xR + Addr A Accs (ee) = 40 AMGES SOS Mode too +500 = 6e6 Bose segistes |= Bose Register + ace = (900) > S¥0 Addsessing Mode Addsess, A = Yoot Sm= 00 machine instsuc hon @: Corsides a theec wosd aoe A(R), GB with Re indexed addressing me de uses indisect addsess ¥Sding at The fivst opesand uses The Second opesand as index vregistes - memoty addsessirs mode A ard & the second & hid pecities the opCode sespeckvely. The faust wosd of Find the no- of memory uso ds insisucton — $| te execute the jasbsvetion 1S cyles veguived a) FF a) 3 b) 4 9 £6 0- cycle Time taken fos one — micto opet 1 2 3 ' ’ Ke Cycle Time 9 Tv crv pesfosmance — measuses time Ti alion « and clk Fey uency fie + tL @ cycles per jaskudtion (cPE) '- 1 2 3 om DOS ef \ '<— Time taken to execute on ——? instsuction : fe; CPI = 3 K Time taken be execute an = CPI X Cycle kime. instru chien = 3axu = 3t ©. Ereeskion Time 27) of 0 PRI Bs Tastrs , Cycles , Set ets Se Presi Tash Cycles “ET s See. whese crx = 5 (zc, * cP) Progfam wg a ; je Ee Fgi- Tastsuckon cP ee SuB RyRy ——> & Mu Ryko —— z Lead Ri(Ro —p 8ayer ‘on Tnsteuctrons pet second ) Nos of instr: Executed _ Nov of insir-f « O- mies (m Hen © Amdehis law = 5 a post Ere strane cetidur Mockievelia tyne ge) tell een of a Computes: 1 BS Ns sh es ey Fraction eahanced _Feseltan erences” f- Fraction \ 4 caked Speedlp «rod program . a | $0 86 up | when ie is impagved 4 Tk bkes . ® Let AFP Asthmetic mote times . has becme “to Limes faster «Y. 6. the overall overall Speed up = 16S @ * pregsam FS Punning on 4 machine with — the fallowing posamelers: Fad Total execution Lime. Aumber cf instructien executed = So, 000, 000 ANSE CPI es He preytam = © 27 cpu Clock gem 2 eee cice eT eT e fe agnz =) T= $ = OSNs- = Cx CPE ay x CT) ET = Soxio6 x 27 x 05416" . , 6Dy = (Sox oF xoS) x10 7 ET = 67-Sx10% = CFS ms. i Find CPlouy and mipS if clock yake iS 19-6 GHZ-) 4 P apees ot Teal SEND cr Gunk Oo 5 ck jnstwuctions oF cycles - Load] steve, S23 ho ALU u xo Branchiog ~ | 6 to othes $s 3o A a i| a ee fe Ie nz i ~ 4 crr S ’ ye Gers) a a = (oxs) + [toxn) t {rox e Yor tot 10 t 30 - Leo evo Co t1S0 loo = Me 2 yg 10. 4 ®- mes = f 2 1s ‘ CPT, *10% Hp Rter = 1 y oO 2 eat? myheoe milion Tastiechient See- ®): Progsary A on processor | Progam A on psocessey 2 CcT eins) (eT = 0.914 05) Te = leooo Tc =12000 Frockien Br i L]S 7ALV = 20:4o!tg) Frocten Br: Ls: ALY =2S* Soras| rares | CPr Brebis:ausStacns . cP) Brits: ALU = ‘ : i malls . gel Bxecueion Time (er), | Te RCE layy % cy; 3 . } hee | crt = BEG Crs | Ay. jer | Tez { ~ » {| (Rexs) + (Yox 2) 4 [¥oxrs) Qeryo + to 5 = wortorso gy laosloooo X 24K NXIO wets = eu xis = gy us keh * gxccubion Tre (ET) 2 LG CPT ayy ™ a, oe . : (en) 2 tReag X BIAS % OTK NT (en) = RCVIS xo = RE MS: pocessor 2 bakes mose time than — psocesser sabe etecute pregsom A on psccesSer 4. Tros ik is belken be (A executes a program wilh average” CPI a (with same TSA and betles © He Same peagyeam with 27. @ # Meshing gh 23 - An other Machine Compiley) That executes less instwctions and. with 4 ce) oof TF ak 2 QHZ ; was a clock wke of A Se that He two what shuld be te machines Haves! Same — peetormance -{: ct | 1 |! ET] = sel x CPlay Depends on Te Program used, Compilers Trstuckion Seb, Architecture (254) or pgm used, Compiler, TSA and Computer osganiZarien on (zt) VLST Technology used: @> ww and Datepath = | pasallel Binasy Adder she A= ABNER = ~ & = Bs 8.8.5: ; As Bs oe a A Be | “ - a 4 & 3. Fae |e—— FAI : FAn Ke i - Se 3 Se \ | .a SE OE ORS allel Binasy — subbmctes hy AL Be n, 8, . Su s A-B = AtL'SCemp of B- = At p's Complencat of & +! A+ BrtFonetion lagical Oo. 0 Ont i) r ' ° 0 o a crseuit op = A+B 4(C=0) > Add olp = At Bs (cer!) > Add with * Cassys Ofp= A+ B+ (cero) <> Sub with Batten mare a b-B)7! aw : 1 => AB olp = A+B a (Gt) = AtB+ > su —” } Avorn [7s pA > Decrement A- 10001) i A+ ttm!) = A¥0000FA € > branstes of A beansfer of A A+o00+t0 DAS Trcrement A A+ 0000 #4 9 Aryght ting Citeuik t f | hit #9 / shih left wv ! | Ta AS MA Ay Ay Ao Te | = ' Tr Aa Ay AY Ay Ao a ee ae ‘a Ye a ” G20 => Shift wight Be ee AW Aithmelic ciseusk A GABSelected civeusk Arithmelic Cixcuit logic civeutt Shite right shift Tete! S, Sy 8 3 ; > 2 SA fe output F 0000 °'0 * - A+B 06010 Cl | AtBr! o1o9 | LAW 8 ene * AWB ro xO Shatt -rght a “t e shitt left - ; b \ k 7 Dokapedh i TES the set of Functiona) units and ¢ ae i thei ines connections where all acompubotions ase Cossied out ee ' I , F Functional suniks Consists of L > @- aul br) mmulbip ees MOUS @: Registers « | @ Buses © / *® CPU = Dotopath + Conta) unit:a a - x cnlapath of Mulliphention hy the Rereabitive ) — f ger pee 43 —pb mulbipher molkiplicand pastiol produck p =o +8 3 —bB-172 st 1e-—pt a! +t P=2y —by-1=0 seep 2° Flow chaxt - Exit+ Lek A = Mulbiplicand, 8 = Mulkipliey > Addi—> | _, decd 8 3, eqz Data rm Step 4 — Contse) unit Ts ez? | @- Consides The following deka path of ac fu- the Bus and ah the segiskevs » in the data ase of Tre ALU jdentical size+ All apevatsons including incrementakion of tre PC and the GPRS one Cessied cut in the Aru. Too clock ytles awe needed fer Memory read apesatien. the tits) one far — leoding s addeess in the MAR and the ent ore fas loading data, fsom the memoty bus FeDT aa er ee Wee eee a). The insteuckon = ADD Rey Ry has the wegistes boon she interpretation fye— het Ry The min nes of Clck cycles needed fos executin Cycle af this inslsuction fs yee v)3 a) 4 w) S- yw. Tre instruction (call Ray Sub" is kwo instsuction « pssuning thet PE 1% incremented dusing the fetch cycle ch the tivst word gf the fashuction, tks registes transter Invespielolion YS Ree POAT roa Mpc} \ ; ARE mine nes of cou Chek Cycles needed dusing the execakion Cycle of TNs iastsuckon 1S - 0). Mem Read opctation LN Ty i MAR &—— PC Glock gycle ot, Toi oT <—R,