64 Shri Shamrao Patil (Yadravkar) Educational & Charitable Trust’s Qt Sharad Institute of Technology Polytechnic ___YADRAV (Ichalkaranji) 416 121. Tal. Shirol, Dist. Kolhapur (M.S.) India + Approved by AICTE, New Delhi + Recognized by Government of Maharashira + Afflated to MSBTE, Mumbai mLectureNo.: bate ™ Specific Objectives in brief : = Theory Content is to be taught : eri are File is collection of elated dato. the data stored in the computer is ‘in the former file. Ditkerenk 4yper cd data needs different types of files te store if. = Data cowd take diffexent forms . Jt could be Numbers | characlers images or even some SymbolS . = File is actuatty a physical memory Grea Feo anos fo store the data but Fox user ibis loofcal place which has got same name due to wohtch Th be comes easy Far them to access thot file. = The int” stored in the files cowd be further _skored in the dlitectovies oy Folders = The directories are ayain like leqtcal ¢ompart— ments which only stares files ay sub directories. Directories are used to erganize the data t» ~a_parhiculay ordev at manner.>, the : wl jwo types }-e data & Program. Programs set a Wsbruchons qn machine +o o — Data File Ts sequnce q bibs rbures, ltnes or the meaning oy which celine by Pile Create & user. —Bats Files _coutd be Mumeric , character, byeary even audio oy video | Filey are Sroted on te —Sscondary Storage devices ltlee hard cisk , magnetic tape, ed (DVD etc. - files are {ong term int” storage which must sherd large amounts of data «© inf? stored musk Suavive the tev mination ct te process usingit- € also multiple processes must be able to access the tf? foncu reently ‘ - Fle Naming is given fer fre easy hamon interactions er convenience. - File Name has ask 40 park ji-e name ATR exten = An extension is used to tdenHfy te app)? i» tehich file is created. £9 if file name is “ presentation -Ppt” then we understand that ile name is_presentwron -® Atribu ot Files: - = “here aye (Certain File attributes woh yeh cure maintained lby OS. The attributes are nothing but the propertes ot Files which store the File xelatated data \rke cate & Hme on whitch Tres Creako, owner File, size of File etc. — Atyibules e2cceph name aw qiven or generated, bythe syskm Attributes eve useld to qet the Informoken about apertHculac File ww directory. — file athibutes vary from one os fo Anoter Os. Following To the lishcf some File athibute . Atvibutes Meaning > Profection - Access —contvo) jnFonmation detesmines Who can do Teading , writing executing € soon. J J Size: The current size othe $ile. 3\ Type :- Informaton is needed For systems that Supposts different types & Files. E] Creator: ID of the person whe created the tile. =) Ouner:- Cursent owney dt the tile. 6] fassword.- Passward needed to access the tile. 7) Identier>- This Unique numbey which folentifies the File Within the File ayskem - ————————£) Hiddten Flag t= 0 Fox normal ; 4 for do not dlisplay in liskn a}Read Only Flag: =_0 For Tead)wrike ia for Tead only + te)Ascail binary fag: O For ASG file, 1 fer binary Gile Ut] lock Flogs t= QO For unlocked ; nonzer0 few Jocleed - 12) Fey lengli &- Ne op Byles in the key Field. \JTime oF lass accel: . Dale 4 dime tra File wen lash acceye \ime & lash change,- Date & time tre Fife has Last changecl, 18] Maximum Size :- No. bytes the File may yrow bo le) Syskem flag.1- © for _novmal file , 4 for syskm File. & File Opevations :— + files canbe implemented an several ditt devices Fapes,disles , drums «& other more Unusual , Sto devices . ~ AFI is a logical entity which vepresents o A ami piece A jn. - fA file 1s mapped onto physical alevice . i - fr File 1s @ means oY Storing int” for lales We. =We may want to -he file ;rewind the Hle & 4 From tre File & odlelele fle File.ees SSS a Geate = i with no data The seP%e | should be Pound Fer pi herds “ 7 Zl Oclete sak =1b Nay a a ee 4 Oelete? File need tobe deleted to Free up disk space ——@hen Ik ts_no longer ‘sequired 3) Open: Process must open tre file betere using it. Ayibutes and Lisle St disk addressex, are obtained thts main Memory Fer Fost access next time. 4) doses. When use _o& File completes 1a ciccesses qeks Finished - The attributes and disk addresses are ne lenger wequired, so the File Should be closed to Free uP internal Hable space. 5] Peacl :- Te stead from File we we Syskm call which dende nome or the tile. Usuatly tthe by}es come from te Current positon. The syskm Needs to keep a read ecinter fo the leealon tn the Eile eohere tre net read ts te take place - S]Wrike : -To write the daty to the File. this syskem cay Sspecty tre name co the File £ information jobe vaxititn fo the file. Writing ts aqain ot Current pasihion “The File size wi)) Increase provicled the current QosiHen denotes at te end ch fi. 1| bepend :- The data can gels appended only to te end + tre file. Syshkms that offers ot smal number dr system cals cle nok generally provicls append, but several syshems CHtes .a Number of A braids SP ach) eving tre Same thingin the File. Jt is needed For random access Ail, specify from where fo tale the clato- After col} has complekd, data can read from oF Uri fo, that posjHoa . Get _atibuted!- PYOcesses reg vont attibubes to complete Heir olesignabe d work - — V3) Set absibules!~ User can change the some athibubes ot File alts IK creaHon. i \\] Rename s- Usey needs to change the name chan exsting File. *% File Types : = File is q collechion a -velaled data oy Int” cone be vecords Inf? about te file Ts stored In tre cliveclory such os the size Ff the Mk, when ih wag creak!” & 50 09. cach tape or device ust have 16 own device Airectory = The device directory 8 4 Convenienh place 3° keep Summevy inf” about the Files an that device. = Sinding Ja ile mequives Yeleniifying tre preper jape | Searching iK Amedeo « then Posi Honing the -fape of the appropriate? Mle. Many CS SuPPorls Several +Y¥ Pes oy tiley UNIX G windows ¢€-4 have Bequlary flea < divechorles UNIX also hos characky & block speciaS Files.% The File types Os follows — ] Simple CReqwor fi __2\ Basic File sys” Cdirechori 3) logic! Ccharacky jal Filey * ul Physical CBlock Special sles) . * i) Simple Files CRequloy tiles) “The files whieh contain user int” are called ag wequione files ov simple Filer. “These files are also cated 8 binary flea i C4 can be Ascli file. ‘ 2] Basic Filey Cdivectosies) These Riles ave used for maintaming the Stucture ct the file sys”. These are called gys” files | 3} Chavackey Special Files ( Logical tiles) These Files ave relakd to Jlo & used 16 model serial do device: such at Keeminals , printers & niw _ #4) Block special Files C physicod Files) These are used fo Mod clisks. = Te understand basic files lek us take a simple executable binary File from _a version OF UNIX. — Although technically the File is justa sequence _c& bytes, the oS will only execule a File VF it nas proper Formas. _- it hos Five sechions - _* Neadey « velocatian bits _% teach %* Symbol fable. #_data r62% Shri Shamrao Patil (Yadravkar) Educational & Charitable Trust's Ait Sharad Institute of Technology Polytechnic YADRAV (Ichalkaranji) - 416 121. Tal. Shirol, Dist. Kolhapur (M.S.) India + Approved by AICTE, New Delhi + Recognized by Government of Maharashtra + Affiiated to MSBTE, Mumbai mLectureNo.: 0m Dale: ® Specific Objectives in brief : onrone = Theory Content is to be taught : = Sequenhal files cowd be Tewound, however so cthey could te Tead ax atten ts needed. Sequentad files were conve:nient when the storage medium wos Mmagnehic Jape vather than disk. “This fs called ey Physicast file . = The following Hq. shows executable + archive tle ~ tnagtc number Headoy| module | ~fext Size Sec\ion | Dara size olareck [\. Data BSs size a voccuae | owner Symbo) table size Heads Prokchon Entsy Point Objech size. Z, 7) | "sear | Flags Veaders | Text SecHon Secktom ereculoble | Pata section object | Co An archive, il Reloccation bibs ModusLe Symbo) table Section+ Every” read Open” givet dhe position In the file to_s taxt ert s tn 274, 4 Spectal oper”, seek 15 provided to Sef the current positon. - Afr seek, the file can be read sequen frem the now or current posihon . Here the wekrence coos possible trough fogteed vekerences Hence was catlesl ay logical file. ile Shuchure im General i- Sruchuve ch files TQ sk Mainly three hyee, some File stores data plotnly ie oneby one cha or humber are stored. ‘ in cther types there might be * atte? arrange wade by File sys” ~ File can be Eira in ditterent woys - Theté ave some commen possibili fet - — Following are three majors tile shuctures. @ Unstructured sequence o bytes Chyte Sequence, @ Sequence dr Fixed length o& reards (tecord Sequence) @ Tee secordy of ditteren ax may be same, length Ctvreed, * The given Fig shows the types ob files, D Shows byte sequence. 2) Shows wecotd sequante 2) Shows tree srructure.Bute eaaRetox dl: cS Tree. ds— Onshructured Sequence oby esi — — Tn this structuring Loperating syskm break Content of the file as sequence at bytes. Ang meaning musk be imposed by Luser- lever programs. — Both UNEX & Windows Wwe ths QPP Toach - This Skucturing provicles mote Flexikilihy. Any tyee d content canbe kept in the File andar per conveniene & tle User, Mame Cam ke giwn to +h file. 2:- Sequence St Fined —length Tecordy, ~ Ththis approach, file treated os Sequance dy Fixed lengls Tecords Fach record has ih internal structure. Any gead operation on File weturng one vecord & wrikt op” wil\| append or overwrik One record.Punched cares“ were tM use, - Programs read input from file inthe unik + 0 chan & worele in _uniky ot 132 charackrs leceping remaining _ 52 charackrs blank. © 2 Tree Stuchure :— >In this ovganizaHhon, a Flle consisis Ar the wecorcls which are arggnized in thee structuse. fll {he recoTely _ not necessarily have same length. Each record hasg key Field ina fixed posihon . —The records in the free _qre ATranged in the sorked order £F key Field, to permit quick gearching Feng parkeulor key. The main aim in this type ary anjtahen is fo search recosd-an pathcalor key- The nesck record also canbe Searchad. — 0-3 decides where to add new tewrd. Users nok Concern about this operation. This typed File is broadly used on de fatge mainframe Compuless and — Skil Wed im Some commercial data processing—————— Sa - — Gt Acces s Methods t. ; File —slere_intermalighitishen itis used gna info must be accessed < veg nto com! rn — There are Several uw € are aysthot the int? in the file Can be accessed. Some Sys” provides Only one access method for files, a annaes ~On UOthex s uchay those & many clitkeven} access _methoda ate supporked & choosing the sight _one for a peshcul seo _Peahcalay appi? is a major file Syskem design problem. * Sequenhal Access a— = The _mos} of operations 4hat ate done on the file are read © wrik . Read operations wead the File < File poinker wil) automatically go ahead or iF wil) advance autemahcally. - In wwite operation ;the file Ppoinker wi\\ automal go t the end g the Hie 2 then content, added by Ae User Cr sys” will be appended af the end & the File. a i uto matical ly File pointer wil) advance is position < will _go at the end od the File afley adding contents ges _oves - This type ot file can be rewound. In case of Some sys™, @ prog may be able to_skip forward or stip backward 9 Number ocr records. ~ “This type fF Scheme 18 Enown ab Sequentcll access toa tile, Sequontias access x, a tape model or a file.2- This thed cannot jump around or Could Not i rewind cy bo 6 é.. tile 3. Ths method fs Convenient when storage _meditsns _ is_Magneke tape, ™ Random oy Digest access :— =When_use of disk started jor storing files iF become _Possible 40 read the byles or vecords ofa File Oub ct order. Zt i because, disks allow random access to any File block. a 9 ~ J also became possible fo access records by its Ke instead of by position Files whose byles 02 wecomds car’ be ead in ordes ave called random access files. They are mequired by many applications such ax database’ systems. = Lf vailwoy eusiomer calls up and wank fo wesesve a Seah end pariculay train the wesezvalion program must be able te access tre wecord fos thah train directly inskead & weading hundreds dy records dr cthes trolns firsh. — Fer the varclom access method ,the file operations must be modited fo includs the block number as g patametes- ~ Thus, we have read 7 and wrikeo, where “n'is the swelahe blecle number . Actual absolute disk address cr the bleck 1s diferent. — The beginning Oy the selative block number ts from add’o Wl ~ Then next block numbes 18d and 360 althoush 4he absolute disk address Or te firshblock iS 44045 ancl second block is S194,- The telaling block Numbers (pesmi 40 fake Ahe Elecision about locate & Ffacilitok the usey to Stop fro -pettions which ase other than ht — Every ead operation Give, tre position in the file 4o Stas) weading af, Jn the Seconch one, @ gpecias operation, seek, is P¥OVidec| to seb the cusrent posilion -__ Afies G Seeks tre File can be read Sequen}iall y from the now =current pésition, n_o placing the file rm accessing File system S file Porkon , * These accesg methods can be built on top at a tandam — accesS Meth od. - These methalg genevall index @ for the file. ~The inden. hay pointers to various blocks . = the wvecord in the file 1S searched by searchin the tndexr fiYSh and then user the poinker to accesS the File directly and to find the desized Tecord. y invelw the Construchton aks $ Severa\ Factoxs ave impostant i9 choice or File, Ctganizaton. Wese are - Minimum accesy Hme. * Ease o& Update = Economy or storage. «© Simple Maintenance. 5 Reliabilih. b he bperating _syshem63 ‘Shri Shamrao Patil (Yadravkar) Educational & Charitable Trust's A it Sharad Institute of Technology Polytechnic YADRAV ((chatkaranji) - 416 121. Tal. Shirol, Dist. Kolhapur (M.S.) India + Approved by AICTE, New Delhi + Recognized by Govemment of Maharashia + Affliate to MSBTE, Mumbai mLectureNo.: Date ® Specific Objectives in brief : oR oN os = Theory Content is to be taught : 4. Conti A\locatio = In contiquous allocation each File takes up a Sef oF Coniquous blocla on the dlisk. — Disk addresses deine alinear ordering onthe disk. Te each bleck sizeon disk iS 2t8, then Bo te File could be allocated 15 consecutive blocks. = Cntiquoug allocation cra File ts defined by th desk address of the first blede and length. 1€ the Pile t& m blocles long ancl starts at location 1, then it tales up lolocks 1, it1, 142...) Itn-1. - The directory entry fax each File specifies the addvegs or shatting bidcle and the total me. block allocated for this file -One majos ditticulty that is faced by the Con allocation method is to find +e space forg new file that is created. I& the size dh the File will be mn Blocks +then 0% needs to Search for'N Fsee 4 mosh im postant|+ conkigy ous blocky |+ Te select hole Axor the col\lectio Te _seleck free hole 4-sorn the | the available holds , certain Shiabegi = Directory entry in Fig 6-34 Shows that ile. at block O ard jis % block jong oc cupying bloele block 4 2 block 2, Similarly , File B slorts of block 6 and itis & block Teng and ts_on eee 5. Advantages: - 1. Quick € easy calculation of block holding data just ottset From start ot file, 2. For sequontiag access almost no Segks tequited - _3- Even direct access is fast - just seek < ead onl ene dist access. * Disadvantages:— |- “These is ne best place to put a new tile, 2. Problem chen file gets bigger =may have te move whole file 3-Ty Suffers beoz or Fragmentation Z 4. CompacHon maybe required Zit Can be excpensive.ay Le) 13 fo cyt Bis ay no os ea am faa Te) | west ts) ee) a Sf BD) i) GS) a 4) 85} Disk space oe Tag Fags Linked Te} Ailetalten or ate sae - Linked list allocation overcomes the Tmitalions ot _gentiqueus allocation. Jn linked allocakien, each re a linked Wb &t dist blecks- rn be - Yhe scatiered disk an the dist @n be allo to the fish ule. The directory contarns a pointes to + fast blocks qG he file. : ~ Creahon of a new Ble Is Simple .forthis ab W\yrequited te create 9 new enhy in the alivectory - The clirectory entry holels_apeintes to frst blocle Athe. file - - The poinky valu is nd _fetyemply File and File size fos +nrs File is cero. ’ ; : - The peinks need tobe followed trom blockte SES order te read a file. é - The abo fq- shows Jinkedl list: allocation for fie AL e File A cr Five blocks stortar block and conkintSSS ee Each block helds_a pointer tothe next block . These pointers are Unavailable 4¢ the User. - User _can see the block size erccluding the size srequired Yo sore he address. = Accordingly iit each block Sizeis 512 bytes. 4 bytes ave requited to store add "\ten user de Seats blake c+ 508 bytes & Advanjages : - L In Linked list allocation ,every disk block can be used which ts nok possible in contiguous ailocafion - 2. Hence, there ts no external fsoqmentahion exccept for Intemal fragmentation in the task bleck . 2. Reading a file sequenHally %s simple. &- Lb is not necessary to compact disk space- A Disadvantages :— 2) tt S Inefticient fo support _a yandem access capability - To rebieve to block j ,the 0-S has to stast at the & & veod j-4 blocks previous to it one af a time: Din each block pointer fakes some space, SO €ach File srequire slightly more dist space sathes than i actual size. 2 Tt pointer ts lost or damaged file could become maccessible. 12) f\ wrong pointes canbe choseN dusts bug inthe GS oftwaxe or breakdown st dist hardware. As a cf Which ,rre error could turn result in linking nko the free-space lish or mto another file.3. Indexecl Allocation i= a with file “Allocation “Table CAT) Io memory, linked list allocation Support random access, but tle | entire table must be tn memory all the Hire. In indesced allocation jail +0 poinkers dre \ceptio — one lecahion called as tndex blocic. a - There is a Inclex block eusiqned to each file and ths inclexe_ block holels te elisk block addresses oh thar parkewlar Sle, Bl mS File Indes bloce Mm GLO G ABC ism] [3] wy] Xe ‘ Fig Indexed Allocation a disie space _ There iso pointy. from ith entry in the indlew block te if block & the file. ik means “nth entry im indese blo& Jclels the address oe the nth dist block . ~The address dk the index bloce Athe file is mantodned in_divectory = An order to locate and read ith block, painks In the ___vth indlee block enlry is used. ~—Jnikatly wheo th File & cveated , alJ pointers in the __inden bleck ave initialized te pil.= When tne i block is firsl wrtHten , a block iS ob} from the Free- space manager, and iH addvess ts “put yn the ity index - block_ entry. * Advantages ri ~ Indexed ollocahion supports yandom access. - There is _no externas fragmentation 1 because apy tree block on the disk canbe allocated as per vequart fox more space. ® Disadvantages i = The pointer overhead af index lolock is mote with Com} to the pointer Overhead of linked allocation. = indexed a\locahon schemes sutfer from some ct te Sa eerkermance probleme 23 does Jinked allocalion . *6-4 Directory Shucture :— = Directory structure is nothing but a cellech0n cr nodes containing Ine” about all Giles, which ave presenk in ib. = Directory shructure is reftered a3 logical Structure 7 ot data ‘storage. Physical shuctute ‘is concerned ete ane physical devices that stores dato, fig: Directory ghructure.ogica) structure is the way the data is s sored organized on to the disk ox tape. _ following aye the general di _cy a File sys} in a ae 3. Single level divectory. __ 2. Teo level olivectory. _&.Tyee shbuchured directories . ES Single tevel Direclory Systems _= Single - level diveclory is the simplest oltrectory skructure. In this divectory Skructure one directory conkains all tle Files. This single dixectory is also called 03 a soot directory. Since on easly perysonad computers, only One Usey was working this Syglem Was more _generad- [& Rect disectory. Fig:- Single - level direckory 3yskem. Above tq Shows single level divectery shucture containing Five files owned by three different users P.G-and R. User P has two Files , User @ has buro file: £R hae _ one File. in the directory ¥ Adyantoges i— Jt is Simple to imele mort 2 - Locaking diles become fos +o look . eras Hore Is only one place 7 ————64 Sharad Institute of Technology Polytechnic YADRAV (Ichalkaranji) «416 121. Tal. Shirol, Dist. Kolhapur (M.8.) India + Approved by AICTE, New Delhi + Recognized by Government of Maharashtra + AMfilted to MSBTE, Mumbai ™ Lecture No. : . Date . cific Objectives in brief : & ‘Shri Shamrao Patil (Yadravkar) Educational & Charitable Trust's Nsit ony = oe = Theory Content is to be taught : « evel directory Systems :— “Teo -level directory syskm overcomes tha limitations of Single -level directory. In this divectory system. a privale divectory is qlven_ to each user: Whena user aeterg toa pasHcwar File only his own directosy is searched. - bs ditevent Users dineckrriey ave ‘aiHesent, the same name given to the files do nok interfere each othes. “These is no problem im giving tho 3ame name to the files In diftesent direcharies. = dt Is Tequired thot, in tHe gingle wer divectry, alt Files should have unique ngme. gn arder to creak a File fer @ pavticuloy uses, the OS searches only that ugess directory to detesming whether anothr file-oF that hams exis. In order to delele afile He Os limi is Search to local user dixectery. : When a wer atempls to opena File, the system enows Which user ib is in order to know cahich directory to search - Syshkm programs like loaders, assemblers Compilers, Urilihy wouling , libraries , ATS generallyBie —_rnany command InkerprelerS stm, M0 os tk hame oa file to load & execue. In syskm, dhis filename weuld be Searched fe user directory. eee eee = One solution would be to copy the syskm Hiles into €aah user divector. This ts clearly ts a wastage op memory as Hla-needs to be copied in each user directory: Solution to this problem is to dletine a specias wee alivectory containing atl gyslero Files» Rook ohrectory User directories, User files, Fig: “Tivo - level direckory syshems. m Fovantages i — Solve hame Collision problem as every User hos separate dtreckny = dndependont user gets isclakd from each othew ~ Lmibattons {- : rif the Users are Co-operahve that Is Working GH commen task , then Some syskem cloex not allow acre tre obres User's Files, In some Sychem, if pemmilted one user mush hove tre ability to name afile in anothes user's directory. To name ce pourtreutog So uniauely in a tudo~lew director, we mut qive_ botthe user name and thy file name. — iris not satts factory for users cath larqe number Files. Even on a single ~ wer Personas Computer, _ik is_not Conventent. x Tree shuchire Dive lity Syskems i= [teen Reshedtrecta S ke User subdire chore S oses Fle fig Hiegarchi cok Ptreckeyy gkruckune. St is quite general & Advantageous for uses fo group thud Fi)2s together in logtccll_coays. & Student 2-4 might haw o collection & files related to diterent Subjeds oh ~ nets Curriculy™ . — First collection can be tre group oF Files melaled fo ore Bubjed. Second collection oy Files gelated to second subjec and so 6M. Here, some way is required +o group these Giles fogethes_in flexible woy- as S A tree db directories 19 the solulon to store such axoup or Files- A tree is most commgn direc haat ‘ebha cole = in ‘Ws 4p esoach, each Uger can howe G3 man og are needed $0 that files canbe grouped }o excpecked Woys .ss Sk ESE Ei = The tree has a root diveckry and every file in tre Kem hos a unt ma. bo ve. to _ditkrent Users Users @ and S have creakd subdii - AS User Can Create random no-% subdirectories. ik oHers 9 Commanding shucturing teol fer Users to Oyganize Hem work. This & the season , ou modern File gyslems gre organized tn this approach . a Advantage. With a Werdchical direckory glsteno in addition to thei files | Users can access th filer ot otler Users by specifying 8 pathname. SEES Disk Oreanization and Disk Shructure 1 chure !~— The’ magneticn, disk is usecl ag main storage chevice wn youy computer Syskmm. gt IS Magnetic tape of storage. device Within ene magneHe digi unik many Physrcall disles are present. Every cNisk has Platten having Crcwoasr sh & gre Hat elike a Compact Digk —ThKe_ plaHex hos get two Surfaces that-are Covered with q magnehe matesPenl . The infosmation is stored bu seecorsling The rag n€ trolly on tha platters. = wat above ewery Surbace or plaHes, Op]w hea flies”. Disk arm comes with an attachment ch heads as a Unik. These is logical daiqn co Surface . In Surface is divided into cireulor shaped= Tracles_ave further divicled ‘imho se chor . = The collechio ot tracles PYESENE apf One arm _Pesition makes up a cylin Tere coud ba thotsarnels ONCENHNG _Cy\inalsat present ina disk drive. us : Also tree could be hundreds oF Sectors ing frocle. — The common dist dries haw Stora e capaci in gigabytes While alts is eine usect te Spin vale d drive is very high. - 3b 1S avouncl 6o't. 250 Hmea Pes Secorcl. ~ dt is presented in REM Crotaktons Pat Minule). _= Mest & tre drive, APM is at 5400 , 1,200, jo,000, & 18000, — Disk speed canbe divided jn two ports Catted TYaansfex wate ¢ mosibiening time Random Access Tire). i — Transfer rake canbe delned ag the wate wil, Co mp utes Which data can be transferareel bet & dviv.4% Logica) Shruchuye 2 st —The Jogteal Ale system manages metadata nkesma “Pietadata_contalns oll A the file -syslem_shuchwne dt does nok contain. aetual tile convent. Me handling d the, clirestory ghucture is Cancrhes) — out by Logical Ale. aystem “roofer the fils “organization module tsi e_inferrnaltsa Sted _wi\|_ be, required afterward , giwin a symbole Pile. ma. file ghruchire js madntarnedt by _by means ob file = contol blocks. A rile contol (FCB) condoing infaymalion segarding the file, including ownership, permission o_o Ole contents. i Protechion and security 1s alse otkered by tre. logic fle seer beet. tat de ES Disle surface can be, diivicsd in many, partition S _Seckor O ot the disk ts colle map (master Bool = _ Reco!) Usecl to boch the system. Each pasion con hol the independent File Syste Beginning & ending address or each pastiton fs qwen by Patition table which Tésides at the enol AMBR. When system js booted . 9403 reds iP and executes MBR - ik “The MBR program Finds dhe active Partition, ead Mm iis Fixsh block called the boot block and executes th. DISK Parca [Boot block | Super blocie_|free spoce mart] E-nod eo] Rock Ais Hiles& di Bg: posible File system layout.Boot block + Every parhhon begins with boot block, even LE ik does Rok Centodn a beotable oper trig syskem. 3h Future Os might be loaded | hat bleet Dupes block. + When sysiem boots , all key parameters —wegaxding File system is read in me from this —Superblock . Usuat information io superklock includ _amagic number to iolentiFy the file systero type the ne. blocks tn the file Sys}ew, anclicey admin\ — strahive, informalon, ‘ disk space, the system maintains a Free -Space list hteh wecords all free blocs. i-nede } The informatron reqardingy each File in File system Ys leepk 3 dato Svuchure catleel qenode. Rook dix). Ltrs the tope file system tree Files and dtrectortes: Biles and dlivectories tn disk. The loatcad shructure ob hare disk is divicked sn Follow! ng 6 loegtcal berms - Noster Boot Recorels | - Jt contains smatt proq ram load & staxb bootable povton from had dts} Osi ve. Sector O & the disk \s callecl MBR Wedte beot tne syslem . DOS Boot Record :- After loading in main mem M9 BR Checks hard clisk for ackve partion then loads Ah OS boot wecatd (OBR) in man memesy whtcl_ handover control to OS book coda ushich Futter oats tre wesh dy OS Code yn modn memory -Shri Shamrao Patil (Yadravkar) Educational & Charitable Trust's Qeiz Sharad institute of Technology Polytechnic YADRAV (Ichalkaranji) - 416 121, Tal. Shirol, Dist. Kolhapur (M.S.) India ‘+ Approved by AICTE, New Delhi + Recognized by Government of Maharashtra + Affiliated fo MSBTE, Mumbai ™ Lecture No. : = Specific Objectives in brief : i = Theory Content is to be taught : RAID Stucluting Mig *_RALD levels + RAID can be shuchured in many ways 29. A syskm may have ditterent disies dizectly connected +o is busea. Heve OS ow sys” s]uo will implement the Functroncify ot RALD = Another way is that an intelli gent host conbrolles will keep Contsol on various attachecl olisles 2 Con make use 4 PALD on Oisicg = Finally user may use storaqe array Cr @AZD array. A RAID astray nothing but a stand alene unik having jh awn cenholler cache as well o8 dicks = diis Connected 4¢ the host with the hele d Single. of _muttiple controllers:“Ss = The €asies} approach used for introducing redun = | daney fs bo cluplicate every olisk. “This process fs called ay Mirroring . = Data Siping is Made up dk divi the bib & every byle across mulHple disks “This 3s bnouk 4s bit leve_ shiping. = TMierering is wery seliable but ikis expensive —Shipping giver hégh data transfer sotes bul is not reliable. — There are ditkyent schemes for PBovict ny tedundany at lower cash with the help ge Sisk slriping Combined with Pavity boils , ™ Par Ag rs aes Sey ’ S8eess x ()RAIDA:mirorod dicks eee ()RAID2: ™momory-stylo eror-corrocting codos— These Schemes are having thes oun Cost performance Arade offs & ate cateqorized according to its \evel s known oy RAID levels. ~The above fig shows ditterent levels. P is used to_ indicate error comrecting bits & ¢ is indicating second copy et data. * RAID Levelo “This level gives high level read & write performance with the hele o& slripping . - Zt does not Faucilitobe Fault tolerance ox wedundency - Does nok provide Gny RAID Facto. © RAzD level-+¢ - In _ this lJevek mimoring Is used & iF provicley Joo wedundency beoz array keeps working even if disk faila_ = = Used foo better redundency 2 tre Cars high * RAD level - > - Bit level stripping is Wed ad this level. - Selecked Arse should not have Self disk erres Checking mechanisry because if Uses exchernad hamming coda for _detechon or evrors . - tt wean extra disk fos storing and paviky info? . X RATIO level—-Z makes use OF bute lerrel stripe One drive is dedicated at- store the pariby Inf®.