Register

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

536 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

0 votes
0 votes
0 answers
3
admin asked Oct 25, 2019
175 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?
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 ...
User Avatar
0 votes
0 votes
0 answers
4
admin asked Oct 25, 2019
188 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?
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!