\ Unit - 3 Teo P E pe. = i a as | ; [Oe Memory _Hievarchy _ Hieverchy Pag — fiadeaaah Htese ar Bytes & Regi sted covtins 4 Ban si re ee Tntemal ce i Cache Memory \dons ) 7 Stak re RAM o Gey / Main Memory Pdoonw > Primary Memory he Dynamic RAM vr 2 Tasek NER Fics aA MAG eesti Memory Ete k7/ Hoxd disk /Magnetic dis \40 ms) x Tape drive [Magnehc tapes 2 9 400 my > Tertiary Memory . .Fxplain — : : | ® Storage. L w® Size | _*& ® Access Time e I @ cost - 1 | © Frequency = low to High ) Level © = Register . ~=Thesent inside athe [Po. -— __- least access time = Mosh “Fipensive , Smallest in size, iS Genevally ‘10 Kiloby bes___ Memory—thip—Orgeni-zatton, oa) __—2)| Levelt = Cache. — en Tisitsed to Se atom pas ee ly accessed = ae is expensive _ond_smallege eee Be —__-=-Generally Soe aS a 3) level 2 = Side Ee gin memory ie = Te diveeHy with the CPU 2 with aunlian, EMail through 9n r/o. processor. =_less Expensive then Cache Letger_in size in Gé : BS Ee oa a fF 2%» Lev = d = They axe magnetic Disk : : Lor,=| Vv it : @ Meme —¢ Chip — Orgeniaec an Baie We = Memory cell 1S Capable af Storing d- bit -of OD ba rceesitin, {= No. of memory cel] 0 siyeciaed in farm of taba ___e_form Chip. = Rach cau == meaty eri Ps -_EBeebAlt cell of vow conneched fo eter Ii ing —> F = Word line. Nn oddyess decodes used 4m drive Word line ogee Oo —___- These. bit connected +o dedu J/0 fines through Q ee Circuit. & read = ean tore in Cel) selecte J bt tword fine _ —and_trensrits te oie doe tins. and ; aa = i ish. © ib ea usually _xefened to_as 16x 2 organivahoneee eke Se rd te tore. praqram date which —is-cuceatty i xecuted in chu. bb eg i = This_omables CPU_to_do foster transachon = Therefore memory from cache As_candomly _ utilized for —_Faster execution. nd a = Se First checks in_cache. mons Ae iF the curren ances ~Objechve = Support CPU access With a minimum doloy. =Functoningis hidden Fram beth user 2 system prose =e is a_fast memory af much smalter size between @U_& main memory, — Cache & main de, Single momo ry Basic Princ ple \s Locatitty o€ xeFerence shich alfwss &_memocy hietorchy to deliver high performace [crue —sh coche f-—[main memory | a Wezel Block a Teonsfer “Fonsfer .qo: e | —ique ht automaically male prog d i He Yequived fox ae = Bis memory ma nagement technique vite. Secondary Memory tan cael = Tt \s common. dechintnn igeih daleenpder OS SS p= se uses bs noble computer — Beste timapentacies oY = gms eanng dale Dinine God Wile, mM i = Mapping chunks cents to disk Files pnables 4 1 Compwhes ta treat secondo. memory as though 1 wore main TUN aT + + Pyare | Wictuod Manor | = — + | ae zl Anstha || g Pracesor's T Wernvey<< ie [Mm Data Physi cal add, data ysical_odel Vi il ig Main Memory DMA transfer [isk storage WM _ Organi zatton ) Teooptarn / Processes ¥eFerences an instruct on 2 deda Space thet “independent of available. physica) memory sac ee nha %y 7. Virtual address ¥ peas ih hysical by Combinahin _| re SO 4 adit tras +o. ty atette aes Spai : immedi| Norma p yom Virtual Memory a | Cache Memory | J a es | = ~ High mei | Memory Speed 2 Copactty . a iz : | Memory Ec a memory yn Sete i technique L involv Wolves Oni harddisk « : x Aces | — fash +e across Peistolier fo ocsc _ | —— i | Manage. - CPV & related = Ope. voting System manages Vithiod “memory i [ sixe - SmMadt in Ae = size 1s much Larger decha, a ee net__getting accomodated in@ Parallel Bus _hrchitechure.- Bi hr it e Bus _architechire Connett multiple praciscre ete own cach memory using Shared bus a Th sufftes fiom Lodeney and _handuyoth iscu = Tk_mahirally led tod M4 u Hple_ A) rubfiple - "Bus _voith full bus — memory Connechon (MB FE Mc) — * All_ memory medules_iconected tr al! Buses. } 3 AT-_A Bus that connects mojor cessor, ty = hee ’ 40% component. (pr os Memory Typically Contains abot So-Too oF stparate — line t each Ene assigns Some junc = FE seperate into 3 funchsnal group - © Paty Gus @ Address gus Dota Bus— Carri data i Fe comist of 7 32, 4, BE om OR Neparak UALPo _Muttiple bus with Full bus memory ~ FE _has each ach memory module connechad te ¢ a Specific _ pr Be = 4 Savi ANB ha es ~ FE hes alll ies maduled D cotache acall bute = fox _N processor coith ™ 23 the no. of connzotion grag ane 5 GN 2% loud on ea Nam Py eat ft [mereMc | ze 2) ulti bus with partial bus —memoy @nnection - = ee memory module connected 4a 4 Subset | of buses. | a! J aealaa) cls hue Pes AP busedoY Multiple bus wi'th single bus memory nin - Only ae bus wil) he Connetted to ayee icev ane oii memory. a of Ifo oe ttarte: od sta_behowen then se they hava diffeent mdb _of commun icin. Eee Steere: meMory « 10 Cache 4 = Te Communication pehwen CPU Palo duis i ca 1S usually _———rrplemencted sith help of Interface a J = ‘Type = fi) Progtamned 2 ! ® Thternipt fe ps Direct mernory Across. | © Programmed I/o = ti ve in iti PU under driver saftieare contre! to access Registers |Memory on adwice, | Sra = or_& S/o medule _= fthen the pracessor_jcsue_a command + T]o medub,it must wait until the i/o operation “s completes = ith ee he _prowsoe ssue T/o command , ‘inues +o execute o instruchony and is imtewupted by he ha. pleted its mregrammed = Metessor js yesporsible for extracting cata fiom Pee upteT/p rnin mampey ae Outpuck cers Storeng dats in main memory <> =) =tnpap = The aHernative is kno eet cess MMO = In +his_moder_ Z/o ae main pregsey cli-rectty = its Pale, ik peefoun ae nite! achion L tinct cppopriteBeer te faster han Slmeduc. the gichlen selon al 1s that cpu has to wait a longtime fixtle_qodule of trrern __4o be vaady fo + lo module i +thi plows is Known Poll Dg. ~The Rs cnet “agg Sa Severely deqioded, either reception | tran mission of dato = The cpu _tobile waiting 41 a e Tssue yead Ummand| cpu —» Io la [2 Zo medue | = | a> ‘ Read strtuo of | slo — cru [Ble _medue | : Nob ! check, — For ondition | I Ready Read (tor! fiw slo-scpv Ho module | Waite yoord jyto Ce —7 Memory Next. Snstrach on|| er I/o | a CPU issues Commands te t/o rmodule then roceeels with jks nema work — ymbil inbeupl by Ti tlo device oncempldion ; of its pork: Mies iElavape anda Talgglon— ae 3 Lp iS used 42 inform the devite aboub the_stort end of transfer a = | fer i ten ‘in cpu ur _doba hos arrived Be I ‘\s veady to be sebvieved by System Pro cessor - x This placing oF (pu in idle state tom bedons by _metnod used in mi cropra is to @ntrol sig : B = These. so torrheo) signal faclihes_ cpu. Fathi | = © Bequest CPU shen ee, beemingtet execution of currend inshudien £-places tht odldtess bus sdata bac 2 read st { oto high | is dis ti (onteo| pF buses to conduch memory ows transfer cot th _ pro ea memory bus ealing HTe allows He OMA onholler tp teansPer one. data word ot 0 Hime after which ttn a7 ss of buses fe Tpv,2. Fa Bus _ frchitechire ae _ The peripheral device & memory communi cates wrth each other serially according! ste fhe priority Popular gevio) Buses — 1® Serial ? nipheral: “Tite (sp) 2 TE is 4 asynchronous serial conmunicaljon 15 being obsever! behween the! communication devices. | © TE is. devdoped by Motyralia in 1980 *. © T's said os Full dept ee Communicatron (deta tan be | sranstex ‘in both dirckion.oc same Hime) in which master Slave architecture with Single rmasher & mulbple . Slaves 1S obSeweo) L@ Dsed Bar short distunce comMunatiah pana ily in ambedd ed _gycteM 4 Ls Diagram oeispt master SPL Slaves | es APE Steg | spe ee SPE lave / 3 @anter — \ntegrated Gut (Ts ¢) : |e Tn this we have muttiple master 2 muthple slave’ . haat roped ae x nate matty “wrtre[s the Slave actow ing to requltedwifowly 6 the stave acknowled gewunt : most Sot | Sr \ Slave 3I [o- Mass Storage Device UTE is any ctoroge dei omunge ine ‘it possible to_store lax "g& dmounts ef data acco ss _ce1 computers, SenerS anol within _an__ sg ehvivon runt, 2 || They Ove portable storage media that provide @ storage _ 1 ! iNew era ce that can be both interned 2 eterna) tp the H Corp ucter o | Store large qgmounts of data oe Massive bo ! nony me vi si pher e __® | Ho \lexith cr d $ rirorhve mass See in as H + y Are stor ‘mvolve_yarto! of hare ~ disk sr seltd State, Storage _medigq 2 TE 1S associates! (stth data back o£ data Yelovery 2 Miter prises plan for al’ data to Recorded Lbackos” up | hi storage | much_ more than factory by Solid State devices - Electronic device: in which electeicity Flows trough Semiconducs devi. G Jax disk— dive non = volatile [store on magnche devices jisle — USI table /E, : % Optica) dyive- Dvb'S £ cp'S_, permanent. { te-vehuwned Thx tape. disk - Sesres_in mag hehe tape & linear method nes = audio —Video easels:@ Input K Oulpub Devas Atle titers? ey eden. depends upon the Size oP computer Lthe peripherals Connected fo it ~The Z/o Subsystem of Computer provides an efficient of communication behoeen the Central Syston & outside envivonmens = Types such a> Moniter , ke board Mouse , Pximter | Magnetic tape, T/o interface. Provides a metho ‘info. beh” fated nal to dei 1m UNI Cacti on | links fey joterfacing thera with the Central Processing Unit = Rirpoce of Commu isi 16 to resolve the cli ference Hhech exish wo entra) com ze ipheral Pecan a ——— a Ho Boies TJo devices 4 ane | > The. ee Difheren te are % Fefigherals gre. elechernechanica Ne dJovitS and cPU and a “he ee : = A Conversion ef signa) values moy be needed. dody Honsfer be of a tea ts usualty Han -hanstiy cote of CP ahen mechanic. ra Bh Bed¢ Convinienb blocks for the physical partitioning Sn of informnaton Stored in _muttileved _paemary St In “oss, * Te Sova memory moanagemen b technique: Tn which remosy is divided nfs fiannes & which j _—entains hoo elements Riyst base address & Second Jength i ie er Seq rn nets caeegend_ fe logiat elie such # programs Sunes — Ko aK vision oF programs in term of cod "| . : __in segmemnbat on » ___ Progam com he divided inte = Code Seqrrent 1 Stack Seqmen Data segment - —2 i S C \FRe ogy As segments ene logically independent 0 pogtand_Staymink can = || 01 any HM @)Propertion Progeam such ar Kope ofa yoriable. Loreess vighh ow i st “ ry a Rocpam fam unauthorized access{ tof: — ? gba © Each prowess Corogran) nas its owh segment dable- ® Stqment table pointer gives the Starting addtess of Segment buble qe alse contains the length oP Segment Q ether convo bly Virhual qollness d Liner [seam fauna eee : Es E. call [number | : 1, | ae —— oo ey a [Segment tbe Ft Semen Fable Leer | ae” y i O7118 (Trorsle on __Loo kasid e Bufkex)_ ———_—_______ principle cuery vith mary ee physical nomory ace ——— One ty fetch appropri te pai ae table enbrs 2 2. One fo fetch the desired dota “ Thus the Virtual memory _Scherne would haves the: ———SFFeck oF di ing the memory access Hme. ——To_bvexcome +nis problem , most vittuod memory — ;— Ter ery use of i igh Speed — fe wually Cullecl a —Fransloction 1 , ookasi «x_(TLB) cs mH | virty, address | cee fo “Ranslotion lookaside buffer Moin Secondary memory Tremary- TLR contains Mose page table enhies thab have been most rocenHy used, ta = —_An enty ef 118 contains : 1») Virtual Page Number DS Control bibs D Toge Fame number in memoey = Address translation proceed as follows. 2Given a virtual adel, re Processor look roFerenced Page . STF the page table enbry for this Page si + | beu, 2 TF there 5 4 miss in Sone ND ervhyy jcobbuned FE fom Page. stable ‘in main ita Ts bu pala he of io fhe TB forthe _ is found in in TLB,ena page fault occurns the 0S has 4) chooser one 9 page to_vemove form memory to mabe Yoom for thach page. = TE _page +o be vemoved has beer rnodified while in memory then it must be rewritten to disk te bring disk copy t Up to dote. “3 however — ewe ie ge oiptas not maed ,no verte 1S neecled. = hile ik would be pasidie pick a vandam page fo ——ephce ok tach pnse fist system performance 15 pnuch Lbether io page. thab is not heavily used in chosen iy ee ee Q seplacen. Policy. a 4 Main_gacd -cheasing ds: do Maximize the a tatio. * ie ol Heck iS nok jn memory rulas stratege Z ) First—tn , frst Ouk (ETFO) __ D least Recersty Used ( /Rv) 3) Optimal (oP) “FIFO | = The fixst_pageuocitfen will overlap he next ancl __. = Tt does not give high hit rate | Assume thak memory consists oP three fiames Sduring Srecudtionaf Program ,folloving paged ate etre ‘in, Sequaness * 2.3 £2 4£ 3. 2S. 8 oie thot behaves ae veplocenunh wing FIFO ckeae alte (3) Silt 3 | ul a __@/ tRu ee tepla \ 10: jot ~eferced for the longesb ttre. : =k _sbfers neax optimal hit robo. This alge,suggest thet when a page Ruslt oceans, ———+Hreow cut the page the has SI © Siem fers i o #8 cheap. ad The _aloyovithn ‘ likely ty maintain a linkeol fish a PF ot fagec in memory with tne mosh Seen Wy @ met 2g2_ab the least aecenly used pose at req x _ very a a me xr evence 7 Finding” 9 page in ist, deleting ik » & hin ineving ie fink ey a ontuing option OE a ; 4 eS i Lh 4 ololdal Nfkex fase aay 9/0] SJo ° 1S ¥eFerenad 2—. |—_- ieee | WHEE! iP ife | RD using ___|- Tt selecks for seplace ne gc B | time to the nese |= This algo. verults in fewerk tie 7 Poger faults |= R ic impossible to implement, in Mi Pag 0 Dp eg NOW wh ° | Next. i l to fudge other lop. & FIFO method i Gite Dell De On SOR 2 202 | ag omtic a | qaaress (Ccansider page ftame.sxe = 3