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...
What are three major categories of physical impairment?
What will be an ideal response?
If the correct spelling appears in the _____ list, click to select it.
A. Recommendations B. Hints C. Suggestions D. Synonyms
Odeo uses a(n) ____________________ media player to stream the audio or video within the Web browser.
Fill in the blank(s) with the appropriate word(s).
Following are the steps in the process to convert from infix to postfix form. Put them in the correct order by writing the number of the step in the blank to the left.
_____ When you encounter a “)”, pop operators off the stack and append them to the end of postfixExp until you encounter the matching “(“ _____ Push each “(“ onto the stack _____ When you reach the end of the string, pop the remaining contents off the stack and append them to the end of postfixExp. _____ When you encounter an operand, append it to postfixExp _____ When you encounter an operator, if the stack is empty, push the operator onto the stack. However, if the stack is not empty, pop operators of greator or equal precedence from the stack and append them to postfixExp, stopping when you encounter a “(“ or an operator of lower precedence or when the stack becomes empty. You then push the current operator in the expression onto the stack.