Using Logical Rings to Solve the Distributed Mutual Exclusion Problem with Fault Tolerance Issues
The Journal of Supercomputing - Special issue on embedded fault-tolerance systems
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fault-Tolerance for Token-based Synchronization Protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Analysis and Evaluation of a Distributed Monitor Construct in Java
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Token-Based Read/Write-Locks for Distributed Mutual Exclusion
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A Fair Fast Distributed Concurrent-Reader Exclusive-Writer Synchronization
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Scalable Distributed Concurrency Services for Hierarchical Locking
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Scalable hierarchical locking for distributed systems
Journal of Parallel and Distributed Computing - Special issue on middleware
Implementing distributed mutual exclusion on multithreaded environments: the alien-threads approach
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
| Hi-index | 0.00 |
Several fast and low-overhead distributed mutual exclusion algorithms have been proposed. Each of these algorithms required O(log n) messages per critical section entry and O(log n) bits of storage per processor. In this paper, we make a comparative performance study of four distributed mutual exclusion algorithms. Since the algorithms we study are the basis for distributed synchronization, distributed virtual memory, coherent caches, and distributed object systems, our results have implications about the best methods for their implementation. We find that the distributed synchronization algorithm of Chang, Singhal, and Liu (1990) has the overall best performance, though other algorithms are more efficient in special cases. In a system of 350 processors, the CSL algorithm requires only six messages per critical section entry, including the initial request and the token response messages.