Register

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 51 (Page No. 178)

572 views
1 votes
1 votes
In the dining philosophers problem, let the following protocol be used: An even-numbered philosopher always picks up his left fork before picking up his right fork; an odd-numbered philosopher always picks up his right fork before picking up his left fork. Will this protocol guarantee deadlock-free operation?
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

213
views
0 answers
0 votes
admin asked Oct 25, 2019
213 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 57 (Page No. 178 - 179)
Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding $1$ to it, and then appending it to the file. Run ... to prevent the race.(Hint: use ln file file.lock to lock the data file.)
User Avatar
325
views
0 answers
0 votes
admin asked Oct 25, 2019
325 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 56 (Page No. 178)
The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different ... to access the database, and what happens when a process is finished.
User Avatar
204
views
0 answers
0 votes
admin asked Oct 25, 2019
204 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 55 (Page No. 178)
Consider the procedure put forks in Fig. $2-47$. Suppose that the variable $state[i]$ was set to THINKING after the two calls to test, rather than before. How would this change affect the solution?
User Avatar
200
views
0 answers
0 votes
admin asked Oct 25, 2019
200 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 54 (Page No. 178)
In the solution to the dining philosophers problem (Fig. $2-47$), why is the state variable set to HUNGRY in the procedure take_forks?
User Avatar
Link Copied!