Guest nivsah Posted October 1, 2004 Share Posted October 1, 2004 1) In the second attempt towards Dekker's algorithm, is starvation possible? If there are two processes and one processor and both processes want to enter the critical section, show how one of the processes could continually enter the critical section while the other is kept out. 2) In Peterson's Algorithm, if both processes want to enter the critical section, what keeps starvation from occuring? Link to comment Share on other sites More sharing options...
Dave Posted October 1, 2004 Share Posted October 1, 2004 That looks familiarly like a homework problem to me. Don't expect us to do your homework for you Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now