Distributed mutual exclusion on a ring of processes
Science of Computer Programming
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Performance of distributed sparse Cholesky factorization with pre-scheduling
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Lazy release consistency for distributed shared memory
Lazy release consistency for distributed shared memory
Modeling Communication Overhead: MPI and MPL Performance on the IBM SP2
IEEE Parallel & Distributed Technology: Systems & Technology
A performance comparison of fast distributed mutual exclusion algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Fault-Tolerance for Token-based Synchronization Protocols
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
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
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Verification of a Hierarchical Generic Mutual Exclusion Algorithm
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of such criteria as the number of message exchanges and the response time. Our results indicate that the Star algorithm achieves the shortest response time in most cases among all the algorithms on a small to medium sized system, when processors request for the critical section many times before involving any barrier synchronization. On the other hand, if every processor enters the critical section only once before encountering a barrier, the improved Ring algorithm is found to outperform others under a heavy load; but the Star algorithm and the CSL algorithm prevail when the request rate becomes light. The best solution to mutual exclusion in distributed memory systems is determined by how participating sites generate their mutual exclusion requests.