资 源 简 介
Mutual exclusion is typically done with Lamport-like mechanics and semantics where distributed processes or threads broadcast or multicast their requests for mutexes. Though theoretically some QoS is available via relinquish messages, this results in high message complexity (broadcasts/multicast inherently involve O(n) message traffic per request) and long synchronization delay (typically maximum transmission time between any two nodes in the network topology, since a reply is required from every process to enter a CS).
We combat these issues using quorum-like techniques but without a lot of the overhead in planning that comes with quorums. Further, we gaurantee better QoS performance (especially in regards to priority inversions) by using a token like system in a m-way tree topology to allow distributed, fine-grained control over priority entrance into a critical section.
The technique allows for weighted fairness as well as strict priority, and even with weighted f
