CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

System Model

Consider a sy...

Question

Consider a system having 'm' resource of the same type. The resources are shared by 3 processes P, Q, R which have peak time demands 5, 6, 8 respectively. The minimum value of 'm' that ensures the deadlock will never occur is

A

18

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

17

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

C

15

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

16

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B 17
(D)
Minimum resources that are required to avoid deadlock
= $(m_{1} - 1) + (m_{2} - 1) + - - - - + (m_{y} - 1) + 1$
Where, m = resources required by process, y = number of processes.
So, number of resources that ensure the deadlock will never occur is
= ( 5 -1 ) + ( 6 - 1) + ( 8- 1)+1
= 4 + 5 + 7 +1
= 17

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6 respectively. For what value of m deaklock with not occur?

Q. Consider three processes having maximum requirement of resource type R is 5, 4 and 6. The minimum instance of R in the system so that system must be deadlock free is _____

Q. Consider a system with 29 resources. There are n processes whose demand for resources increases by 1 after every 5 seconds. All processes arrive at same time & starts with demand as 1, 2, 3 etc. For example,

P_{1}

puts demand as 1,

P_{2}

puts as 2, & so on. Processes releases the resources only at termination. How many maximum number of processes we can have to ensure no deadlock, if every process requires 2 2 seconds for execution is ____

Q. System has 5 processes with a single resource R having 'K' copies. Each process needs exactly 3 copies to complete their execution. What is the max value of 'K' for which deadlock occurs?

Q. Suppose n processes,

P_{1}, . . . . P_{n}

share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process

P_{i} i s s_{p}

s_{i} > 0

. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

System Model

OTHER

Watch in App

explore_more_icon

Explore more

Join BYJU'S Learning Program

CrossIcon