Note: an efficient distributed token-based mutual exclusion algorithm with central coordinator
Journal of Parallel and Distributed Computing
Fault-Tolerance for Token-based Synchronization Protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Scalable Distributed Concurrency Services for Hierarchical Locking
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Scalable hierarchical locking for distributed systems
Journal of Parallel and Distributed Computing - Special issue on middleware
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Distributed priority inheritance for real-time and embedded systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Priority inversion with fungible resources
ACM SIGAda Ada Letters
Hi-index | 0.00 |
The contributions of this paper are threefold. First, a solution to the problem of prioritized mutual exclusion in a distributed system is proved correct. This protocol is based on fewer requirements than prioritized extensions of other protocols and outperforms other protocols with an average complexity of O(log\ n) and a worst-case complexity of O(n) messages for n nodes.Second, the concept of relative fairness is introduced, which quantifies the relation between parallel events in terms of their ordering in the absence of synchronized clocks. This concept is applied to the protocol in order to determine a requirement to guarantee a certain order between events when message delays are bounded.Third, the protocol is extended to prevent priority inversion by incorporating the priority inheritance and the priority ceiling protocols. The extensions are shown to integrate well with the original protocol. They impose the same message overhead as mentioned before for each dynamically raised priority due to resource contention while early priority boosting, such as for the priority ceiling emulation protocol, requires no additional overhead at all.