[Date:}———, i page: | Operating System Onit-$ (To managementand Dive Schedisbing?! ) i = fudlexplainakion Agendas — U Ly “To devices and categories of I/o deurce- Ql “Techniques fer petferming Tio. a] Buffer in devices : : 4.3 “Type of To batferme 5] Geviees provide in keYnet Lo subsystem. 6] Disk Scheduling algorithm. 3e]_why ScANts Farrer than seTF in disk Echediebing 9 j a) Boot Hlocks ? 9] Bit Vector, Linked List, Groupfng., Countig . Co 3 fo] RAID. At] File Systems . 12J File Organization 8 acces mechouism 18) Divectovy & It's implementaHon. 14] Scheme for defining Logieal structure of directory, BJ Fike showing , 16] File allo tation. | How hlooks ate alloca, ted in secondary storage management 7 33] Sequentay Indexed File 18] File System implementaxon , Proteotron. $5']__Acoes’ motvik. & implementoakon da] Need of system protection. fa or bane zoe (es!)| [Date:} ——— aj Pdevtes- SET 4 Se —- | 2 Known os Input | Output devices, | 3 To devices ‘ove functional unre which a atublishes the communication biw ak [pasts of systens. | > ye si veer b mi “Tnputdave Beal ecteved by device eet Signa thet ave sent known a output 4 | > _tdo Llo' means te perform Tnput /owtpuk | eperation- "> “thee devices ave wed by a_pergon 4o Communicate with computer 7 aga 2 Mouse, Keyboard —> I/p devices — dow’ | fat Monitor, Speaker—> 0/p deutces c BTS Cotegor? er - 4 | Y@ Rumon Readabse © i} sey == computer system. ye Printers, monitor, bar . uv [ @ Machine Readable z | checkia nic components - + 4 f 4 d ni Disk lope dive Serie: J ae U @ wrt CALTON « Mode. Alo weetiea | a ardenna. i | | iE EZ | ee Se | | | }Fallow on Lrstorvorn $ a @smavt -ergineer. babu, [paae:} al Techniques fot performing Llo tg ox oxganfgatton of Lo function U + Proqiammed Tio? J & Preqyammed Ifo takes place under divect__cunsyal of cpu. : & Command on behalf of procers issued to an Ttp modute by Cpu. * pu the wots for opevatton Completion. > Erdevvupt dytven Tilo: & CPU issues ax command on befalt of H process to an T/o madute. x TH any Mmstruction tg non- blockia then cpu executes athel mtyucttons ofthe. Same process, > Ditect Memory Access(DMA) = * OMA medule contYols excharge of data, befween memory and an To module Tequat Wo Water DMA CPD 5 a : modure {modal * We pweces con _onty be intervupted when the entive block tec been Lamferred. &_(PO staves Ilo by sending folowing info. fo OMA module JCe _Read (write requert_uai'n Gontod Bre bjw cpus OMA: bs Aivess of -the T/o , on the dejo Sine, C+ Stavtthg Jocetion fn mernosy for cad fastite. a a 4. No of-lootds 0 teadfwrtle? 8) Buffer in devices - Ao known os Ilo buffering. Tt Chuffey) fs a memory axéa that stove, dato. befng transfered blw—7-t0o devices. ~ Butfel 7s wed © manage speed of shaving mismatch biw comumer 8Y Producer. 7 a — 7 Ee ae ~ Butte Producet CarPsINe Yt >. Ingenevod we we two puffer architecture. whe’ chu ov produceY gwitche, the butter Pring © aol feng féauing awoid sone oad o K { aes. . x i E Seer Z —Pradacet Cowuwrer i e C2 Subsortbe to_t—_Q ee Engineer Rabu. UO4.) Types of buffering schemes - { @) Singse buffer — [sos 0 devices There ave +wo buffers. ©) Double buffer ~ Cree buy : Z > Herve mote than two buffers ave Wade > Coltection of buffers iis yefévred as a LCtrewlay Buffer. [3 Tn this the _produceY_canrt pass the Cormumer becatue tt would ovexwrrte buffers. before they fad been comumed. 2 The produce can onty feu up to buffer | gt while data _tn_ buffer qd ig warting te be comumede a a i os HE 4 | tlio fondling 7° |! U | { > Lo Schedubing — i x Tt bast Yeferg to a qood ovder ofPe 6.) Disk Scheduling alg algorithw - @& Fees canis ETT 2 Stands for Fick Come Frist Sexve schedslirg] > Ws algoritiom io Mdtrinsicame fait , but Te qeneralty Vdoos not provide the fastest service. v i { im a dick quese with segues oS Tilo to biocks| on -cupinde rs, ad Sart 98,183, 84, 122,14, 124.65, 69” 1 | | i @)_SsTF adgerttthrn - aw | j 1 7 Stands fot Shortest Soek Time Fivst. i 7 Selects the Jewt seek time request. , Lat serra ets _ | i | Quere: 98, 163, BY, 199, 14 124, 65,69 | | if head 8 $3 then M selects 65-3 net FeQuak became ik 1s choses to the head. - after shot 6S Sehects 69....56 09, 3) SCAN ee = 3 Here the disk fe seonned ¢ av walkved fiom one end to another. = i= 53 AV Head 3 o— Toa ave! oe ee { LL pie = > >_f Head & af SS ond algorithm is taversi fhe List toward © then” afl the cydinders ~ ave erecuted after reaching 1 one~erd +he control af head is yeversed. And ¢theys abo eecuted then. (@)_C- Senn She > Te a vartént of SCAN. > Tast dike SCAN eve we move the conta of fead from one end of disk to anothey end. > Bub after veaching ene end the contyal Fim ediately amps et the beginning of dick, withoad servicing any rYfuatrg. TU U © Look echedulti a > Frist go -to end then veverse back Tmmediak ely. ~ SimbfoyV+0 SCAN 8 SCAN. but known a Wok g CLOOK.2] How Scan) te faster than SSTF in disk Scheduliy * Th Scan. the drive head Sweeps ACYOSS dhe ene guiface of the disk, visiting the outmost cylinders before changing divecton and sweeprng back to the innermost eypindes-_ & Tk selects the nert wafting vequests whase Jocation ft wifk Yeach on {ts path ‘Back way dd | and fotwards acdoss the disk. *. Thu the movement time should be Jos than | FCFS but the policy fs cheovty fatved than 7 SSTF. | A. Boot blocks 2= | f i | : ¥ Some information ts Yeguived by operating [syste 40 perform booting. U 1 pot 2 "ad | 4 | YK In case memory howe move than ane- | partition the fivol pemeuiea—eo “the boot information. pavevon contaute | * Tf that _infrYmadtion is not found tr the. fl . i HN block then that f called ‘boot block. &_ Inivalzation of alt aspe cts_of the system, fromm CPO tegisters fo device contyottere F the _cortentof main memory all ave managed bu beoting. Rk “e/sojuetnis iat’, the : bootstrap pYoqan finds_the operating System Kernet 2 disk, | Joads trot keine tito memory, and fu won ime addi¥as to p egiti the a8 Y * execution, =alee “method 5 ‘ A. known a5 bit-vectos of bit. _ || 2 Fach block fs represented by Seb. D_Tt the block ic, free bit is 4- awlocded bit ts o. fq, _Comsidey a disk where block? , 2,3,4,5,8,9, i fo,11, 12,23, 17,38, 25,96 and 27 ae {%ee and YO of biocks ave ailocoded, the free space bik map would be- i 001 4440044413100041000000431000 &.. > “the mon aduardoge of this approach fe its relative simplicity and Tts efficrency . ‘ ty T Cit) Linked List ¢- Another apptoach to fYee- space ement is Unk fgethey aw the free dk hoc, | Keeping o pointer 40 the first free biock Mn a spectas Jocuttan on the digk and cadchii tt th memoyy- nag free Spo@e << fY. Uist Keod. Co) @] o a) 18 FD ahe Ckrst block eontalim a cide tothe mext see dick Shock , ond so on- iiW) Gutouping - SS i ean feo ae >A modification of the free Sct appveach stoves the address of n fee block) in the Fst Yee b§ock. | ss Tee net of these block 12 actusily free. the Jost block contains the addvers At onothey nfvee bJock , and 80 on- @_-_. nS Cy) Grvereep tna. tounkirg = Sy Here vather than storing the addyY6s3 of crate Gsk we store the~oddress of -fvst free block of the Jist- Ei > pnd n ow many free blocks) fn-the Use do) RAID - 3 Stands ef Redundart-AYvays of Indepen- dant Disk) - v > Teta wrvety of dick aqanigaton fechniqua_, commranty wsedVin yYexalue the performance and vetiabitity issues. > Tnald me RAIDS composed of small, Cheap disks were viewed as a cost effective otternative tp Javge , expemive diski- i > Today , RATDS Gye wed for they -highey | velfabitity ond fghey deca transfer Tad I tathey ton fot Konamic ¥eMons- | > _Kence, the IT fn RAD, which one | Steod for | inenpemive’, row stands for 1 ‘t Independent "! i i > 4Theve axe almost dagen RATD jeveh schemes prevailing Th Razp ‘Technosogy. But only the most’ prevailing RAD Kevel schemes errr ove _suymmayiged bekbw. = @) RATO tet Level 0 ¢ Te > doe tot provide nes tswanels Q@_RATD Level | —— @ RATD Level 2 @RATD Level 3 Wy G)_Qard Lever + @ RFID Level 5 @_RATD level 6 = @_Ratp revel to CxO) @_LALD Level OH 11] File Systemy > The fale system permits users t cveake dela. coftecttone , called fe, with detyYable — propevties~ x Long tein existence & Shotiabse _blw_piocesse * Stiuctwie. > File ig the comectton of data cyecdted by wey, > Tt wed oY sieving the daa fh an oxgatiged feimmts andr bides associated wsith fie gyatem: Create , Delete, Open, Chase VU Read 1 wtte| Lathtbutes thata file contains y | Name, Identifier, Typer Location, Sige. | Protectton ,CTime , dite 8 usey identification) [Hay Fite Ovganigation - . Sy Th elers to the way dada ig gtoved fn a file> Tre is Important becaute TH detevmine he methods of accel’ , efftcfency fuexibitity and | storage devices to we- Uv i 7 methods of oxgantging fel i cA : __-@ Sequential Pe oganigaton 2 (a) Random oy divect fle organigaton I Serdan fole orqantgatfon Y 1_@_tndexed- seq tential File ovganigation [__ method. a o> Access mechanism 5 Q_ Sequential Accesg ee Q@ Direct Access ocean | @ Tide ress - ff YS |13]_ Directory — | 7 _Divectdry_fs a cattecttm of file. | > Tt can be vfewed ai symbat fable that tromsates fete names tuo “thely dtvectovy entvig. Y > Pirectory comm also be exgamiged fh aavious ways such thot fel endive, y delle entries, Sedich for a named entity , view all enti fey.Divectovy Imple-mentaton = Ys Tineay Ligt — one by one earch flash ‘Tahle. — based’on Key velere: 4 yr . | Operations “performed on a dfvectoty - |. Search, Create a five, Delete a five, Rename aw file, List divectory : £ I [20] Schemes for defining dogical Stvucturve of divectoyy - . Gg {ess @ Single - Levert: divectorty- 3 Tet is the stinplest divec tory sevucture. > AU Fie existe in same divedtory - > Foay to support and undeystand? > Sveiy file must fave a unique name _ a () Teno - Levelt Divectovy - “352 3 eve each der hay & A® own User Fite Divecto xy CUFD). ; > The-LF Ds have similar shyuctuves, but each dirsts onty the files of a_singte user. > One Kes cam only accaW te its divecto— vy_fihes- mz @ Tree. Structuied ditectorfe3- > MS-DOS system fsa t¥Yee@_ stwuctuve divectory. io 3 > T¥awtlows users © create thety own SUb- | a divectoty and to ovganige their fies accovda . > Agub-ditectovy contains a get of YS Of eub -divectovies .[Bae ! [phae } | ——— << f\ o re Yovie . A ; a cyte ayaph ds ecrtovies © | | 9 Ttatlows directories to have ghaved su - _ dtrectottes 4 Fi hese a | 3 Same ite of divectoty ammo he _m two i different ditectories. A [3 Graph with no cycles fe a qenevols— [gation of the tee seictuved gubedivectoty | schemes _ = [5 Shaving files 8 subdivector’es can be implemented by usmg Links. 15. ] Concept of Fite Shastra - > _Té fs che shaving of files among Severu [userg, while workixg togethey on a/proqect 3 This the prtvate Tov Sihtic_distvibusian of data of Yesourees fp a network. > When Tt comes to the Internet, a file | 4onsfet system ootted the ‘File Kramfer Proto cal? (ETP). I | TWpes —>_ Peer-to-Peer (pap) Eile Shaving Ly File shosting Serutoes f 16:J_ Different methods of atlocating disk space - CEPT > Contiguous allocation 1% Te vequites that each flue oceupy a _ Set of contfquous blocks onthe dick. N * Habe known od continous fh access.- .Advondoq of oe. —__ |e SimBl ot atte cain scherne_ard con be Trnpse- mented eosiQy, a Excellent bétformance oe Disadvontog e- {. The sifQ of the file _up 40 moxiynurn Dirt muut be kno [> Unked ailocadfons & With Linked allocation , each file ef=fese 1S a Sinked Gist of ditk block? ithe di &k_blocks naw be scattered antwhere to the dick. 7 % “he divectoy Fiked format for alk records - 3 Ald Yeentdy ave of sarne Length. 2 | > Consisting of the game mumbey of fixed ‘ye Aiedd~ ino paxtteular order. | aa AdLyecords awe stoved tr a key Seuance. 3 Yecord {key [value] iIndered Fije.- : : [> To achive the flexPbinrty ,a stvuctuve 18 | meeded that employs muthips© frderes. | > Two 4ypa of “indexes ave used - An *exhaus [sting fndekicardaim one entity fof every Yeow | tn Hhe man -fche. | | = pmothet one fe a *payttag index’ contains [Lenttey te vecoid where the field of ttevest | | exists. [4a] Fle System implementation- | can beViimplemented on the disk avd memory. [3 Te ik is Fmple mented on disk , te contains | | following Fnfoymattons | 7 BootY block contyan 3 Partt'on contros block File system _protectton- | Y In_féle system compuger i | €2le needs protection - u y poss 2 Reliabiti-ty DY 1 ~ Secustty 7 7 Contyalfed access | Vavious operations can be contyaited Read, write .freaute, Append, delete, List. ; yong Tse 19. Acero Mad vie oe =F | 7 K em be vianed ad generar model af protection. oc | 3 tous 5 tomoins aun 5 objectsfe > Each entyy thathe meurik consists af a set of access viqhts. ; — | We wiadot consists of the fostowtng tnvee =| companeittg— * Curent dbfects —'0" & Current Subjects 3'S" & Current Rights + 'R a i Implementation i 1. Guobal Tabte- . > Sfmplest_fmplementakon. 3 ConsBE a set af axdeved tvfpla | > whenever any opevatfon” -has to _be execee- ted an object within’the domain search for vipses aoe ~_Tf this Gipte ie found the operation is attowed by to comtnue otherwise +an exception condreon TS yaised. pee 2. Acces Lists for obfects ~ | 7 Fach catumn ean _be_fmp.lemented aan | access Lust for ane abject. > Obvioutly, the empty entyies can be [ | discarded « | ails > ‘The salting Jist fo7 each abFect consists ot ordered patys , whieh | defime att domains wht v K non — i of access rights for that object. 4 i a ee 3. Capabittity Lists for domafns Fagen TP Sy a. A Wek key mMectanism. 8 || eae Jo) Need of system prdtection ~ 3 To prebent unauthoy ged use. of systern: | 2 To make suve ail procusy fe5S0DS syste palieres. OY ~ To protect system f¥om cYash. Example? Unix ys { ; key Shaye; Commerc Sabsertoe: @)