\(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion

DOI10.1016/S0304-3975(97)00303-4zbMath0896.68025OpenAlexW2030111945MaRDI QIDQ1127529

Yoshifumi Manabe, Shigemi Aoyagi, Roberto Baldoni, Michel Raynal

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00303-4

zbMATH Keywords

mutual exclusion\(k\)-arbiter

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (5)

\((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem ⋮ On quorum systems for group resources allocation ⋮ Quorum systems towards an asynchronous communication in cognitive radio networks ⋮ SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems

Cites Work

• Finite projective spaces and intersecting hypergraphs
• Another distributed algorithm for multiple entries to a critical section
• A taxonomy of distributed mutual exclusion
• A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
• Distributed algorithms for multiple entries to a critical section with priority
• Nondominated \(k\)-coteries for multiple mutual exclusion
• Planar quorums
• How to assign votes in a distributed system
• A note on weighted distributed match-making
• Time, clocks, and the ordering of events in a distributed system
• Comments on "Availability of k-Coterie"

This page was built for publication: \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion