The Gateway to Computer Science Excellence
0 votes
99 views
Suppose $10$ processes $P_1$ to $P_{10}$  share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a processs $P_i$  is $S_P$  where $S_P$ is greater then $0$. The maximum value of

$S_i\left(\displaystyle{\sum_{i=1}^{10}S_P}\right)$ that ensures deadlock does not occurs is ________ .​​​​​​​
in Operating System by Loyal (5.6k points)
edited by | 99 views
0
ans 16?

1 Answer

+1 vote
Best answer

See the logic is suppose there are N process with each max demand D$_{di}$ ,then to avoid deadlock give all process D$_{di}$ -1 resource +1( resource to avoid deadlock)   got it? not then think why it will not lead to deadlock.

So,$\sum_{i=0}^{i=n}di$ - n +1= 7

Solving it will give total demand as 16.

by Active (2.3k points)
selected by
0
here each process will get 1 resource and 1 process will get 7  resource

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,492 answers
195,471 comments
100,773 users