Juraj tefanovi 2.

prednka z predmetu Operan systmy

ivotn cyk us procesu a p novanie procesov.

!erzia "# septem$er%decem$er 2&&'

(ttp)**+++.fiit.stu$a.sk*,stefanovic*info*os*inde-.(tm

.nter eaved e-ecution of processes on mu tipro/rammin/ uniprocessor. 0rocess e ements) % pro/ram code 1s(ara$ e2 % set of associated data 1varia$ es static# dynamic2 % 0rocess 3ontro 4 ock
% identifier 5 o+ners(ip % state# sc(edu in/ info % priority# privi e/es % pro/ram counter % memory pointers# stack pointer % conte-t data 1re/isters in 3062 % .*O status 1re7uests# devices# open fi es2 % accountin/ info % .03 1.nter 0rocess 3ommunication2
2

8atartovanie# zavedenie operan(o systmu

- architektra potaa (pam, procesor a...)

- firmware, setup softvr - z ro! opera"ho s#stm$ ( isk, sie, ip...) - bootovac sektor - roz e%e"ie pamti "a as pre proces# a as pre s#stm - vz"ik p%&"ova"ia procesov a poiato"' proces

9(e :erne
a2 non%process kerne $2 functions of kerne e-ecuted as separate processes

!ykonate;n s<$or
e-ecuta$ e fi e .e-e .out ...... r=zny formt pre r=zne operan systmy# mo>nos? interpretcie v inom systme 1@inu-...2 v#tvore"ie proces$ z v#ko"ate*"ho s+or$, e-ec(o,k e) pam proces$ o+sah$!e, te-t &ta z&so+"k

!o anie s u>$y operan(o systmu 1system ca 2 proces cAa5$ $ a$ a$ a aAa5B printf1CDdC# a2E kni>nin proced<ra 1printf2 sysca 1parametre2 o$s u(a pod;a >e ania zanec(anie <dajov skok na proces ete mo>no nieo pokraujeme...
.

vo anie s u>$y

innos? systmu

0reruenie procesu 1process interrupt2

- zdroje preruenia) FG# HG - priorita preruenia - adresa 1vektor2 preruenia 1interrupt address2 - zkaz a maskovanie preruenia - o$s u(a preruenia 1interrupt (and in/2 - vo anie s u>$y jadra 1system ca 2

Ie>im innnosti
- privi e/ovan re>im# sprvca# jadro%kerne mode - neprivi e/ovan re>im# pou>Jvate;# user mode

Kueuein/ system Hystm (romadnej o$s u(y

Lavid M. :enda BNO" mode # ktor pou>Jvame na r=zne <e y 7ueue P rad# front service p ace*server P o$s u>n miesto Operan systm a proces) vy$avovanie radu akaj<cic( procesov

dispatc(er P s+itc(in/ code process spa+nin/# creation of c(i d process process % runnin/ % +aitin/ in 7ueue to run % s eepin/ 1+aitin/ for some event2 % suspended 1/o out from memory2
11

ivotn cyk us procesu % zk adn princJp

11

Hystmy so zdie;anJm asu 1time sharing2

:ritri na efektJvne p novanie procesov s<)

spravod ivos? 1fairness2 P pride enie 306 efektJvnos? 1efficiency2 P nezdr>iava? sa sp<?anJm enivcov o$rat 1turnaround2 % as >ivota procesu o najkratJ as akania 1+aitin/ time2 % priemern as akania na spustenie priepustnos? 1t(rou/(put2 % za asov< jednotku dokoni? o najviac rc( a odozva 1response time2 P pri interaktJvnej prci

B % a /oritmus p novania 1scheduling algorithm2 2 % pravid p novania 1scheduling policy2.

metQda p novania Ride 0eek oko oS 1round Robin2 metQda Rp novania pod;a priorityS 1priority scheduling2

A:5432-----11O krt2 B:----321---1" krt2 C:-------21-12 krt2

metQda Rdynamickej priorityS P opakovan prepoJtavanie metQda Rviacer radyS 1multiple queues2 metQda Rnajkratia < o(a najprvS 1shortest job first2

trvanie < o() as ukonenia) preusporiadanie)

' ' T

T T T B2 BU 2& 1priemerne BT akm na tart2 T T ' 1priemerne BB akm na tart2

metQda Rzaruen p novanieS 1guaranteed scheduling)

@itt e(o vzorec 1Littles formula2

@AV.G
@ je priemern dW>ka radu 1poet akate;ov2 V je priemern frekvencia prJc(odu novc( akate;ov 1poet*as2 G je priemern as akania v rade.

: asick a /oritmy p novania procesov nerieia tieto pro$ my)

prepoJtavanie priority vetkc( procesov za?a>uje systm nie je vopred zaruen presn as odozvy ani dokonenia procesu ap ikcie maj< ma vp yv na nastavovanie svojej priority nekontro uje sa ve;mi riziko pre?a>enia systmu 1ko;ko procesov ma-X2 aj proces s vysokou prioritou v>dy musJ aka? na Ya J tak podo$n systm m=>e $y? za( ten prJc(odom mno>stva po>iadaviek naraz

2 metQda Rdve a viac tried p novaniaS % in a /oritmus p novania 2 metQda Rpo>ianie priorityS 1priority lending2 2 inverzia priority P vyJ s< za$ okovanJ 2 metQda Rspravod iv p novanieS 1fair share scheduling2 prJde na skupinu 2 metQda R(roziace(o termJnuS 1deadline-driven scheduling2 2 metQda Rstanovenia kapacity systmuS % ka ku cia o m=>eme zarui?
to sa ne$if ujte )2

Lru(y procesov z (;adiska strat/ie p novania (ard rea time % dodr>an najneskorJ as pre tart soft rea time % vZinou m $y? dodr>an isoc(ronous % periodick innos? v presne definovanc( interva oc(# ktor je >iad<ce dodr>a? rea %time % o$asn innosti# rc( e spracovanie time s(arin/ % o$asn spustenie procesu je v(odn $atc( jo$s P procesy# ktor sa nepon(;aj<

3oz%4e"ie po!mov, proces

a v%&k"o

(thread ) proces m& o

prro # a"' !e e" ria iaci +o

viac ria iacich +o ov v r&mci !e "ho proces$, 5 viac v%&kie" spr&va procesov a6a%e+o v%&kie"7 vec s%$8ie+ a v#+ave"osti ko"krt"eho opera"ho s#stm$ or9a"iz&cia i""osti v%&kie" v r&mci proces$, vec pro9ram&tora, ako v%&k"a spo%$prac$! v spo%o"om priestore !e "ho proces$
1/

HF[@@ P te-tov a e$o /rafickX \o je epieX

10

0rJk ad) Gin task mana/er 13tr 5 V t 5 Le 2

21

Ov danie ap ikciJ P te-tov a*aj*a e$o /rafick

21

Mrafick menu a prJkazov riadok

22

0rJkazov riadok s potre$ou vedie? postup# a e$o po(od n k ikanie na o$rzky s nejasnm o$sa(om vovn<tri

23