0% found this document useful (0 votes)
4 views

21EC52_assignment_part2

The document discusses memory architecture, focusing on the connections between memory cells, address decoding, and data input/output processes. It describes various types of cache memory, including direct-mapped and set-associative caches, explaining their efficiency in data retrieval. Additionally, it outlines the classification of memory structures based on speed, size, and cost.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
4 views

21EC52_assignment_part2

The document discusses memory architecture, focusing on the connections between memory cells, address decoding, and data input/output processes. It describes various types of cache memory, including direct-mapped and set-associative caches, explaining their efficiency in data retrieval. Additionally, it outlines the classification of memory structures based on speed, size, and cost.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 9
af feb / Man 20.22 = mi : =a ___ Fach wow of celle _ceosttiukes a memomy come .andalt celle of @ HW axe connecttd +o a common cline referred toas the , —_wosd bine, oshich fs driven by +e address decode, on the chip L ——The Cells vin each coliimo ane connected +o | ~—0_sense/yrike Gxatit by, two bit lines. The sense/unite circuits f ~~ Stonnected _fn_the data —unput/oubpuk Jats of the chip. > Dwung. A_Rendl_oppiation these cireuits sense ot_siad.fie | 2 ae Figura shows evemmony. tes Prigen unde of || eats each .tms is refered asa _léx8 erganigstion 0 The data tnput and “the —daba output ofeach —sense/usefe | thrult au connected —to-a_singte —bidérechional_—daka ding | that can be cormected to the _data bus ofa —Compaks. Tvs onhol tines , A/a and ¢$ eve provided_to_additfon ——Laddress_ and data tines. The R/t (eead er eee reused te operation, and the ¢& COntp selec) — input sitecks a given chip in 9_enathi chip _smemmamie stem” eee _ a‘ aaa ' 1 Tama = a Team a _|_we l I we eam =H rt Addsss| vot id, I 1 af ft a pects al roy) i j 2 ‘ a aa te «tae af 5 [ei ‘The memany. Circuit. in the figure S=8 slows 1a external connecMons -for address data and conteol tines and tw dines fer ae st gd meet E sasbad 4 x0 Bom [os masks] . 2 im mst ei nha fe nig ton for Rom cell. A log. H value 0 15 stored sin oN if the transistor is connedtd to + ound ak paint P; ovuawise aa stored. he bit tine 46 Fence ih ns a fa - Supply To ead fe ___slale of the cell 5 the cnard 1 Suated . “Thus , the if assy: imacitin Auf a ae Sy Mine Sf Hheae ts a connection Lehoeen the | raaststere _TE_sthure is na connedtion te ground, ~ eal the bit ene yemains aot high voltag indicating. 4. a 4 ____sense_cine of the bit lene ceive pepe pia value . Data ore wiilten &ioto a Rom ushen — —_| tt 1¢ mani fae ar || Awne/suty 2083 Fay! Define Gache_merna ‘diaasam: [3 mauks] ; Cosh pte reac dean “memony. exbich Jig oP of dala _ Tache memon Explain vu 1D {PEN Nain MEMOTY « || _Stores dato. cae Frequently accessed by Ye pnovessog _Gaoche_ _memory, will provide preset precessen with Aecenka uned_ data/ roshuchons -fer ree exeuhon . ea ee a ‘ous types with neak Process oh Cache _| eae | Memory Us of a eba cache memory _ a | ethene ae three, types of cache masini based 6a mopping. behween een emet f cache mre e mapped cache bastocialfd_sel-asseciabive-magoed tke @oixcct mapped cache os igs Jte-this technique, block j_of the rain _rmemonj._rnengs Jemedule 388 of the cache..as shown below - “Cache | sel iene memory ei ee aa 8 Ieee] iee) [eee Ie se 5 | Cert ete | Da Block 12 yi Bode 128 L Glodket2g S ee: pepped cache sty ude se Can_be placed KO Oni Cache blode, Hide positions 12 og ts a siqutred t tdenify @_emony ie ie DoD + Sa Malo mem Ws ee ee EE ei ela ta Cathe Blode o oer Blouct. T Glace Ts Zz t peo: | RBloue 1 or Lo Zan De os | as ie y L Blouct | Blode 12H ete [5 soe Blocte 4025+ an 4 |. Maio memeny addres block when th Jo fusidenk cin toe cache. the tag. bits ofan address received from the processes’ aie compared tothe tog. bits of eath blak of the e cache to see If the. destaed — block_1s_jresenb. this is_called acsoda tive -magp technique Tt ~ gives Complete freedom in choosing. the cache Location fo. saith ~ which to_place the memory, block. Thus, the space un the cache can_be_used more efficiently, A new block that has tobe _ brought into the ache has to replace (eject) an extting. block (Set ~assaciative mapped cache 2 Se pair thths soanciecmstey kasi ae smsppinee Hechnique. Gloks of the cache ans ggoupesh doko seks Gnd the mapping allows a block of the rao me — {roar side in block of a specific ser. Hence Potten _frchlem of the direc rocthod is _easeal Daa Wrandg a few choices fer bled placement. AY the, Check. (placeme) S + Game time, the hardware cost te creditcec\_by_dlecrendiog the _sige of the associative search Gelovo —.@eample of _set-associah've ‘fmepped cache, Main Memory 5 — [Biocto i Block 4 +} aah ie 2 Glock 6 ae Glock 4 iatiais a | Blade 63 i Block 64 Block 65” por waite a_note_on_classificliao of memory shruchmnea [Aner], Ftgune shows the dassifieahen of memanj- simchuse_af comp ale 2 pA ABE ob ane | asic ee ee gps | Processes. _| Tocxcasiog tncscasing- ——f sige. Speed “cost perbit 1 ‘ 4 i es 4 abe Peo ea m1 ae a : 4 Secondary Cache 12 1 ae arn | : is Magneic aise -— 4 3 Secondary menor ‘| Pae a | slower. than cache ipernea | Dick '- huge amount of inexpensive storage. . Vk : I Compared wily main CSTE

You might also like