A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Journal of Parallel and Distributed Computing
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
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
Hash-based Byzantine fault tolerant agreement with enhanced view consistency
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.02 |
This paper presents a quorum-based distributed algorithmfor the extended group mutual exclusion problem. Inthe group mutual exclusion problem, multiple processes canenter a critical section simultaneously if they belong to thesame group. Processes in different groups cannot enter acritical section at the same time. In the extended group mutualexclusion, each process is a member of multiple groupsat the same time. Each process can select which group itbelongs at making a request. The algorithm for the groupmutual exclusion cannot be applied for this extended problem,since there can be a case that two processes are preventedfrom entering a critical section simultaneously evenwhen they are capable of doing so. We call the above situationunnecessary blocking. We present a quorum-basedalgorithm that prevents unnecessary blocking and show itscorrectness proof.