CECS 526 Assignment 5

Suppose a distributed system is implemented with the Raymond's tree-based algorithm for mutual exclusion, and the

current tree configuration is shown below with Site B being the token holder. (Recall in the Raymond's tree structure,

each node maintains a Holder variable to record its current parent node and a request queue Req.Q to record the sites

where the requests the node has received from but not yet the token they are waiting for.)