| Issue 8: | 2.10 Exerices 9 |
‹ Prev
7 of 7
|
| 1 person starred this issue and may be notified of changes. | Back to list |
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
Sep 16, 2014
(No comment was entered for this change.)
Status:
Done
|