Timpul mediu de raspuns va fi (4a + 3b + 2c + d)/4

Timpul mediu

(T1+T2+T3+...+Tn)/na

Timpul de raspuns

T1; T1+T2; T1+T2+T3; T1+T2+T3+T4;

A(18) - 7 B(25) - 8 C(11) - 3 `` E (8) - 5

Primul venit primul realizat

A, B, C, D, E

(18 * 5 + 25 * 4 + 11 * 3 + 29 * 2 + 8 * 1)/5 ele 57.6

Quant13

A(5) B (12) C D(16) E A B D(3) D

(13 * 9 + 13 *8+ 11 *7 + 13*6+8*5+5*4+12*3+ 13*2+3)/9 = 55,6

Cea mai scurta prima

E, C, A, B, D

(8 * 5 + 11 * 4 + 18 * 3 + 25 * 2 + 29) / 5 = 43.4

Planificare cu prioritate

D,B,A,E,C

(29*5 + 25*4 + 18 *3 + 8*2 +11 ) /5 = 65,2

4.Timpul ramas minimal

Quantum = 12

E(8),C(11),A(18),B(25),D(29),A(6),B(13),D(17),B(1),D(5)

(8*10+ 11*9 + 12*8 + 12*7 + 12*6 + 6*5+12*4 12*3 + 1*2 + 5) / 10 = 55.2

Planificare cinstita

U1 � A(50),B(30)
U2 � E(70)

Quant �22

50/50

AEBEAEBE....

A(28) E(48)B(8)E(26)A(6)E(4)B(0)E(0)A(0)

66,6/33.3

ABEABE.....

A(28)B(8)E(48)A(6)B(0)E(26)A(0)E(4)E(0)

75/25

ABAEBABE...

80/20

ABABEABABE...

ALGORITMUL DE PLANIFICARE A SISTEMELOR CU TIMP REAL

Perioada P

Timp de procesare T

(T1/P1+ T2/P2+�.Tn/Pn)<1

P 100, 200, 500, 400

T 50, 30, 100, 80

(50/100+30/200+100/500)= 0,5+0,15+0,2=0,85<1 procesat

(50/100+30/200+100/500+80/400)= 0,5+0,15+0,2+0,2=1,05>1 nu procesat