a 5 UNIT-3 Procens Concept Oe{Mhition: The program undue execution is Callid the process Th should Juaide fn the malin menor TE In occupied by CPv bb execu the Instruction. Process uall have jolloustng abbributss (hy Procens, tds Tk Is the unigus iduntificadion no. which iy e.ssigned by the 08 ak the Hime 4 proces creation. No tuo proces hove same proces id. GI Proves ata ¢ Tt contains the Gwount stats gf He process wohow It is susiding. Proteas have Niotiows stake tn cchich pavdioulan stots tt is Yesiditng ak a. porkiadaxe time this injorrration 16 provided by the procens state (ii) Pret aon Counkin’s Tk Contains the addvuus of next tstruction to be execubd. (W) Priority J Tk is the pooamdsn cahich is ausigned by the proces that fi medion vill be maintained th gunviat purpose Supls er. (yy Gund purpose Supt’ Truse aru the Sugiaboa Used by thw process to maintain information.(i) Ut of open File. + Thue aru the flW Used by or opened by the process. Thuse {ilu information will be matntained fn te List of open file attribute o} the procens (Wi st of open davies? What au all the devices used or opined by the process , thak fnjormadion will be maintained fn the List 6) open duvice abtribule othe process. Process tn Memory ; Process th a progam fn exeuukion. is sometimes known Od text section. + A process gun abso fnduds Micke | the process stack, which contains y temporary data Caudy os dunt® parameters, retwin address , Local max ioniiabl es), pee * Dota section contains global vertiables | huap | + A protena may alo tn a heap «Rate which iy memory that ja di Nawnica ty : AUotoded to process dweing nun time, Fig: Proves th memory Thu atrusbwwu of proves in mamory Th shown én figure | tA Progam beromes a Process whin an executable tile Ay Looded tnto memory.Procena stale: As the process evecutu, it changu th state. The tect of Protens Is dij by the Guwvunt activity 6} that process. A procean Moy be fn one of te following stokes 3- b News The procems to being Creald, 2 Running | Instructions ont bung executed, 3 Waiting : The proteas is waittng Jor some event to occu Couch a3 an Zo completion or surepton a signal) uy Reody +The proveas Ip usu ng to be Assigned to @ processor. 5 Terminalid: The process has pinished execution Cerminatsad) figs Biagsarn 0} proveas Atatt eesProcess Po Proves Pi Seung Interrupt or system call fa (Essences, Tah rom PCB) | eutry nterrugt ot 4 ae lt AVE Atake nS PcBy . (Rdload steia from PoBo) [Reload seh, prom PeBo) rom PLBO dle exeuttng, fy: Diagram id CPU Awiteh from Protens to proveas Protas Transition DiagramCNuo>) * Lhitially the procens will be fn the new stat , T urdve Creakion or being crealud. ——~eahtd Sy — es Yea) ¥ Once the process ts creatad , it will be moved to Reody stati. # Tn the reody stati, wu. will be mublipl no- of process. # One of EX protess willl be aductad }rorm the state and it will be dispatched /écheduled for the running stall. ch ass : oa New Reocly Run + In the running aati, Hou uaill be one process ok any ‘ebonee point o} time ¥ When protess Ys on running tab, it occupied CPU and exeuit all its fnatrudions. # I} te ey proto suguire any LO operation it will be moved to wait or Block stab. In the wait abate, the process will podorm T]o operation, Once the Tlo operation is completud , tre process will go to Teady state. if means process& Thou will be multiple no- of processes tn the walt stall, iE means the multiple proceses will purorm the tlo operation, bimulta- Neously, # When the process a fn the ready, running and block states it means process 1 residing fn the mafn memory. + Once the running process complutid its execution, it wt in the tuimination “stab. Mulkepregtamming OS Is caltgerised (nto two type *- + Non- preemptive 4 Preemptive (ehio Callid cs mulktasking) or Birme shaving Muutiprogtamming 0S Non- preemplive PreempHve 2 ai¥ Coch procems is supresented fin opexig eae sysn by a prem control Bk Pcs) a also Called a task contro! block. | Process Number | * PCB Contuins many proceas of inf* associaktd usith a ppecific process ee Rey to | nctuding these y i p nee Q) Frovess stab The ste may be Lak ol open file. | Reus, ready, punning sai ting tamirlid fer ae b) Program Counters The counter fndicatis Figs PCB thi addvuss of tru net fnatruction to be executid for ths process ©) CPU Registers s Te neq taters Voxwy fn no- and type, duperding on tu compu unit i i tndudl aceurnulators , Index 2ruglatesy stack-pointer & bral purpose wegisto, pilus any condition cod inorma- Aon. ‘he with tht progsam counter, this stots information must be Aaved ushen aan interrupt acurs, to allow be process to be continu correckly aftouvands. d) CPU scheduling {nfs The frp" frelualus provess priority » pointous to acheduling quiuis and any thor bchedulg pox amen,@ Memory Managument Inf" This thy" moy tneude auc ums ay the value a) Hu base Gnd Limit xegfatou and the tably or the segment table, fueling an the mana syston used ty as * Acceunting tn)"; This fn} feuds tu amount of cbu and sual time used, Limits, Alc No, jobs or process | No: and 0 Nn. * Lio status fn)"s This tr)" indudy the List of L/0 dwvices allocated 40 the procera, a List of open fils and soon. Process athedudiy duns Job Guin’ set gf allt processes tn the system Reody Gua § se: of alk procenses iy main memory realy & ale. waiting to execute. Device Guu $ se Gf processes waiting Jor an T10 device. # Noles Proces Migrah amorg the worrlous qu. Representation c) Provan aching et Or eee, jt Ra J Time slice eypired Child for a. ex child. walk for ai 6 tnterrup!Schedules Jn OS, Huu ae 3 difpount senedulva b Long dotm: or Tob scheduler Jt i suaponsible Jor creating and bringing te new preteen’ fnto the system, 4 Short tum on CPU schedlulak, Tt Lb susponuible je a) one of the provead fn ready stab jor scheduling on to Ent running cot. 3 Mid tun or Medium tou acheduloe Kt Us dwponsible jor suspending and resuming Ene processor. Tht job done. by mid- term Aunedulur is Cold Ene susapping. tally executed = Boda sep cut > end ftlo waiting Guu Figs addition o} mettiom boon sunedubing fo the quuuing oliagiam ¥ The long toi sehedulue executir much tus Lrquentty, + Th dom buhedulue Controls muliprog r . no ate fn memory), on ae q ey oe — #3 the dug of mulkiprogiamming ts stable, then the average rate of protess Creation must be equal to average dipartwie rate Gh procenses Leaving the sym,“The tong term ached, may need to be tnvoked , only when a Provens btaves Hu system. + Becatue of the donger tntvrval Hor cxeuution, thu Long Loum brntdulie Lan abtord to taki more time to dicide udhich presess should be selucted for executian, * St ts Important that the ong “Aviny schedule make a Corupul peluctions, & $n ginewd most procesa can be duuribed as thr L)0, bound or CPU bound. * An Lo bound is one that Apends more ofits Hme doing Lo than it ppends doing Computation, * A CBU bound proces, ginuals to vuquust frfrequentty using more 6} is Lime doing Computations. ¥ Tt important thot Ls selicts & good, Proveas mix of Lo bound and CPU bound. Ly all the process at Llo bound ther Quan Usidl almost always be empty and tne short tuum schedule uuill Hove Jit do do. 4 al processes ou Cpu bound, Ent To usoiting quivu us always be empty, divices will gp unused, ond again sytem wlll be unbalanced. The system sill but poformance wsll thus have combination Of CPU and To bounds processesScheduulvus Compaxison a mong & Long Jum Sehedulne Short tom Schedule Medium lon Scbeduloe Ir BE i a job achualn [bisa CPU Sthdul ~ |obia a procens stsapping Achedule % Speed is Lussue that short] Speed i ut Peed 1s Jastest among! Speed is in between both term Achedulin othun two. % Short ond long an ache a re the ight of IS Provids Luser contro} | St reduces the as ; progam) a dager Gf rmuliprogia trulliprogeamening 4 ME is almost abvent or | 4+ ix also minitral tr |$t Js a past o} time Shaving Minimal fn time Abating time ahaning ayclam uyptns: 5 St Adu prowess from 4k selids those pi St can re-tntroduce the process pool and Joods tnuminto ughich a ready 10 cxeu [nto mennony and txeution Mmesnory qwution |e can be Continud