In discussing Maekawa’s mutual exclusion algorithm, we gave an example of three subsets of a
set of three processes that could lead to a deadlock. Use these subsets as multicast groups to show
how a pairwise total ordering is not necessarily acyclic.
What will be an ideal response?
The three groups are G1 = {p1, p2}; G2 = {p2, p3}; G3 = {p1, p3}.
A pairwise total ordering could operate as follows: m1 sent to G1 is delivered at p2 before m2 sent to G2; m2
is delivered to p3 before m3 sent to G3. But m3 is delivered to p1 before m1. Therefore we have the cyclic
delivery ordering m1 m2 m3 m1…??? We would expect from a global total order that a cycle such
as this cannot occur.
You might also like to view...
A software _____ is a legal contract that defines the ways in which you may use a computer program.
A. registration B. agreement C. license D. authorization
A(n) ________ transfers data between collision domains
Fill in the blank(s) with correct word
Visual Basic Editor can be opened using a button on the Ribbon or by pressing the keyboard shortcut ________
A) Alt + F11 B) Ctrl + G C) Ctrl + Break D) F11
The Split Form Datasheet property can be set in which view(s)?
A) Layout view or Design view B) Design view only C) Form view only D) Datasheet view or Form view