Register

Galvin Edition 9 Exercise 7 Question 9 (Page No. 341)

238 views
0 votes
0 votes
Suppose that you have coded the deadlock-avoidance safety algorithm and now have been asked to implement the deadlock-detection algorithm. Can you do so by simply using the safety algorithm code and redefining $Max_i$ = $Waiting_i$ + $Allocation_i$ , where $Waiting_i$ is a vector specifying the resources for which process $i$ is waiting and $Allocation_i$  specifies the resources currently allocated to process $P_i$ ? Explain your answer.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
akash.dinkar12 asked Mar 20, 2019
243 views
Galvin Edition 9 Exercise 7 Question 13 (Page No. 341)
... t always lead to deadlock. Describe what role the $CPU$ scheduler plays and how it can contribute to deadlock in this program.
$/* thread one runs in this function */void *do work one(void *param){pthread mutex lock(&first mutex);pthread mutex lock(&second mutex);/ * Do some work*/pthread mutex u...
User Avatar
0 votes
0 votes
0 answers
2
akash.dinkar12 asked Mar 20, 2019
398 views
Galvin Edition 9 Exercise 7 Question 12 (Page No. 341)
Assume a multithreaded application uses only reader–writer locks for synchronization. Applying the four necessary conditions for deadlock, is deadlock still possible if multiple reader–writer locks are used ?
Assume a multithreaded application uses only reader–writer locks for synchronization. Applying the four necessary conditions for deadlock, is deadlock still possible if...
User Avatar
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Mar 20, 2019
795 views
Galvin Edition 9 Exercise 7 Question 11 (Page No. 341-342)
Consider the traffic deadlock depicted in Figure 7.10. a. Show that the four necessary conditions for deadlock hold in this example. b. State a simple rule for avoiding deadlocks in this system
Consider the traffic deadlock depicted in Figure 7.10.a. Show that the four necessary conditions for deadlock hold in this example.b. State a simple rule for avoiding dea...
User Avatar
0 votes
0 votes
0 answers
4
akash.dinkar12 asked Mar 20, 2019
200 views
Galvin Edition 9 Exercise 7 Question 10 (Page No. 341)
Is it possible to have a deadlock involving only one single-threaded process ? Explain your answer
Is it possible to have a deadlock involving only one single-threaded process ? Explain your answer
User Avatar
Link Copied!