Scribd
Upload
13 views6 pages

Lab 8 Os

Uploaded by

lagalas10102000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views6 pages

Lab 8 Os

Uploaded by

lagalas10102000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

6.

current allocation maximum demand need

R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4
P0 0 0 1 2 P0 0 0 1 2 P0 0 0 0 0
P1 1 0 0 1 P1 1 5 1 1 P1 0 5 1 0
P2 1 3 0 4 P2 2 3 5 6 P2 1 0 5 6
P3 0 6 3 2 P3 0 6 7 2 P3 0 0 4 0
P4 0 0 1 4 P4 0 6 5 6 P4 0 6 4 2

available

R1 R2 R3 R4
1 5 2 0
P0 = 0 0 0 0< 1 5 2 0

available

R1 R2 R3 R4
1 5 3 2
P1= 0 5 1 0< 1 5 3 2

available

R1 R2 R3 R4
2 5 3 3

P2= 1 0 5 6> 2 5 3 3

P3= 0 0 4 0> 2 5 3 3

P4= 0 6 4 2> 2 5 3 3

Is the system not safe

6.2

current allocation maximum demand need

process A B process A B proces A B


s
User 1 2 3 User 1 10 5 User 1 8 2
User 2 3 3 User 2 8 5 User 2 5 2
User 3 2 2 User 3 4 4 User 3 2 2
User 4 2 5 User 4 4 8 User 4 2 3
available

A B
10 15

User 1= 8 2< 10 15

available

A B
12 18

User 2= 5 2< 12 18

available

A B
15 21

User 3= 2 2< 15 21

available

A B
17 23

User 4= 2 3< 17 23

available

A B
19 28

6.3

6 processes P0 through P5 4 resource types: A (15 instances); B (6 instances); C (9 instances); D (10


instances)

available

A B C D
6 3 5 4
current allocation maximum demand

process A B C D process A B C D
P0 2 0 2 1 P0 9 5 5 5
P1 0 1 1 1 P1 2 2 3 3
P2 4 1 0 2 P2 7 5 4 4
P3 1 0 0 1 P3 3 3 2 2
P4 1 1 0 0 P4 5 2 2 1
P5 1 0 1 1 P5 4 4 4 4

a.

A=6+2+4+1+1+1=15 correct

B=3+1+1+1=6 correct

C=5+2+1+1=9 correct

D=4+1+1+2+1+1=10 correct

b.

process A B C D
P0 7 5 3 4
P1 2 1 2 2
P2 3 4 4 2
P3 2 3 2 1
P4 4 1 2 1
P5 3 4 3 3

c.

P0= 7 5 3 4> 6 3 5 4

P1= 2 1 2 2< 6 3 5 4

available

A B C D
6 4 6 5

P2= 3 4 4 2< 6 4 6 5

available

A B C D
10 5 6 7
P3= 2 3 2 1< 10 5 6 7

available

A B C D
11 5 6 8

P4= 4 1 2 1< 11 5 6 8

available

A B C D
12 6 6 8

P5= 3 4 3 3< 12 6 6 8

available

A B C D
13 6 7 9

P0= 7 5 3 4< 13 6 7 9

available

A B C D
15 6 9 10

6.5

available

R1 R2 R3 R4
2 1 0 0

current allocation maximum demand still needs

proces R1 R R3 R4 process R R2 R R4 process R R2 R R4


s 2 1 3 1 3
P1 0 0 1 2 P1 0 0 1 2 P1 0 0 0 0
P2 2 0 0 0 P2 2 7 5 0 P2 0 7 5 0
P3 0 0 3 4 P3 6 6 5 6 P3 6 6 2 2
P4 2 3 5 4 P4 4 3 5 6 P4 2 0 0 2
P5 0 3 3 2 P5 0 6 5 2 P5 0 3 2 0
a.

still needs

process R R2 R R4
1 3
P1 0 0 0 0
P2 0 7 5 0
P3 6 6 2 2
P4 2 0 0 2
P5 0 3 2 0

b.

P1= 0 0 0 0< 2 1 0 0

Available= 2 1 1 2

P2= 0 7 5 0> 2 1 1 2

P3= 6 6 2 2> 2 1 1 2

P4=2 0 0 2< 2 1 1 2

Available= 4 4 6 6

P5= 0 3 2 0< 4 4 6 6

Available=4 7 9 8

P2= 0 7 5 0< 4 7 9 8

Available= 6 7 9 8

P3= 6 6 2 2< 6 7 9 8

Available= 6 7 12 12

6.6

Available=(2 1 0 0)

(2 0 0 1)

Request= (1 0 1 0)

(2 1 0 0)

I (0 0 1 1)

Allocation= (2 0 0 1)
I (0 1 2 0)

1) 2 0 0 1> 2 1 0 0

2) 1 0 1 0> 2 1 0 0

3) 2 1 0 0= 2 1 0 0

Available=(2 2 2 0)

1) 2 0 0 1> 2 2 2 0

2) 1 0 1 0< 2 2 2 0

Available=(4 2 2 1)

1) 2 0 0 1< 4 2 2 1

Available=(4 2 3 2)

You might also like