Sunteți pe pagina 1din 1

Shortest Job First Algorithm.

Schedule the following processes using shortest job first algorithms by drawing
the Gantt charts and compute required parameters by completing the table below. (20 pts.)
Process

BT

AT

P1
P2
P3
P4
P5

15
10
9
4
5

0
4
5
11
23

SJF
WT
0
29
14
4
5

SJF

SRTF
TAT
43
10
22
7
9

SRTF
WT
28
0
13
3
4

SRTF

P1 15 P4 4
P3 9
P5 5
P2 10
15
19
28
33
43

P1 4
4

P2 10
14

P4 4

P3 9
18
27

P5 5
32

.
Problem Solving: Draw the required Gantt charts and complete the table below. HPL =10 (35 pts.)
Process

BT

AT

PL

P1
P2
P3
P4
P5

15
10
9
3
5

0
5
5
10
20

4
6
5
4
10

SJF (NP)
WT

SRTF
WT

PSA Pre
WT

PSA (NP)
TAT

RR (QT =6)
WT

P1 11
43

S-ar putea să vă placă și