Memory Hierarchy cess ime (Inereasing) bytes Storege lincreasing) Flash drive.usb TB > Magnetic Tapes, PBRegister - It is the fastest and closest to the CPU. It stores very less data. cache Memory- It is faster than Ram or main memory but slower than registers. it store. more data as compared to registers. (SRAM) Main Memory (DRAM) - The memory that communicates directly with the CPU is called main memory Auxiliary Memory - Devices that provide backup storage are called auxiliary memory. For Example - magnetic diskes and tapes. Virtual Memory- It is a concept that helps us to use main memory more efficiently. It is used in large computer system that pernit the user to construct programs as though a large memory space wew available, equal to the totality of auxiliary memory.Main Memory The main memory is the central storage unit in a computer system. It is used to store programs and data during the computer operation. The Principal technology used for main memory is based on semiconductors integrated circuits. RAM Chips are avilable in two possible operating modes, Static and dynamic. ARAM chip is better suited for communicating with the CPU if it has one or more control inputs that select the chip when needed. Another common feature is a bidirectional bus that allows the transfer of data from memory to CPU during read operation, or from CPU to memory during write operation. A Bidirectional Bus can be constructed with a Three State Buffer.Chip Select 1 —— Chip Select 2 —— Read Write &, RD WR — 7 Bit Address | PD 128X8 RAM <— RAM 8 Bit Bidirectional Data BusChip Select 1 Ic 5 J Chip Select 2 —j == CS, -612x8 8 Bit Data Bus 9 Bit Address + Ps M DaShe west common snilary rénory vis oa ere maguche diy Sel pet + Beas time: rye ewerage Aime vepired to r00ch ¢ a stosap Location Py nemary and bain ie erly “a eollik) = the acetee Hine ‘ + Im tectremachenical davies, with moving ports ¢ Sch ot dike ond Hepes, He eeseer ne onlay of a ok hme rewired ty postin the rend—urite Band + = becakion and a trot fer time reid & Wee he dae fon he cli Sh amr d ha spaeifich —runmbin of Chawactors oe ool prpprrerpere Auxilary Memory Padh Lo AESE HI Kutto Sab kuch typed nhi milegaj 2 + trewony Siam oye at op Hysieal wire Virtual Memory 2s | : (al semong] a: + viwteal memeny 4 9 covenpt gal te sone : | lege emmpater cuties Hat permit ea ular be : Gateat programs os thugh = Aan timerg ; sre om eat al el o e * cremeny si im a ttt Sdven sddnee end_ntmey_ spn evi tir © usin of table it tala be mah Fs cok bree oad da vefereneed by He CPU goes Pate eg nie mag Ke stove a nets Heong am adver mapping fem virtual adhe, TT ai mening, © wo ton Plgsical ddrebe mau emery oT TS tl HS parm Padh Lo pee ins | AESE HI Dr Paysicnl Mare A. advert jim monn womeny Kutto called a plysital adders / es. ot rhe sat of virtual adresses Sab kuch typed nhi 2 i elled saver cpace mile a 2 + manor See: sue cat of phycieal olérem g 0 ee eeie We) Weekes Page “Tahle age (rap Tobe Papel enon LO cok eg am inden inte fede akidh contains base MPA Pend, Fee De phgsien memory. + pate OFFA Combinah vite ve allnate te five, Jot ented) a pigeeal emery event Gat we memeey ol epee eile ia ett ae main z : i one sromarg: 2h totais bie t vohoe, eae tHE ig stl ioe. Kumiliow, ce a de faked Meg: wt Replaiineente peer Tae of TH West Commer PME Teplactmat” gosto ae, ME fgt i Brats eot (FIFO) Ae REND weontly wes CLD Lp ite wae’ golds ta eye that teas bate te Somey toa longest Hime FLAY tue least reson tly tenia OM Pape 1a "yemovelPadh Lo AESE HI Kutto Sab kuch typed nhi milega - Saeed) “Twe Final poge size Segmentation waxed in the. Virtual memows. system Gane, corinc o 2 tein tht B elt with — respi +2 Progrom size ant log “4 legi veld dime Lis oxy aa ; maser tit with a acne ee coat of caqwmentS ave % cubvoutine 5 dates a teble of symbols, eps PEP PheooeAssociative Memory SIRT SAGAR INST 'TUTE OF RESEARCH AND TECHNOLOGY, BHOPAL. MN SCIENCE AND ENGINEERING bhopalac.inAssociative Memory Video link -ht (9 youtu.be/bpipcaLotRw Hatch eagerCache memory and it's mapping technique The fundamental idea of cache organization is that by keeping the most frequently accessed instruction abd data in the fast cache memory, the average memory access time will approach the access time of the cache. When the CPU needs to access memory, the cache is examined. If the word is found in the cache, it is read from fast cache memory. If the word addressed by the CPU is not found in the cache, the main memory is accesed to read the word. Hit Ratio :- It is the qauntity that is frequently used to check performance of memory. when the CPU refers to memory and find the word in cache, it is said to be hit. If itis not found in memory, then it is said to be miss. The ratio of the number of hits divided by total number of CPU references to memory is the hit ratio. miss ratio (opposite of hit ratio)The Transfer of data from main memory to cache memory is referred to as mapping process. Types of Mapping Technique:- Associative mapping Direct mapping Set-Associative mapping Main Memory 32K X 12 cache Memory 12x 12Associative Mapping The associative mapping uses an associative memory. It stores the data and address of memory word. This permits any location in cache to store any word from main memory. cp addvere CIS bits) [Regement_vequter] ee LELEGLbEELELI ACPU address of 15 bit is placed in the argument register and the associative memory is searched for a match. If the address is found, the corresponding 12 Bit data is read and sent to the CPU. If No match occurs, the main memory is accessed.Direct Mapping Associative memories are expensive as compared to RAM because of the added logic. In Direct mapping cache organization, the n-bit address is used to access the main memory and k- bit index to access the cache.Se Se OO a o st -emociative Mapping: . . Tat is em improvement over the svect - mapping \ ovgowitakn in that aach word of cada On store twp px mere Words of momory under Yao seme Prin addray. | P sEacdh dala werd a stored. together with its pop Te snuimlber of tog — dota itemg dm One Word of yade 4 sad te fon So sek: b , +» qpndrah, a sot-omoutative cathe of sot Size i ttl accommodate K words of Moin wntanony Yam aada wel f coche - wee ¥ Inte Te A ote Teg Datalink :- https://www.gatevidyalay.com/tag/2-way-set-associative-mapping/ Problem no 3 2-way set associative implementation dekhlena ek bari Compare a 2-way cache set ‘Address (m bits) associative cache witha = L_es_[ woe To sict fully-associative cache? ined Number of sets in Only 2 comparators needed cache Cache tags are a little = Number of lines in shorter too cache / Set size Hie ... deciding replacement?