My favorites | Sign in
Project Home Wiki Issues Source
READ-ONLY: This project has been archived. For more information see this post.
Search
for
  Advanced search   Search tips   Subscriptions
Issue 8: 2.10 Exerices 9
1 person starred this issue and may be notified of changes. Back to list
Status:  Done
Owner:  sergeypr...@gmail.com
Closed:  Sep 2014


 
Project Member Reported by sergeypr...@gmail.com, Sep 4, 2014
Exercise 9. Define r-bounded waiting for a given mutual exclusion algorithm to
mean that if DjA →DkB then CSjA →CSk+rB (see correct formula in book). Is there a way to define a doorway for
the Peterson algorithm such that it provides r-bounded waiting for some value
of r?
Sep 4, 2014
Project Member #1 sergeypr...@gmail.com
As far I found in presentation to book (see http://booksite.elsevier.com/9780123705914/ chapter 2/page 91), for first-come-first-served - r must be 0, but for waiting I think i must be 1, because it r+1 some non-intersection interval, in this case thead will be wait
Sep 16, 2014
Project Member #2 sh.ba...@gmail.com
(No comment was entered for this change.)
Status: Done

Powered by Google Project Hosting