Results 241 to 250 of about 1,000,824 (299)
Distributed Computing, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wojciech M. Golab, Aditya Ramaraju
openaire +4 more sources
Proceedings of the twenty-second annual symposium on Principles of distributed computing, 2003 In the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If two processes are in the Critical Section at the same time, then they request the same session.
Prasad Jayanti +2 more
openaire +3 more sources
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems, 1985 A distributed algorithm is presented that realizes mutual exclusion among N nodes in a computer network. The algorithm requires at most N message exchanges for one mutual exclusion invocation.
Ichiro Suzuki, Tadao Kasami
openaire +2 more sources
Robust distributed mutual exclusion
Proceedings of 16th International Conference on Distributed Computing Systems, 2002 A token based algorithm for distributed mutual exclusion is presented. It uses a distributed counter to tolerate faults due to site failures and communication failures. This eliminates the need for expensive election protocols that are commonly employed in existing token-based algorithms.
Choy, Manhoi
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mutual Exclusion on a Hypercube
Journal of Parallel and Distributed Computing, 1993We present a decentralized, symmetric mutual exclusion algorithm that is tailored to the hypercube architecture. Our algorithm has better time complexity than a suitable hypercube adaptation of \textit{Maekawa}'s \(O(\sqrt N)\) Mutual Exclusion algorithm [A Sqrt(N) algorithm for mutual exclusion in decentralized systems, ACM Trans. Comput. Syst. 3, No.
Ajay Gupta +2 more
openaire +3 more sources