as Name 5 M-Hevshitha ane Fol no 2 22. VOIAOS 14. | STO > eke | Sublect operating System. — = a @| explain cpu Schedting algorithms CPE Scheduting 16 @ proces bo we the cpu while another Process tg clelayed duet revel la bitily of, any eSources such 25 to ek, mating full we of tte cpu. The purpase obepy Scheduting 16 to malic the Syslem move effrcient Fesler and Leiver “There ave mary tase types of, Scheduting incthods * pré-emphive Schedutin Preemplive scheduting 16 wed then apwcess switches from Tunning Stale Ip ready slate or Soom the wnilng slale Io he eady slale: © Non- precinplive scheduting: * nbn Preempleve sthedatig is ued tahen a process ioe orwhen a process seilches on running slate lo wociling ae © eral come Einsh serve = FeFS* considered le be the simplest of ait operating syslens Schecluting algorithins «First come Aisl-sevwe scheduling algerition Slales thal the process thal requesbs Whe cpu fish is alloca lect’ the Cpu Al 1S allocaled he cpu foal and 1S Implimen lel udin,‘ chavackerislies of Fores “FOES supporls non- pre-emphive and. Preemphive cpv scheduling | algorithms * wks are aleoays execuked ona Fisl-come, Pisl—sewe concep * Fers 36 easy L implement and use: * This algorithms 16 ral much effeient te) pesformance pand the \ wail lime: tg quite tigh : xb ‘ 7 : process 1D. | Anvivall Lime Burl bine. pv o \ o.- . ‘ . 6 PR 2 S P3 3 senay P+ % 4a ) + process id ads Like the nanc of te process . iLvcpresenked with numbers p Lelbey 7 < amival lime which ts required for the process L enter the ready aucue or the ime cohen process t6 ready to be exeeubedl bythe cpu. ‘ . set . F + But hime 16 the dime lol which the pweess requires bo compicle the process 36 known atthe bunt dime: > comptetion Hime otal time required by the-cpo 4o conpiete the Process is Fine of competion Hime. . . * The Lime taken by che cpo ince he process tos been ready bo exeeube 36 Known af cur around Ume TAT= cT-at° roailing Lime ihe lime dhe pwcess hat been sailing lo comptek - ils process since the assignment ae process for comple lion eoalling can be caleutaled ost the hetp of Turn par lime and burst lime. Formula: + WT > taT- BT + Gant chast i6de place vohere all the abvcady exceulel proses are éléred. Wel for toailing , comptelion and tar hme. proccss io | Arival time Buxsl- ime |compiehn Turnaran} coating eal | bme | me | rie | PI o | 6 I 6 6 ° pa | a. fps eae alee as oe ; F3 3 \ lq |é a a + q | 1g \te 5 Fs i cena g 26 | 21 13 caantt-char- pi | rz [rs [pe [os [ ° 6 8 4 (g 2% avg od complelion dime + Avg = CTA HCTZ3 + CTE HOTS In Avg = 648494426 1S = 13-4 avg of TATE Aug = Gr atcrierat |e = 106 avg KITE Avg WiT= O44 54 5413 1- [eee —i ‘ @ shortest Job Aisl Cs)! 164 sthedubing process mare he o roaileng proccss catth the matical exceulton time bo exec ri l This ec heduting method may or mag nol. be preemilive ~sigorlican Iy | eat | reduces the averoge wailing Ime Lor oer prccesses coating tobe) exceuled . « chavadknislie6e Sar eerie Laval avg wat ling bine. “his i reais alll keavy pwocesges are exzdiolead alte fast 0, mais * reason alldbe” very Sinall pwolesses axe cxeuked shard proven slawab'on of, emall processes - ; this used as measure of lime +y clo cach ackiily alc if shorler processes conlinue 40 be produced ‘ hunger might veal. The idea of aging can be used lo overcome this issue ee processio| Amival. line) Busl-time | shading Tcomplelinl rar fur PI oO 3 fo | 3 | 3 e } P® 3 + 34 | z | 4 ° P3 J as q 12 g 3. > canlt thoes | en eel A) px | PB | |> bun od tat b 1500 |? Sum od Kir s 3-00 | > Avg od rat §-00 | Avqg of HTL 4.00,0S : am = AS privity schedting 2 Preemilive metod of © process first - of. epo stheduting works based onthe priovily +10 this axtgorithar most imperlanl precess ae bedone . Highest Number is ‘considered as Highesl prorily alee | D hen a dash with a Lower priority is being performed whiteq task coith a higher priory arrives. the lash, estth tne fosser prosil ¥6 vepliced by the Lash earh'tne higher purity sand the tall ts Slopped onli the exee Araished. 'on to -Hnis | pres prioe onival bust | CL tab ar [ re pay 2 | 0 5s | 5 [5 /° 6 | PC) + Q 3 14 li | q 4 | Pa) js [3s ja n | ge | 4 $ pea) Jt fe fae fg (3 ' Sam of. TATL 28-0 Sumodt wre tao avgod lab + 2-0 avg od Wits 3-So_— é @ Round Robin bchedubing L . \ | & sine Le Scheduling is the moslty uses ae i i lun t6 sometbing whichis semoved forom fl Time quan Hime. and Lels “Ie chunk of praces lo be comple led. - Time baring 18 the main peodlocked Processe£ are involved ina elvewlar chain euch that each prcess holds ave ane or move yesourles being requesled by the nent process In dhe chain.oan > Methods of Harding deadlocks - There are four approaches to dealing esith dead loch. ® deadtech prevenlion ® veodeoth avoidance C Banker's algorithm) ® veaddech clekelion 4 Recovery NY | @ Dead tock rgnovancé . t : ©, ceadhtock prevenkoo- sL16 designed dhe syskm an, cee way thaltse possibitiy! ofdeadtochis excluded. ~ indtyed. mehods preven occurance ef deaddgchr mutual cxelution, 70 pre-emphion and hold and wail- : A Pred method prevents the aceurance pf. ctreular oat. * The tdea behind he approach 's very simple: thab-eoe: have lo fail one of the fouy conditions bul there » cen be a big auguavent on iks physical implementation . ® Dead Locks avoidances t | ; " deadéocl avoidance ithe operating stone hedas cohethe the | 5 ' 1810 gele slate ov in unsafe glale at everp Step which the | a "4 Syskm performs. The Pecess continues unbl tbe sim i6 in safe chale: once “the ayishery moves’ bo unsabe stake | Onee the: Syskm moves the 05 had by baukbeas one step » hon ‘ Senhers algorithms £ 16 yeadourre cxtrocebion and deackialh avoidance algorithm develo d dor sley, Bread Bo, bY 4s onthe Hal | y Simulating the allocabon. of predekamined renuirntt Es toe ee ; peessibie amounts of a VeSourtes- + Bankers algorithm et Asto, Be5, CE p \ Anscaion | marnecd ~ | curenl need — "hte | a ee po old +53 B32 | Pr] aco BRR SBA Pa Boa. QO: 345 OB iret ea 445 Pal oog 533 455 oo) 105? | phere warned Ned = Need Z work, * Remaining= max ~anoe PO= 4432 33a% Pre laa 233aCr) = 3324 R00 = SBR Paz 6002 532 (x) P3= ail £538 Cr) = 53a420 = 443 max~Attocabion. Croor = eoortis Antocalion) docsn't exceed the given ABcvalucs * cunenl need + olal Anocabron — gi¥eO ABE values Available = Available +Anocalion 143 IRQ 600 aul - 53) pr = 5812903 Cr) =143 4 002 =A4a5 POS made 4s “V4 4 OW =a455 P= 600 425% = 157 g Rog = (os | Rematning need |@ eacleoch delechon and vecoverg > , N This approach Let the process daltin dead Loc anel then \ portodteally cheeky taherher deadlock ocwuy in the syskm or ral! iFiE occur hen it applies some of he vecoverg metheds toto Byslem to gel wid of deadlock . © Dead Loch Ugnorance !- | Th ¥6 wed. Sorend uber uber. thetmply donose deadlock . imhis roethod .the wer has lo simoply geslart the compuky in the cade ot dleadleoclr « *bapptics Htbe deadlock occurs ee ravely - This alg ony 15 about if the dead lou. accurs simply ve boot the system and ack file the deadochs never occurgel . ib 15 cabled as beveh Algorithm : , , . : ©) whal- are diflerent- Lypesobos! , ; : | An operaling Syskem Performs: altthe basic tasks LiKe managing | Ales, processes, anel memory . The. operating Syshern becomes ao, toledace bebocen the user and machine. 16 a dpe of sofloare thal-_cooms ob an thedace behocen she syskon progsam and the harelusare . There ave Seve rol types of opevabing sytem » ® Bakeh opexallng Syphon L This type of operabing 6yskem does not veausth the compuer ditedty. There is an operator eahich lalses sinoilar gobs nd dhe game xequivement and gps them into balehes «ib isPs it i the vetpons bil of. the. operalor lo sok Yobs with similar | | mull — progeammn Ing operading system. Thts can be simply tush a more than one program i can be present inthe main memory ancdany one of trem kept in cxccudion This bs bashea lly weddor, bebley creeblon of | weépurtes - | Job | Per ; | Joba Memory pas bons Yobs. . | mea din | 85 Omuk ~ processing operaking sytkm Ths tsa type od 05 tn which more-taan one cpv tS used br | the excculion of yesources «It ‘betlers the throughput od the Syste Regishy Register eal cathe cache cache hdnee@ saulli-toshing 08> \ ‘ alr 7 \ oper \ naushebashing 0s is simply & mnuttipaag ¥ammi'ng P. a fi lg eriths Syslen wr having acihily ofa Reand—Rebin schedeel d A a it can Un mutliple g programs gmutlancously. © time —sharing 06> ” iO each Lash rs given some tine byenecule 50 halal the oaks “| | smoothiy. each vser geb he dine ef the cpu astrey use Single sysim These Systems arealio Known mulls lashing sytlns The ests canke Sam a single user or diflerent users also- he lime thal each bask gels’ dy execube t§ called quankum : afer complelion ef bime tnkrval 6 08 éesilches la new! . , ‘ @ wish baled. opesabiog Syshmo > tha recent advantement wherevartass autonomous ankeronnede compubers communicake cath each ober esing asharcel communi jon nel. indipendent syskms posses elroun memory unit and cpu-"his os 36 always possibie thakoncuser can access thef la oréw whichave nok preient inbls ayeln bub oters eonncrtdl within meboort @® nebo operaking ythern vee TheSe 08 alloascel shared azcess -Pieluses prokrs rand. nebsorhing hn. over a mall privol neboott. these ave teat al the wleré Gre well award of onderdying contigur Noni of Gull other users althin the neboorh their | individual connedbons. , ® Real-time 05 + won tk Theo type of 05 seve real-bme 5yshins ‘The dime inleral vequireel to process and gespond to Inpuls is very Sinall, eal me sys lms aveuted when thereare me requiremenls hal ave ven shied. . Aihe missibie systems ast cdey fF 4 Define process and. psoce6s Concepls A process Is basicaly a. psogsam in exeuulion. ‘the Seeeak'on ed a process crm progscs5 ina Sequential-fashinu. process Bife cycle! | vohen @ process excuses ih passet-thvough different + These sloges ray differin’ diffesent operaling ystems. 1 © blovt 2 Ths 16 the wwilial dode whena process isdeal slodel led @ready* the process t6 wniling lo be assigned +e a preefer Ready Proecesscaare walding bo have 1 proce 6Sor allocaded Aodhan by the ope sobing Systm Sead the cun run « process may come tole this slabe ofley start late or while yannin Ubey ‘bad inlecuphd by the | Scheduler be eusign epu te donre ether process. © Running once toe paces hos been asi fl to a processor by the 05 Scheduler, tre process elale is set. to yuaning and The processor excatles ths nibaskons . @® readling » protess moves in lotne ecaling slale iil oeeds lo coal for a resource, such oS eoaildag for user inpul., erwoiting foy adie lo become available. ® -teminabed or euib: one dhe process Sinishes te exctallon oy ibis laminaled by the 08 this moved lo-he leeminaled elale cchere thusails to be yemoved Prom main memory,@| robes Themad ! : —) | Thread + thread iS a single sequenal flew of, adivibies being | execahd tna precets « Thicads have Same pscpesties eset the Precery So they arc calted ak fighlescighl processes- Thercare beso tyra of toread. > O wer Level thread Cui! i6 arnpiimenked. tothe wer Bevel Libroy' they axe pol created ualng the sgsker calls. Thread swilcbing doe Me-need Jocat 06 and Locaute tnkrrup! fe Bernal «Hrernal doesn! bmw akout-tbe user tevel bread and managed theny ab ittbey wae single threaded processel . @ hanal Level thread Chr): Mesnal hincws and manag ofthe stcads .tnshad of tread dobre in each process. the Bernal Nset# has fpread labee thal beeps daeuls of att the treads inthe syslera - maddilon Frrnal also mainlatas the Ladibional process, fabie te Freep’ bauk of ee pipette "98 “eral powde Suskmealt te creale and manage fecal. -