This algorithm uses a spanning tree to reduce the number of messages exchanged per critical section execution.

The network is viewed as a graph, a spanning tree of a network is a tree that contains all the N nodes.

The algorithm assumes that the underlying network guarantees message delivery. All …