k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion
From MaRDI portal
(Redirected from Publication:1127529)
\(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
\(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
Recommendations
Cites work
- A distributed k-mutual exclusion algorithm using k-coterie
- A note on weighted distributed match-making
- A taxonomy of distributed mutual exclusion
- Another distributed algorithm for multiple entries to a critical section
- Comments on "Availability of k-Coterie"
- Distributed algorithms for multiple entries to a critical section with priority
- Finite projective spaces and intersecting hypergraphs
- How to assign votes in a distributed system
- Nondominated \(k\)-coteries for multiple mutual exclusion
- Planar quorums
- Time, clocks, and the ordering of events in a distributed system
Cited in
(11)- A generalized grid quorum strategy for \(k\)-mutual exclusion in distributed systems
- On the road to the weakest failure detector for k-set agreement in message-passing systems
- \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem
- A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems
- Analysis of quorum-based protocols for distributed (k+1)-exclusion
- Self-stabilizing \(k\)-out-of-\(\ell\) exclusion in tree networks
- On Quorum Systems for Group Resources with Bounded Capacity
- Nondominated \(k\)-coteries for multiple mutual exclusion
- On quorum systems for group resources allocation
- Quorum systems towards an asynchronous communication in cognitive radio networks
- Distributed Computing
This page was built for publication: \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127529)