Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Asynchronous Group Mutual Exclusion in Ring Networks
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
Brief announcement: improved asynchronous group mutual exclusion in token-passing networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Journal of Parallel and Distributed Computing
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
A group quorum system of degree 1+√1+n/m
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A regular group quorum system of degree ⌈√n/2⌉
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
Abstract: The mutual exclusion and concurrency are among the fundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a shared resource among a set of processes. The concurrency allows some processes to share a resource.