CameraIcon

SearchIcon

MyQuestionIcon

1

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

System Model

System has 5 ...

Question

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?

Open in App

Solution

If each process gets 2 copies of R and falls short by 1 then deadlock occurs in worst case.

Suggest Corrections

thumbs-up

0

Similar questions

Q. A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is

Q. A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

Q. 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

Q. A single processor system has three resource types X, Y and Z, which are shared by three processes. There are 5 units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each process, and the column request denotes the number of units of each resource type requested by a process in order to complete execution. Which of these processes will finish LAST?

alloc request
P0 121 103
P1 201 012
P2 221 120

Q. In a system, there are three types of resources: E, F and G. Four processes

P_{0}, P_{1}, P_{2} a n d P_{3}

execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example Max

[P_{2} . F]

is the maximum number of instances of F that

P_{2}

would require. The number of instances of the resources allocated to the various processes at any given state is given by a matri named Allocation.
Consider a state of the system with the Allocation matrix as shown below and in which 3 instances of E and 3 of F are the only resources available.

Allocation
	E	F	G
$P_{0}$	1	0	1
$P_{1}$	1	1	2
$P_{2}$	1	0	3
$P_{3}$	2	0	0

Max
	E	F	G
$P_{0}$	4	3	1
$P_{1}$	2	1	4
$P_{2}$	1	3	3
$P_{3}$	5	4	1

From the perspecitve of deadlock avoidance, which one of the following is true?

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