ACM Transactions on Programming Languages and Systems (TOPLAS)
Scalable reader-writer synchronization for shared-memory multiprocessors
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Distributed Algorithms
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Fast and Scalable Mutual Exclusion
Proceedings of the 13th International Symposium on Distributed Computing
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A new fast-path mechanism for mutual exclusion
Distributed Computing
Achieving causal and total ordering in publish/subscribe middleware with DSM
Proceedings of the 3rd workshop on Middleware for service oriented computing
Ordenação de eventos baseada em DSM para middlewares publish/subscribe
Companion Proceedings of the XIV Brazilian Symposium on Multimedia and the Web
| Hi-index | 0.00 |
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing when a process runs on asynchronous network systems and its timing constraint is so restricted that the process cannot perform a local-spin in a wait-queue, which forces it to abort whenever it cannot access the critical region immediately. The WDME algorithm proposed in this paper is devised to eliminate the need for processes to send messages to determine whether the critical region has been entered by another process, an unfavorable drawback of a naive transformation of the shared-memory mutual exclusion algorithm to an asynchronous network model. This drawback leads to an unbounded message explosion, and it is very critical in real network systems. Design of the WDME algorithm is simple, and the algorithm is practical enough to be used in current distributed systems. The algorithm has O(1) message complexity which is suboptimal between two consecutive runs of critical section.