Maekawa's algorithm is an algorithm for mutual exclusion on a distributed system.
The basis of this algorithm is a quorum-like approach where any one site needs only to seek permissions from a subset of other sites.
Requesting site: Receiving site: Critical section: Quorum set (
): A quorum set must abide by the following properties: Transactions in Computer Systems, vol.
2., pp.