Citation Context

... Below are the four possible states (corresponding to each of the four messages in the logical pattern of X - Y communication), together with the information that X can deduce from this relationship. =-=(1)-=- HOLDERv = X and ASKEDv = false Hence X may be the privileged node, and Y is not an element of REQUEST-Q,. (2) HOLDER, = X and ASKEDv = true Again X may be the privileged node, and Y is an element of ...

Citation Context

...rt and Agrawala [3] proposed an algorithm that required 2*(N - 1) messages exchanged for each critical section entry, while the algorithm of Suzuki and Kasami [4] requires at most N messages. Maekawa =-=[2]-=- further reduces the number of messages per critical section entry to O(m). The performance of our algorithm depends on the precise topology of the network spanning tree used, but the average number o...

Citation Context

...ither the time nor order of message arrival can be predicted. Initially we shall assume that nodes are completely reliable, and node failure will be considered in a later section. Ricart and Agrawala =-=[3]-=- proposed an algorithm that required 2*(N - 1) messages exchanged for each critical section entry, while the algorithm of Suzuki and Kasami [4] requires at most N messages. Maekawa [2] further reduces...

Citation Context

...ll be considered in a later section. Ricart and Agrawala [3] proposed an algorithm that required 2*(N - 1) messages exchanged for each critical section entry, while the algorithm of Suzuki and Kasami =-=[4]-=- requires at most N messages. Maekawa [2] further reduces the number of messages per critical section entry to O(m). The performance of our algorithm depends on the precise topology of the network spa...