Register

Recent questions tagged deadlock-prevention-avoidance-detection

0 votes
2 answers
128
Galvin Edition 9 Exercise 7 Question 17 (Page No. 343)
Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free.
Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is dea...
User Avatar
0 votes
0 answers
130
Galvin Edition 9 Exercise 7 Question 15 (Page No. 342)
Compare the circular-wait scheme with the various deadlock-avoidance schemes (like the banker’s algorithm) with respect to the following issues: a. Runtime overheads b. System throughput
Compare the circular-wait scheme with the various deadlock-avoidance schemes (like the banker’s algorithm) with respect to the following issues:a. Runtime overheadsb. S...
User Avatar
0 votes
0 answers
131
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 answers
133
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 answers
137
Galvin Edition 9 Exercise 7 Question 7 (Page No. 341)
Can a system detect that some of its processes are starving? If you answer “yes,” explain how it can. If you answer “no,” explain how the system can deal with the starvation problem.
Can a system detect that some of its processes are starving? If you answer “yes,” explain how it can. If you answer “no,” explain how the system can deal with the...
User Avatar
0 votes
1 answer
139
Galvin Edition 9 Exercise 7 Question 5 (Page No. 340)
Prove that the safety algorithm requires an order of $m$ $×$ $n^2$ operations where $n$ is the number of processes in the system and $m$ is the number of resource types.
Prove that the safety algorithm requires an order of $m$ $×$ $n^2$ operations where $n$ is the number of processes in the system and $m$ is the number of resource types....
User Avatar
0 votes
0 answers
141
Galvin Edition 9 Exercise 7 Question 2 (Page No. 339)
Suppose that a system is in an unsafe state. Show that it is possible for the processes to complete their execution without entering a deadlocked state.
Suppose that a system is in an unsafe state. Show that it is possible for the processes to complete their execution without entering a deadlocked state.
User Avatar
1 votes
1 answer
149
made easy test
A system has 10 identical resources and N processes competing for them. Each process can request at most 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N is ______?
A system has 10 identical resources and N processes competing for them. Each process can request at most 3 resources but by grouping of first 3 processes needs only 6 res...
User Avatar
Page: